<?xml version="1.0" standalone="yes"?>
<Paper uid="P02-1008">
  <Title>Comprehension and Compilation in Optimality Theory</Title>
  <Section position="8" start_page="0" end_page="0" type="concl">
    <SectionTitle>
7 Conclusion
</SectionTitle>
    <Paragraph position="0"> See the itemized points inx1 for a detailed summary.</Paragraph>
    <Paragraph position="1"> In general, this paper has laid out a clear, general framework for finite-state OT systems, and used it to obtain positive and negative results about the understudied problem of comprehension. Perhaps these results will have some bearing on the development of realistic learning algorithms.</Paragraph>
    <Paragraph position="2"> The paper has also established sufficient conditions for a finite-state OT grammar to compile into a finite-state transducer. It should be easy to imagine new variants of OT that meet these conditions.</Paragraph>
  </Section>
class="xml-element"></Paper>