Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Computational Phonology: A Constraint-Based Approach
Computational Phonology: A Constraint-Based Approach
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
On reversing the generation process in Optimality Theory
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Directional constraint evaluation in Optimality Theory
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
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
Computing with realizational morphology
CICLing'03 Proceedings of the 4th international conference on Computational linguistics and intelligent text processing
| Hi-index | 0.00 |
This paper ties up some loose ends in finite-state Optimality Theory. First, it discusses how to perform comprehension under Optimality Theory grammars consisting of finite-state constraints. Comprehension has not been much studied in OT; we show that unlike production, it does not always yield a regular set, making finite-state methods inapplicable. However, after giving a suitably flexible presentation of OT, we show carefully how to treat comprehension under recent variants of OT in which grammars can be compiled into finite-state transducers. We then unify these variants, showing that compilation is possible if all components of the grammar are regular relations, including the harmony ordering on scored candidates. A side benefit of our construction is a far simpler implementation of directional OT (Eisner, 2000).