<?xml version="1.0" standalone="yes"?>
<Paper uid="J80-2002">
  <Title>A Parsing Algorithm That Extends Phrases</Title>
  <Section position="5" start_page="2" end_page="2" type="concl">
    <SectionTitle>
5. Concluding Remarks
</SectionTitle>
    <Paragraph position="0"> Since our parsing algorithm deals only with syntax, it is not complete in itself, but can be combined with a variety of conceptual representations to make a sentence analyzer. Whenever an operation that combines phrases is performed, procedures to combine data structures can be called as well. When there is a choice of operations to be performed, procedures to make the choice by examining the data structures involved can be called, too. Because our algorithm combines phrases sooner than others, there is greater opportunity for the data structures to influence the progress of the parsing process.</Paragraph>
    <Paragraph position="1"> This makes the resulting sentence analyzer behave not only in a more human-like way (the closure property), but also in a more efficient way because it is less likely to have to back up.</Paragraph>
    <Paragraph position="2"> Although the programs of Marcus and Riesbeck share many of these same properties, the syntactic processing aspects of those programs are not clearly separated from the particular conceptual representations on which they are based. We believe that the parsing algorithm presented here captures many of the important properties of those programs so that they may be applied to conceptual representations based on other theories of natural language.</Paragraph>
  </Section>
class="xml-element"></Paper>