<?xml version="1.0" standalone="yes"?>
<Paper uid="C94-2132">
  <Title>A LEXICON OF DISTRIBUTED NOUN REPRESENTATIONS CONSTRUCTED BY TAXONOMIC TRAVERSAL</Title>
  <Section position="4" start_page="828" end_page="828" type="evalu">
    <SectionTitle>
3 RESULTS
</SectionTitle>
    <Paragraph position="0"> The Mgorithm deseril)ed above has helm imt)hmmnted and can be used to construct a lexical entry for any of the nouns in the WordNet database. Figure 1 shows the synset hypernym hierarchy for tile word 'terrier' in WordNet. Figure 2 shows the semantic representation derived by the algorithm for this word. We present here some preliminary exl)eriments whic.h attempt to measure the performance of the lexicon. Four words were chosen fi'om each of live categories of noun wlfi('.h we label cars, clogs, /lowers, trees mid peol)le. These are shown in Table I. Talrle 2 shows a Slllllll/lary of tile characteristics of the word representations in the set of twenty words. Pairs of categories were ehosoil, cars-dogs, flowers-trees alld so ()\[1~ each containing eight words. A series of eighl.-by-eight tables was then computed, showing the dot l)roduct of each word with every other word in the category pair. Table 3 shows the results for the curs-dogs matrix. There are several points to note about this table. I:'irstly, the match of one car word with another is high, ranging between 0.58 and 1.0 with an average of 0.8. This shows that the lexicon has cal)tured the similarity between the ear coneel)ts. Secon(lly, the match of one dog word with another is also high, ranging I)etwcen 0.63 and 1.0 with an average of 0.76, for the same festoon. Thirdly, the lnateh of a car word with a clog word is low, ranging between 0.05 and 0.17 with an average of 0.t. This is heeause cars and dogs are not closely linke.d semantically. Tal)le 4 shows resuits for the flowers-trees matrix. Flowers and trees are much more closely related semantically thau cars and dogs, and this is rellected in the results. Hower words match with tree words in a range of 0.30 to 0.67 aAt. wesent, we only clmosc the firs(, such link if there are several.</Paragraph>
    <Paragraph position="1"> with an average of 0.4, n~mch higher than for cars m~d dogs. The match of flowers with tlowers or trees with trees continues to be high. Finally, Tabh; 5 shows the people-dogs matrix. Note here thai; the match of people with themselwes is lower than that of (logs with themselves (average 0.63 rather than average 0.76.) This is because tile people words are in fact a rather disparate set. Note in particular that 'bruiser' against 'rake' is the best lnatch while 'bruiser' against 'patriarch' is the worst. This matches one's intuitions abont these concepts: patriarchs are &amp;quot;good&amp;quot; while 'hruisers' all(l q'akes' arc not.</Paragraph>
  </Section>
class="xml-element"></Paper>