نتایج جستجو برای: distinction

تعداد نتایج: 32783  

2006
Phil Maguire Edward J. Wisniewski

Although various theories of conceptual combination have been proposed in the past, these models have addressed interpretation issues rather than addressing the circumstances in which combinations are used. As a result, existing theories make no explicit predictions about what kind of nouns will be used more often in combination and why this might be the case. In this study we address the issue...

Journal: :IEICE Transactions 2007
Ichiro Yamada Timothy Baldwin Hideki Sumiyoshi Masahiro Shibata Nobuyuki Yagi

This paper presents a method to automatically acquire a given noun’s telic and agentive roles from corpus data. These relations form part of the qualia structure assumed in the generative lexicon, where the telic role represents a typical purpose of the entity and the agentive role represents the origin of the entity. Our proposed method employs a supervised machine-learning technique which mak...

Journal: :Discrete Mathematics 1987
Doron Zeilberger

Let A be a finite alphabet and let DcA * be a finite set of words to be labelled "dirty". Let {Xa: a E A} be commuting indeterminates. To every letter a E A we assign the weight Xa and the weight of a word is the product of the weights of its letters. For example, weight (13221) = X1X3X2X2X1 = XiX~X3. Given any set S of words we let weight (S) be the sum of the weights of the members of S. For ...

2017
Lifu Tu Kevin Gimpel Karen Livescu

We present models for embedding words in the context of surrounding words. Such models, which we refer to as token embeddings, represent the characteristics of a word that are specific to a given context, such as word sense, syntactic category, and semantic role. We explore simple, efficient token embedding models based on standard neural network architectures. We learn token embeddings on a la...

2014
Paul Cook Jey Han Lau Diana McCarthy Timothy Baldwin

Automatic lexical acquisition has been an active area of research in computational linguistics for over two decades, but the automatic identification of new word-senses has received attention only very recently. Previous work on this topic has been limited by the availability of appropriate evaluation resources. In this paper we present the largest corpus-based dataset of diachronic sense diffe...

This  qualitative  study  investigates  the  uses  of  be  in  Contemporary  English.  Based  on  this  study, one  easy  claim  and  one  more  difficult  claim  are  proposed.  The  easy  claim  is  that  the  traditional distinction between be as a lexical verb and be as an auxiliary is faulty. In particular, 'copular-be', traditionally considered to be a lexical verb, is in fact a prototypi...

Ray Casting is a direct volume rendering technique for visualizing 3D arrays of sampled data. It has vital applications in medical and biological imaging. Nevertheless, it is inherently open to cluttered classification results. It suffers from overlapping transfer function values and lacks a sufficiently powerful voxel parsing mechanism for object distinction. In this work, we are proposing an ...

2009
Nadir MATRINGE

Let K/F be a quadratic extension of p-adic fields, σ the nontrivial element of the Galois group of K over F , and ∆ a quasi-square-integrable representation of GL(n,K). Denoting by ∆∨ the smooth contragredient of ∆, and by ∆σ the representation ∆ ◦ σ, we show that representation ofGL(2n,K) obtained by normalized parabolic induction of the representation ∆∨⊗∆σ, is distinguished with respect to G...

2000
Christian Geng Christine Mooshammer

Low dimensional and speaker-independent linear vocal tract parametrizations can be obtained using the 3-mode PARAFAC factor analysis procedure first introduced by Harshman et al. (1977). The following study used PARAFAC to investigate the stress distinction in German vowel production. Tongue movements of six German speakers were recorded by means of EMMA. The speech material consisted of the 15...

2008
Rupert Hölzl Wolfgang Merkle

Among the several notions of resource-bounded Kolmogorov complexity that suggest themselves, the following one due to Levin [Le] has probably received most attention in the literature. With some appropriate universal machine U understood, let the Kolmogorov complexity of a word w be the minimum of |d|+log t over all pairs of a word d and a natural number t such that U takes time t to check that...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید