Computing Optimal Descriptions for Optimality Theory Grammars with Context-Free Position Structures
| dc.creator | Tesar, Bruce | |
| dc.date | 1996-06-17 | |
| dc.date.accessioned | 2026-07-07T09:10:24Z | |
| dc.date.available | 2026-07-07T09:10:24Z | |
| dc.description | 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 1995] 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. | |
| dc.description | 7 pages, uses aclap.sty. To appear in ACL 1996 | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9606020 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9606020 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151339 | |
| dc.subject | Computation and Language | |
| dc.title | Computing Optimal Descriptions for Optimality Theory Grammars with Context-Free Position Structures | |
| dc.type | text |