Introduction to algorithms
Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Computational optimality theory
Computational optimality theory
Finite-state transducers in language and speech processing
Computational Linguistics
Optimality theory and the generative complexity of constraint violability
Computational Linguistics
Efficient generation in primitive Optimality Theory
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
Phonological derivation in optimality theory
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
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
Comprehension and compilation in Optimality Theory
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Verifying vowel harmony typologies
SIGMORPHON '10 Proceedings of the 11th Meeting of the ACL Special Interest Group on Computational Morphology and Phonology
A finite-state approximation of optimality theory: the case of finnish prosody
FinTAL'06 Proceedings of the 5th international conference on Advances in Natural Language Processing
| Hi-index | 0.00 |
Weighted finite-state constraints that can count unboundedly many violations make Optimality Theory more powerful than finite-state transduction (Frank and Satta, 1998). This result is empirically and computationally awkward. We propose replacing these unbounded constraints, as well as non-finite-state Generalized Alignment constraints, with a new class of finite-state directional constraints. We give linguistic applications, results on generative power; and algorithms to compile grammars into transducers.