<?xml version="1.0" standalone="yes"?>
<Paper uid="W02-0904">
  <Title>Building a hyponymy lexicon with hierarchical structure</Title>
  <Section position="10" start_page="0" end_page="0" type="concl">
    <SectionTitle>
9 Conclusions
</SectionTitle>
    <Paragraph position="0"> We have shown how an unambiguous hypernym-hyponym lexicon with partial hierarchies can be built from data that is unrestricted by domain. The algorithm has been implemented for Swedish, but we can assume that the method easily can be applied to other languages as well. Even though the number of hierarchical structures imposed by the method is rather low, the quality of the hyponymy relations is good and we believe that improvements in the algorithm will increase the number of partial hierarchies.</Paragraph>
  </Section>
class="xml-element"></Paper>