Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Deterministic part-of-speech tagging with finite-state transducers
Computational Linguistics
Heterogeneous relation graphs as a formalism for representating linguistic information
Speech Communication - Special issue on speech annotation and corpus tools
Parsing natural language idioms with bi-directional finite-state machines
Theoretical Computer Science
Finite-state transducers in language and speech processing
Computational Linguistics
A divide-and-conquer strategy for shallow parsing of German free texts
ANLC '00 Proceedings of the sixth conference on Applied natural language processing
An information extraction core system for real world German text processing
ANLC '97 Proceedings of the fifth conference on Applied natural language processing
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
An efficient compiler for weighted rewrite rules
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Hi-index | 0.00 |
We describe a novel method of compiling ranked tagging rules into a "bimachine", i.e. a deterministic finite state device composed of two finite automata: a left-to-right one and a right-to-left one. The actual compilation is based on algorithms for finite state acceptors rather than transducers, which guarantees determinizability and the efficiency of compilation. The compiler has been used in a number of applications within a speech synthesis system.