Computational optimality theory
Computational optimality theory
One-level phonology: autosegmental representations and rules as finite automata
Computational Linguistics
Computing optimal descriptions for Optimality Theory grammars with context-free position structures
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Phonological derivation in optimality theory
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Review of "Optimality theory" by René Kager. Cambridge University Press 1999.
Computational Linguistics
Directional constraint evaluation in Optimality Theory
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
OT syntax: decidability of generation-based optimization
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Comprehension and compilation in Optimality Theory
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Optimization in multimodal interpretation
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Optimality Theory and Vector Semirings
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
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
Latent-variable modeling of string transductions with finite-state methods
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Automatic acquisition of feature-based phonotactic resources
SIGMorPhon '04 Proceedings of the 7th Meeting of the ACL Special Interest Group in Computational Phonology: Current Themes in Computational Phonology and Morphology
The benefits of errors: learning an OT grammar with a structured candidate set
CACLA '07 Proceedings of the Workshop on Cognitive Aspects of Computational Language Acquisition
Tier-based strictly local constraints for phonology
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 2
Towards a Robuster Interpretive Parsing
Journal of Logic, Language and Information
| Hi-index | 0.00 |
This paper introduces primitive Optimality Theory (OTP), a linguistically motivated formalization of OT. OTP specifies the class of autosegmental representations, the universal generator Gen, and the two simple families of permissible constraints. In contrast to less restricted theories using Generalized Alignment, OTP's optimal surface forms can be generated with finite-state methods adapted from (Ellison, 1994). Unfortunately these methods take time exponential on the size of the grammar. Indeed the generation problem is shown NP-complete in this sense. However, techniques are discussed for making Ellison's approach fast in the typical case, including a simple trick that alone provides a 100-fold speedup on a grammar fragment of moderate size. One avenue for future improvements is a new finite-state notion, "factored automata," where regular languages are represented compactly via formal intersections ∩ki=1Ai of FSAs.