<?xml version="1.0" standalone="yes"?>
<Paper uid="P83-1021">
  <Title>PARSING AS DEDUCTION l</Title>
  <Section position="8" start_page="142" end_page="142" type="concl">
    <SectionTitle>
8. Conclusion
</SectionTitle>
    <Paragraph position="0"> We have outlined an approach to the problems of parsing unification-based grammar formalisms that builds on the relationship between parsing and definite-clause deduction.</Paragraph>
    <Paragraph position="1"> Several theoretical and practical problems remain. Among these are the question of recognizing derived clauses that are no longer useful in Earley-style parsing, the design of restricted formalisms with a polynomial bound on the number of distinct derived clauses, and independent characterizations of the classes of offline-parsable grammars and languages.</Paragraph>
  </Section>
class="xml-element"></Paper>