Unsupervised Graph-basedWord Sense Disambiguation Using Measures of Word Semantic Similarity

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Ravi Sinha Articles by Rada Mihalcea

International Conference on Semantic Computing (ICSC 2007)

Irvine, California

September 17-September 19

ISBN: 0-7695-2997-6

	ASCII Text	x
	Ravi Sinha, Rada Mihalcea, "Unsupervised Graph-basedWord Sense Disambiguation Using Measures of Word Semantic Similarity," International Conference on Semantic Computing, pp. 363-369, International Conference on Semantic Computing (ICSC 2007), 2007.

	BibTex	x
	@article{ 10.1109/ICSC.2007.87, author = {Ravi Sinha and Rada Mihalcea}, title = {Unsupervised Graph-basedWord Sense Disambiguation Using Measures of Word Semantic Similarity}, journal ={International Conference on Semantic Computing}, volume = {0}, year = {2007}, isbn = {0-7695-2997-6}, pages = {363-369}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICSC.2007.87}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - International Conference on Semantic Computing TI - Unsupervised Graph-basedWord Sense Disambiguation Using Measures of Word Semantic Similarity SN - 0-7695-2997-6 SP363 EP369 A1 - Ravi Sinha, A1 - Rada Mihalcea, PY - 2007 KW - null VL - 0 JA - International Conference on Semantic Computing ER -

Ravi Sinha, University of North Texas, USA

Rada Mihalcea, University of North Texas, USA

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICSC.2007.87

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

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.