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

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

Journal: :Journal of cognitive psychology 2022

Learning a language with complex morphology poses challenge to learners, especially adults, who may need acquire unfamiliar grammatical categories. One possible advantage languages is that the could provide cues word meaning. The hypothesis can bootstrap adult learning tested across four cross-situational experiments. Adult learners were exposed words from novel CVCV stems and -CV suffixes. In ...

2003
Vicki Carstens Eugene Buckley EUGENE BUCKLEY

In the Type A Imperfective paradigm of Tigrinya (Ethio-Semitic), unsuffixed verbs have a geminate medial consonant (yÁ-s√bbÁr), while verbs with a subject or object suffix do not have gemination (yÁ-s√br-u). This alternation has been analyzed from various points of view. A fundamental question is whether the more basic stem-form has gemination (Berhane 1991, Rose 1993) or not (Harris 1987, Dena...

2006
Shunsuke Inenaga Masayuki Takeda

The suffix tree of string w represents all suffixes of w, and thus it supports full indexing of w for exact pattern matching. On the other hand, a sparse suffix tree of w represents only a subset of the suffixes of w, and therefore it supports sparse indexing of w. There has been a wide range of applications of sparse suffix trees, e.g., natural language processing and biological sequence analy...

Journal: :Brain Research 2013
Mikael Roll Pelle Söderström Merle Horne

High and low tones on Swedish word stems are associated with different classes of suffixes. We tested the electrophysiological effects of high and low stem tones as well as tonally cued and uncued suffixes. Two different tasks were used involving either choosing the suffix-dependent meaning of the words, or pressing a button when the word ended. To determine whether effects were in fact due to ...

Journal: :J. Discrete Algorithms 2006
Vincent Vajnovszki Timothy Walsh

P. Chase and F. Ruskey each published a Gray code for length n binary strings with m occurrences of 1, coding m-combinations of n objects, which is two-close—that is, in passing from one binary string to its successor a single 1 exchanges positions with a 0 which is either adjacent to the 1 or separated from it by a single 0. If we impose the restriction that any suffix of a string contains at ...

2015
Anna Anastassiadis-Symeonidis

This paper draws a comparison, through semasiological and onomasiological methods, of three Modern Greek (MG) suffixes -in(os), -iatik(os) and -isi(os), which construct denominal adjectives of time and/or space. Following D. Corbin’s model (1987; 1991 and forthcoming) of Construction Morphology, an in depth analysis of these suffixes’ semantics will be presented. The results suggest that, in or...

2007
Karel Pala Dana Hlavackova

In the paper we describe enriching Czech WordNet with the derivational relations that in highly inflectional languages like Czech form typical derivational nests (or subnets). Derivational relations are mostly of semantic nature and their regularity in Czech allows us to add them to the WordNet almost automatically. For this purpose we have used the derivational version of morphological analyze...

2005
Robert Kirchner

Abstract To explain why English compounds generally avoid internal inflectional suffixation (e.g. key-chain rather than keys-chain), linguists have often invoked the Level Ordering Hypothesis (Siegel 1979), i.e. that particular types of morphology, in this case inflectional suffixation, are derivationally ordered after compounding. However, a broad range of counterexamples and conceptual object...

2014
Juha Kärkkäinen Dominik Kempa Simon J. Puglisi

Given strings X and Y the exact string matching problem is to find the occurrences of Y as a substring of X. An alternative formulation asks for the lexicographically consecutive set of suffixes of X that begin with Y. We introduce a generalization called string range matching where we want to find the suffixes of X that are in an arbitrary lexicographical range bounded by two strings Y and Z. ...

2003
Juha Kärkkäinen Peter Sanders

A suffix array represents the suffixes of a string in sorted order. Being a simpler and more compact alternative to suffix trees, it is an important tool for full text indexing and other string processing tasks. We introduce the skew algorithm for suffix array construction over integer alphabets that can be implemented to run in linear time using integer sorting as its only nontrivial subroutin...

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

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