<?xml version="1.0" standalone="yes"?>
<Paper uid="N01-1010">
  <Title>Tree-cut and A Lexicon based on Systematic Polysemy</Title>
  <Section position="11" start_page="231" end_page="231" type="concl">
    <SectionTitle>
7 Conclusions and Future Work
</SectionTitle>
    <Paragraph position="0"> As we reported in previous sections, our tree-cut extraction method discovered 89% of the Word-Net cousins. Although the precision was relatively low (50-60%), this is an encouraging result. As for the lexicon, our sense partitions consistently yielded better values than arbitrary sense groupings. We consider these results to be quite promising. Our data is available at www.depaul.edu/ntomuro/research/naacl-01.html.</Paragraph>
    <Paragraph position="1"> It is signicant to note that cluster pairs and sense partitions derived in this work are domain independent. Such information is useful in broad-domain applications, or as a background lexicon (Kilgarri, 1997) in domain specic applications or text categorization and IR tasks. For those tasks, weanticipate that our extraction methods may be useful in deriving characteristics of the domains or given corpus, as well as customizing the lexical resource. This is our next future research.</Paragraph>
    <Paragraph position="2"> For other future work, we plan to investigate an automatic way of detecting and ltering unrelated relations. We are also planning to compare our sense partitions with the systematic disagreement obtained by (Wiebe, et al., 1998)'s automatic classier.</Paragraph>
  </Section>
class="xml-element"></Paper>