Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Regular expressions for language engineering
Natural Language Engineering
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
ACL '96 Proceedings of the 34th 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
Compiling a partition-based two-level formalism
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Parallel replacement in finite state calculus
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Finite-state non-concatenative morphotactics
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
Using Finite State Technology in Natural Language Processing of Basque
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Linguistic Processing of Biomedical Texts
PorTAL '02 Proceedings of the Third International Conference on Advances in Natural Language Processing
State Complexity of Combined Operations for Prefix-Free Regular Languages
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
CICLing'11 Proceedings of the 12th international conference on Computational linguistics and intelligent text processing - Volume Part II
MWU-aware part-of-speech tagging with a CRF model and lexical resources
MWE '11 Proceedings of the Workshop on Multiword Expressions: from Parsing and Generation to the Real World
GREAT: open source software for statistical machine translation
Machine Translation
Linguistically-adapted structural query annotation for digital libraries in the social sciences
LaTeCH '12 Proceedings of the 6th Workshop on Language Technology for Cultural Heritage, Social Sciences, and Humanities
| Hi-index | 0.00 |
This paper is a review of some of the major applications of finite-state transducers in Natural Language Processing ranging from morphological analysis to finite-state parsing. The analysis and generation of inflected word forms can be performed efficiently by means of lexical transducers. Such transducers can be compiled using an extended regular expression calculus with restriction and replacement operators. These operators facilitate the description of complex linguistic phenomena involving morphological alternations and syntactic patterns. Because regular languages and relations can be encoded as finite-automata, new languages and relations can be derived from them directly by the finite-state calculus. This is a fundamental advantage over higher-level linguistic formalisms.