A commonly made cross-linguistic generalization is that languages with extensive case-marking tend also to have greater freedom of word order than languages without. Explicit statements to this effect can be found in Sapir (1921, pp. 66, 177ff.), Jakobson (1936, p. 28) and more recently in Blake (2001, p. 15), but the idea goes back to the beginning of comparative studies of language. Thus on t...

In this study, we looked at priming eVects produced by a short presentation (47 ms) of morphologically complex pseudowords in French. In Experiment 1, we used as primes semantically interpretable pseudowords made of the grammatical combination of a root and a suYx, such as rapidiWer “to quickify.” In Experiment 2, we used non-morphological pseudowords such as rapiduit, where -uit is an existing...

The correction of handwritten word skew is an arduous task that must be independent of due to style and writing conditions variations. We propose here a morphology-based method to detect and correct handwritten word skew in the treatment of dates written on bank checks. Our aim is to limit the number of parameters and heuristic features necessary for a good skew correction. Our approach is base...

Automatic lemmatization is a core application for many language processing tasks. In inflectionally rich languages, such as Slovene, assigning the correct lemma (base form) to each word in a running text is not trivial, since for instance, nouns inflect for number and case, with a complex configuration of endings and stem modifications. The problem is especially difficult for unknown words, sin...

A co-operative project between two research groups in Tbilisi and Stockholm began in 1996. Its purpose is to extend a word predictor developed by the Swedish partner to the Russian language. Since Russian is much richer in morphological forms than the 7 languages previously worked with, an additional morphological component, using an algorithm supplied by the group in Tbilisi, is seen as necess...

This paper describes an algorithm to segment an input Turkish string without any spaces, which may be an output of a speech-to-text application, into words by using morphological analyzer. It is quite possible to use the algorithm on other languages, which has a morphological analysis component, as well. Turkish morphological analyzer is designed and implemented as the linguistic engine of the ...

Natural language processing has widely used Statistical based language models to solve disambiguation problems. Over the past decades different techniques regarding POS tagging have been proposed for English, European and East Asian languages. In this paper our focus is POS tagging for Urdu due to the infancy stage of Urdu language based tagging system. We have combined two approaches (Statisti...

When does morphological decomposition occur in visual word recognition? An increasing body of evidence suggests the presence of early morphological processing. The present work investigates this issue via an orthographic similarity manipulation. Three masked priming lexical decision experiments were conducted to examine the transposed-letter similarity effect (e.g., jugde facilitates JUDGE more...

From a phonological point of view, morphological words, i.e. syntactic atoms, do not necessarily behave as a unit. For instance, derivational affixes and compound members can be treated independently by phonological word-level rules. The prosodic word has been defined in order to account for the non-isomorphy between morphology and phonology. Prosodic words are typically characterized as being ...

Dual-mechanism morphology refers to a family of psycholinguistic models which hold that morphologically complex word forms can be processed both associatively, i.e. through stored full-form representations and by rules that decompose or parse inflected or derived word forms into morphological constituents. We present a brief overview of some relevant experimental results on English and other la...