<?xml version="1.0" standalone="yes"?>
<Paper uid="P85-1018">
  <Title>Using Restriction to Extend Parsing Algorithms for Complex-Feature-Based Formalisms</Title>
  <Section position="7" start_page="151" end_page="151" type="concl">
    <SectionTitle>
6 Conclusion
</SectionTitle>
    <Paragraph position="0"> We have presented a general technique of restriction with many applications in the area of manipulating complex-feature-based grammar formalisms. As a particular example, we presented a complete, correct, terminating extension of Earley's algorithm that uses restriction to perform top-down filtering. Our implementation demonstrates the drastic elimination of chart edges that can be achieved by this technique. Finally, we described further uses for the technique--including parsing other grammar formalisms, including definite-clause grammars; extending other parsing algorithms, including LR methods and syntactic preference modeling algorithms; and efficient indexing.</Paragraph>
    <Paragraph position="1"> We feel that the restriction technique has great potential to make increasingly powerful grammar formalisms computationally feasible.</Paragraph>
  </Section>
class="xml-element"></Paper>