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

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

2006
Silvia Heubach

A partially ordered (generalized) pattern (POP) is a generalized pattern some of whose letters are incomparable, an extension of generalized permutation patterns introduced by Babson and Steingŕımsson. POPs were introduced in the symmetric group by Kitaev [19, 21], and studied in the set of k-ary words by Kitaev and Mansour [22]. Moreover, Kitaev et al. [23] introduced segmented POPs in composi...

2007
Rodolfo Delmonte

We present a suite of applications used for the Italian Treebank which share their linguistic processor and end up finally in higher level annotation tool called “FILES”. The first application “FILES” – Fully Integrated Linguistic Environment for Syntactic and Functional Annotation is a prototype for a fully integrated linguistic environment for syntactic functional annotation of corpora. It ta...

2006
Haythem O. Ismail

Some events recur, and some happen only once. Galton refers to the latter as “once-only" events [1]. In a first-order logic of events that makes a type-token distinction, the possibility of concurrent occurrences of the same event renders the characterization of the intuitive once-onliness not very intuitive. In particular, the paradigmatic case of the nth occurrence of a recurring event is sho...

2010
Kira Gor Svetlana Cook Scott Jackson Jennifer Koran Tatyana Vdovina

There is little agreement on the mechanisms involved in second language (L2) processing of regular and irregular inflectional morphology and on the exact role of age, amount, and type of exposure to L2 resulting in differences in L2 input and use. The article contributes to the ongoing debates by reporting the results of two experiments on Russian verb generation and recognition in a lexical de...

2010
Roi Reichart Omri Abend Ari Rappoport

Clustering is a central technique in NLP. Consequently, clustering evaluation is of great importance. Many clustering algorithms are evaluated by their success in tagging corpus tokens. In this paper we discuss type level evaluation, which reflects class membership only and is independent of the token statistics of a particular reference corpus. Type level evaluation casts light on the merits o...

2012
Pauli Saari Pilleriin Sikka Judith Annett

The aim of this essay is to give an overview of the topic of intrinsic motivation based on psychological and neuroimaging research. More specifically, the objective is to give an overview of the various benefits of intrinsic motivation, discuss its relationship to extrinsic rewards, and review the existing neuroimaging research that has explicitly explored intrinsic motivation. A positive relat...

2015
Luis Felipe Melo Mora Yannick Toussaint

Term extraction tools extract candidate terms and annotate their occurrences in the texts. However, not all these occurrences are terminological and, at present, this is still a very challenging issue to distinguish when a candidate term is really used with a terminological meaning. The validation of term annotations is presented as a bi-classification model that classifies each term occurrence...

2005
Albert Goldfain Fabian Neuhaus Boris Hennig

When addressing the type-token distinction and the problem of universals, an ontological theory will often allude to an instantiation relation. This relation is said to hold between a type and its corresponding token (instance), but is often not specified beyond this description. In this paper, we examine the nature of the instantiation relation in its various philosophical guises. One of the c...

Journal: :CoRR 2016
Erin Grant Aida Nematzadeh Suzanne Stevenson

People exhibit a tendency to generalize a novel noun to the basic-level in a hierarchical taxonomy – a cognitively salient category such as “dog” – with the degree of generalization depending on the number and type of exemplars. Recently, a change in the presentation timing of exemplars has also been shown to have an effect, surprisingly reversing the prior observed pattern of basic-level gener...

2012
Travis Gagie Pawel Gawrychowski Juha Kärkkäinen Yakov Nekrich Simon J. Puglisi

To store and search genomic databases efficiently, researchers have recently started building compressed self-indexes based on grammars. In this paper we show how, given a straight-line program with r rules for a string S[1..n] whose LZ77 parse consists of z phrases, we can store a self-index for S in O(r + z log log n) space such that, given a pattern P [1..m], we can list the occ occurrences ...

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

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