loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Conference on Semantic Computing (ICSC 2007)
Clustering Using Feature Domain Similarity to Discover Word Senses for Adjectives
Irvine, California
September 17-September 19
ISBN: 0-7695-2997-6
Noriko Tomuro, DePaul University, USA
Steven L. Lytinen, DePaul University, USA
Kyoko Kanzaki, National Institute of Information and Communications Technology, Japan
Hitoshi Isahara, National Institute of Information and Communications Technology, Japan
This paper presents a new clustering algorithm called DSCBC which is designed to automatically discover word senses for polysemous words. DSCBC is an extension of CBC Clustering [11], and incorporates feature domain similarity: the similarity between the features themselves, obtained a priori from sources external to the dataset used at hand. When polysemous words are clustered, words that have similar sense patterns are often grouped together, producing polysemous clusters: a cluster in which features in several different domains are mixed in. By incorporating the feature domain similarity in clustering, DSCBC produces monosemous clusters, thereby discovering individual senses of polysemous words. In this work, we apply the algorithm to English adjectives, and compare the discovered senses against WordNet. The results show significant improvements by our algorithm over other clustering algorithms including CBC.
Citation:
Noriko Tomuro, Steven L. Lytinen, Kyoko Kanzaki, Hitoshi Isahara, "Clustering Using Feature Domain Similarity to Discover Word Senses for Adjectives," icsc, pp.370-377, International Conference on Semantic Computing (ICSC 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.