Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: finite state transducer

Sortuj według:

Ogranicz wyniki do:

One-Dimensional Cellular Automaton Transducers

Kutrib M., Malcher A.

Fundamenta Informaticae

2013

Vol. 126, nr 2-3

201--224

The parallel models of cellular automata and iterative arrays are investigated towards their ability to compute transductions, that is, to transform inputs into outputs. The families of transductions computed are classified with regard to the time allowed to process the input and the output, respectively. The time complexities of real-time and linear-time are of particular interest. First, the computational capabilities of iterative array transducers are investigated and proper inclusions between real-time and linear-time can be obtained. Then, iterative array transducers and cellular automaton transducers are considered, that is, sequential input/output mode is compared to parallel input/output mode. Here, the result is that the parallel mode is not weaker than the sequential one, but with regard to certain time complexities the parallel mode is even more powerful than the sequential one. In the second part of the paper, cellular automaton transducers and iterative array transducers are compared with the conventional sequential transducer models, namely, finite state transducers and pushdown transducers. It turns out that unambiguous finite state transducers and deterministic pushdown transducers can be simulated by both parallel models, but cellular automaton transducers achieve a faster simulation than iterative array transducers.

Morphological analyser based on finite state transducer: a case study for Oriya language

Swain K. C., Santi P. K., Mohanty S.

Archives of Control Sciences

2005

Vol. 15, no. 3

451-460

This paper deals with the effective design and implementation of the morphological analyser of Oriya, which is a morphologically rich language derived from Sanskrit. The most of the morphemes in Oriya coordinate with the root words in the form of suffixes. Information such as Part of Speech (PoS), Case-relation, number, person, tense, aspect and mood are all conveyed through morphological attachments to the root of nominal or verbal words. This makes morphological analyser and generator of Oriya words a challenging task which is very essential tool in the area of Machine Translation, Parser, Spell Checker, OriNet (WordNet for Oriya), PoS tagging etc. This paper elucidates the simple and efficient computational model for Oriya morphology based on finite state transducers.