Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Minimization of Sequential Transducers
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
Finite-state approximation of phrase structure grammars
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Two-level morphology with composition
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Finite-state parsing and disambiguation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Is this Finite-State Transducer Sequentiable?
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Extended Sequentialization of Transducers
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Finite-state transducers in language and speech processing
Computational Linguistics
On some applications of finite-state automata theory to natural language processing
Natural Language Engineering
An efficient compiler for weighted rewrite rules
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Deciding sequentiability of finite-state transducers by finite-state pattern-matching
Theoretical Computer Science - Implementation and application automata
Linking multiple disease-related resources through UMLS
Proceedings of the 2nd ACM SIGHIT International Health Informatics Symposium
Beyond myopic inference in big data pipelines
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
| Hi-index | 0.00 |
Finite-state transducers give efficient representations of many Natural Language phenomena. They allow to account for complex lexicon restrictions encountered, without involving the use of a large set of complex rules difficult to analyze. We here show that these representations can be made very compact, indicate how to perform the corresponding minimization, and point out interesting linguistic side-effects of this operation.