<?xml version="1.0" standalone="yes"?>
<Paper uid="W06-2205">
  <Title>Recognition of synonyms by a lexical graph</Title>
  <Section position="7" start_page="200" end_page="200" type="concl">
    <SectionTitle>
6 Conclusion
</SectionTitle>
    <Paragraph position="0"> We have introduced the lexical graph as an instrument for finding semantic relations between lexical items in natural language corpora. The big advantage of the graph in comparison to other context models is that it captures not only the immediate context but establishes many transitive connections between related terms. We have verified its effectiveness searching for synonymy. Different metrics have been defined based on shortest path lengths and shared properties. Similarity metric FirstCompM that best leverages the graph structure achieved the best results confirming the significant role of number of shared properties, frequency of their co-occurrence and the degree of their generality for detecting of synonymy. Significantly improving results for bigger text corpora andmorefrequently occurring words are encouraging and promising for detection of other semantic relations. New methods that increasingly employ the graph structure e.g. regarding the lengths and number of short paths between two terms or extending the witness concept to other morphological types are the subject of further research.</Paragraph>
  </Section>
class="xml-element"></Paper>