DEMorphy is a morphological analyzer for German. It is built onto large, compactified lexicons from German Morphological Dictionary. A guesser based on German declension suffixes is also provided. For German, we provided a state-of-art morphological analyzer. DEMorphy is implemented in Python with ease of usability and accompanying documentation. The package is suitable for both academic and co...

Number pages consecutively at the bottom throughout the application. Do not use suffixes such as 3a, 3b.

In Norwegian, possessive pronouns can be prenominal (min bil 'my car') or postnominal (bilen min 'car.DEF my'). In the Principles and Parameters literature, the standard assumption is that possessive pronouns are prenominal in underlying structure, while the postnominal position is a result of N-movement. This paper takes a different approach. The focus is the grammatical differences between th...

It is shown that suffix recognition for deterministic context-free languages can be done on a PRAM multi-processor within the upper complexity bounds of the graph reachability problem.

Sarhaddi Balochi dialect, a language variety of Western (Rakhshani) Balochi, employs derivation through affixation as one of its word formation processes. The purpose of this article is to present a synchronic description of the way(s) different derivational affixes function in making complex words in Sarhaddi Balochi as spoken in Granchin[1] district located about 35Kms to the southeast of Kha...

For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a suffix tree or suffix array should occur in lexicographical order (lexorder). It thus becomes of interest to study possible alternate orderings of the suffixes in these data structures, that may be easier to construct or more eff...

In this paper we describe a “light” algorithm for the on-line construction of a small automaton recognising a finite set of words. The algorithm runs in linear time. We carried out good experimental results on real dictionaries, on biological sequences and on the sets of suffixes (resp. factors) of a set of words that shows how our automaton is near to the minimal one. For the suffixes of a tex...

In this paper we focus on the construction of the minimal deterministic finite automaton Sk that recognizes the set of suffixes of a word w up to k errors. We present an algorithm that makes use of the automaton Sk in order to accept in an efficient way the language of all suffixes of w up to k errors in every windows of size r, where r is the value of the repetition index of w. Moreover, we gi...

The suffix array is a classic full-text index, combining effectiveness with simplicity. We discuss three approaches aiming to improve its efficiency even more: changes to the navigation, data layout and adding extra data. In short, we show that (i) how we search for the right interval boundary impacts significantly the overall search speed, (ii) a B-tree data layout easily wins over the standar...