A less discussed point — though equally evident — is that Russian prefixes and prepositions cannot be unified as a class on the basis of their morphosyntactic characteristics. The theoretical aim of the present work is to resolve the apparent contradiction between the phonological unity and the morphosyntactic disunity of these two categories, by proposing a Stratal Optimality Theoretic approac...

In this paper, the concept of complete finite prefixes for process algebra expressions is extended to stochastic models. Events are supposed to happen after a delay that is determined by random variables assigned to the preceding conditions. Max-plus algebra expressions are shown to provide an elegant notation for stochastic prefixes not containing any decisions. Furthermore, they allow for the...

We describe a simple method of unsupervised morpheme segmentation of words in an unknown language. All that is needed is a raw text corpus (or a list of words) in the given language. The algorithm identifies word parts occurring in many words and interprets them as morpheme candidates (prefixes, stems and suffixes). New treatment of prefixes is the main innovation in comparison to [1]. After fi...

IP address lookup is an important function to meet such requirements as high speed, memory size and low power for the overall performance of the routers. The biggest problem of IP address lookup is that prefixes has a variable length so that longest prefix match should be employed for IP address lookup. Binary search is useful to decrease search times. But binary search is only adaptable to an ...

A single physical link can have multiple prefixes assigned to it. In that environment, end hosts might have multiple IP addresses and be required to use them selectively. RFC 3484 defines default source and destination address selection rules and is implemented in a variety of OSs. But, it has been too difficult to use operationally for several reasons. In some environments where multiple prefi...

We observe that known results on the Kolmogorov complexity of prefixes of effectively stochastic sequences extend to corresponding random sequences. First, there are recursively random random sequences such that for any nondecreasing and unbounded computable function f and for almost all n, the uniform complexity of the length n prefix of the sequence is bounded by f(n). Second, a similar resul...

Cross-linguistically, prefixes and suffixes differ in both frequency and in phonological behavior. These differences could plausibly have their source in listeners’ subjective perceptual experiences of prefixes and suffixes, an idea that we pursued using a noise-rating task in Spanish. Participants heard minimally-different Spanish words such asme patea ‘s/he kicks me’ versus patéame ‘kick me’,...

Although a number of attempts have been made to develop a stemming formalism for the Arabic language, most of these attempts have focused merely on the lexical structure of words as modeled by the Arabic grammatical and morphological lexical rules. This paper discusses the merits of light stemming for Arabic data and presents a simple light stemming strategy that has been developed on the basis...

We prove that the Fibonacci word f satisfies among all characteristic Sturmian words, three interesting extremal properties. The first concerns the length and the second the minimal period of its palindromic prefixes. Each of these two properties characterizes f up to a renaming of its letters. A third property concerns the number of occurrences of the letter b in its palindromic prefixes. It c...