loading...
Unsupervised Graph-basedWord Sense Disambiguation Using Measures of Word Semantic Similarity
Irvine, California September 17-September 19
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICSC.2007.87International Conference on Semantic ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ravi Sinha, University of North Texas, USA
Rada Mihalcea, University of North Texas, USA
This paper describes an unsupervised graph-based method for word sense disambiguation, and presents comparative evaluations using several measures of word semantic similarity and several algorithms for graph centrality. The results indicate that the right combination of similarity metrics and graph centrality algorithms can lead to a performance competing with the state-of-the-art in unsupervised word sense disambiguation, as measured on standard data sets.
Citation:
Ravi Sinha, Rada Mihalcea, "Unsupervised Graph-basedWord Sense Disambiguation Using Measures of Word Semantic Similarity," icsc, pp.363-369, International Conference on Semantic Computing (ICSC 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.