Unification: a multidisciplinary survey
ACM Computing Surveys (CSUR)
The logic of typed feature structures
The logic of typed feature structures
A design principles of a weighted finite-state transducer library
Theoretical Computer Science - Special issue on implementing automata
Finite-state transducers in language and speech processing
Computational Linguistics
Compiling regular formalisms with rule features into finite-state automata
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Feature structures, unification and finite-state transducers
FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing
| Hi-index | 0.00 |
Finite state transducers are highly efficient means for the representation and processing of morphological knowledge. However, the string representations normally used do not easily provide the rich and detailed linguistic descriptions needed for complex applications in Computational Linguistics, and long-distance phenomena are not easily modeled. This paper describes the use of typed feature structure as weights on transitions in a finite state transducer to represent linguistic objects. This method provides a seamless integration into other linguistic processing modules and facilitates the description of certain morphological phenomena. By using a pre-computation model of unification, we avoid the runtime complexity of unification and achieve a level of efficiency comparable to character-based automata based on other weight structures.