Parallel FST systems are used in order to ex- plicate both traditional phonological rules, so long as they do not apply to their own output, and also, with ...
It is shown that an FST account leads to more insightful definitions of the basic phenomena than other approaches (e.g. phonological rules or metrical systems).
It is shown that an FST account leads to more insightful definitions of the basic phenomena than other approaches (e.g. phonological rules or metrical systems).
Finite State Processing of Tone Systems ; Anthology ID: E87-1046 ; Volume: Third Conference of the European Chapter of the Association for Computational ...
It is suggested in this paper that two--level morphology theory can be extended to include morphological tone and it is shown that an FST account leads to ...
The input and output languages for FSTs are both regular sets (Type 3 languages). FSTs have various interesting properties which are in part similar to those of ...
Bibliographic details on Finite State Processing Of Tone Systems.
People also ask
What is an example of a finite state system?
What does it mean for a system to be finite state?
The finite state transducer (FST), a type of finite state machine that maps an input string to an output string, is a common tool in the fields of natural ...
The finite-state grammar contained five tones (a3, a#3, c4, d4, f#4) of a duration of 220 msec and was used to generate sequences for the exposure phase and the ...
These proceedings contain the revised versions of the paper presented at the. 6th International Workshop on Finite-State Methods and Natural Language.