Computing Optimal Descriptions for Optimality Theory Grammars with Context-Free Position Structures

Details Computing Optimal Descriptions for Optimality Theory Grammars with Context-Free Position Structures Computing Optimal Descriptions for Optimality Theory Grammars with Context-Free Position Structures

1996-06-17

arxiv.org/abs/cmp-lg/9606020v1

Computer Science

Computation and Language

7 pages, uses aclap.sty. To appear in ACL 1996

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Computing Optimal Descriptions for Optimality Theory Grammars with Context-Free Position Structures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing Optimal Descriptions for Optimality Theory Grammars with Context-Free Position Structures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing Optimal Descriptions for Optimality Theory Grammars with Context-Free Position Structures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-19083