Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Deterministic part-of-speech tagging with finite-state transducers
Computational Linguistics
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Heterogeneous relation graphs as a formalism for representating linguistic information
Speech Communication - Special issue on speech annotation and corpus tools
Finite-state transducers in language and speech processing
Computational Linguistics
Transducers from rewrite rules with backreferences
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
An efficient compiler for weighted rewrite rules
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
The proper treatment of optimality in computational phonology: plenary talk
FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing
Compiling simple context restrictions with nondeterministic automata
FSMNLP '11 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
| Hi-index | 0.00 |
This paper describes a novel method of compiling ranked tagging rules into a deterministic finite-state device called a bimachine. The rules are formulated in the framework of regular rewrite operations and allow unrestricted regular expressions in both left and right rule contexts. The compiler is illustrated by an application within a speech synthesis system.