OT syntax: decidability of generation-based optimization

Authors:
Jonas Kuhn
Affiliations:
Stanford University
Venue:
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Year:
2002

Citing 8
Cited 1

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
LFG generation produces context-free languages

COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
Estimators for stochastic "Unification-Based" grammars

ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Parsing the wall street journal using a Lexical-Functional Grammar and discriminative estimation techniques

ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Processing optimality-theoretic syntax by interleaved chart parsing and generation

ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
Lexicalized stochastic modeling of constraint-based grammars using log-linear measures and EM training

ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
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

Lfg generation by grammar specialization

Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In Optimality-Theoretic Syntax, optimization with unrestricted expressive power on the side of the OT constraints is undecidable. This paper provides a proof for the decidability of optimization based on constraints expressed with reference to local subtrees (which is in the spirit of OT theory). The proof builds on Kaplan and Wedekind's (2000) construction showing that LFG generation produces context-free languages.