We present new results achieved in the application of incremental graph composition algorithm, in particular using the label pushing method to further reduce the final graph size. In our previous work we have shown that the incremental composition is an efficient alternative to the conventional finite state transducer (FST) determinization-composition-minimization approach, with some limitation...

This work presents the finite state approach to the Kazakh nominal paradigm. The development and implementation of a finitestate transducer for the nominal paradigm of the Kazakh language belonging to agglutinative languages were undertaken. The morphophonemic constraints that are imposed by the Kazakh language synharmonism (vowels and consonants harmony) on the combinations of letters under af...

We describe a linguistically expressive and easy to implement parallel semantics for quasi-deterministic finite state transducers (FSTS) used as acceptors. Algorithms are given for detemain-ing acceptance of pairs of phoneme strings given a parallel suite of such transducers and for constructing the equivalent single transducer by parallel intersection. An algorithm for constructing the serial ...

This paper outlines the generation process of a specific computational linguistic representation termed the Multilingual Time Map, conceptually a multi-tape finite state transducer encoding linguistic data at different levels of granularity. The first component acquires phonological data from syllable labeled speech data, the second component defines feature profiles, the third component genera...

The modifications that foreign loanwords undergo when adapted into Japanese have been the subject of much study in linguistics. The scholarly interest of the topic can be attributed to the fact that Japanese loanwords undergo a complex series of phonological adaptations, something which has been puzzling scholars for decades. While previous studies of Japanese loanword accommodation have focuse...

This paper presents our efforts at developing an Indonesian morphological analyser that provides a detailed analysis of the rich affixation process. We model Indonesian morphology using a two-level morphology approach, decomposing the process into a set of morphotactic and morphophonemic rules. These rules are modelled as a network of finite state transducers and implemented using xfst and lexc...

In this paper we introduce Onoma, a new conjugating tool which is available online. Onoma generates and analyses both existing verbs and Spanish verb neologisms. This application of finite state transducers was evaluated against other online conjugators and also on a database consisting of 15.367 verbs containing 4,307 neologisms.

This paper reports on an ongoing research on temporal adverbs and deals with the problem of processing a family of Portuguese and Spanish compound temporal adverbs, in a contrastive approach, aiming at building finite state transducers to translate them from one language into the other. Because of the large number of combinations involved and their complexity, it is not easy to list them in ful...

We show that the only analytic functions computable by finite state transducers in sofic Möbius number systems are Möbius transformations.