<?xml version="1.0" standalone="yes"?>
<Paper uid="J90-4001">
  <Title>ANAPHORA RESOLUTION IN SLOT GRAMMAR</Title>
  <Section position="12" start_page="0" end_page="0" type="concl">
    <SectionTitle>
7 CONCLUSION
</SectionTitle>
    <Paragraph position="0"> We have presented three implemented algorithms for anaphora resolution in Slot Grammar. The conjunction of the two NP anaphora rules covers approximately the same phenomena as Chomsky's binding theory, but these rules do not require empty categories and the definition of binding chains in parse output. The VP anaphora algorithm implements an S-structure analysis of VP ellipsis that we argue offers a more unified and principled explanation of different sorts of VP anaphora than recent LF-based accounts. The success of the algorithm in providing appropriate representations for the VP anaphora cases that we used to motivate our theoretical approach supports this view.</Paragraph>
    <Paragraph position="1"> The combination of the three algorithms constitutes a powerful syntactically driven system for anaphora resolution in Slot Grammar. This system reduces the burden on modules of semantic and discourse interpretation by supplying partially interpreted representations to which the rules of the latter can apply.</Paragraph>
  </Section>
class="xml-element"></Paper>