Computational optimality theory
Computational optimality theory
Locally Least-Cost Error Recovery in Earley's Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Statistical Language Learning
Elements of the Theory of Computation
Elements of the Theory of Computation
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
| Hi-index | 0.00 |
This paper describes an algorithm for computing optimal structural descriptions for Optimality Theory grammars with context-free position structures. This algorithm extends Tesar's dynamic programming approach (Tesar, 1994) (Tesar, 1995a) to computing optimal structural descriptions from regular to context-free structures. The generalization to context-free structures creates several complications, all of which are overcome without compromising the core dynamic programming approach. The resulting algorithm has a time complexity cubic in the length of the input, and is applicable to grammars with universal constraints that exhibit context-free locality.