<?xml version="1.0" standalone="yes"?>
<Paper uid="W99-0112">
  <Title>Reference Hashed</Title>
  <Section position="8" start_page="108" end_page="108" type="concl">
    <SectionTitle>
6 Conclusion
</SectionTitle>
    <Paragraph position="0"> I have proposed a new data structure for the processing of coreference in a discourse. A hashbzg list was employed to store referents according to their grammatical features such as number or gender. Because of this, better accessibility to non-competing antecedents can be modelled by the approach presented. null The discourse grammar used combined insights from different approaches to discourse processing: (S)DRT and CT. In addition, a tree logic was used to allow underspecification in the representation of ambiguous. ~quences.</Paragraph>
    <Paragraph position="1"> Future research has to focus on the evaluation of ..'-.. . * the proposed theory to anaphora resolution. Copora investigation and psychological experiments will provide more evidence. In addition, an implementation of hashed DRT is being programmed.</Paragraph>
  </Section>
class="xml-element"></Paper>