Computational optimality theory
Computational optimality theory
Interleaving natural language parsing and generation through uniform processing
Artificial Intelligence
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
LFG generation produces context-free languages
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
A uniform architecture for parsing and generation
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
OT syntax: decidability of generation-based optimization
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
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
| Hi-index | 0.00 |
The Earley deduction algorithm is extended for the processing of OT syntax based on feature grammars. Due to faithfulness violations, infinitely many candidates must be compared. With the (reasonable) assumptions (i) that OT constraints are descriptions denoting bounded structures and (ii) that every rule recursion in the base grammar incurs some constraint violation, a chart algorithm can be devised. Interleaving parsing and generation permits the application of generation-based optimization even in the parsing task, i.e., for a string input.