<?xml version="1.0" standalone="yes"?>
<Paper uid="P96-1014">
  <Title>Computing Optimal Descriptions for Optimality Theory Grammars with Context-Free Position Structures</Title>
  <Section position="8" start_page="106" end_page="106" type="concl">
    <SectionTitle>
8 Conclusions
</SectionTitle>
    <Paragraph position="0"> The results presented here demonstrate that the basic cubic time complexity results for processing context-free structures are preserved when Optimality Theory grammars are used. If Gen can be specified as matching input segments to structures generated by a context-free position structure grammar, and the constraints are local with respect to those structures, then the algorithm presented here may be applied directly to compute optimal descriptions.</Paragraph>
  </Section>
class="xml-element"></Paper>