By Topic

An approach to knowledge-based Word Sense Disambiguation using semantic trees built on a WordNet lexicon network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Minca, A. ; Dept. of R&D, SOFTWIN, Bucharest, Romania ; Diaconescu, S.

This paper proposes a knowledge-based WSD (Word Sense Disambiguation) method derived from the Lesk algorithm. The proposed method considers an extension of the definition domain of the Lesk algorithm by creating a lexicon network from tagged lexicon glosses. We present several methods that adjust the lexicon network in order to better describe the natural language. Further, on the pre-processed lexicon network we build competence and definition semantic trees for each sense that will be used to compute costs of semantic similarity between words senses. For this purpose we use a WSD window limited to a phrase, and a similar reasoning for larger contexts. For testing we apply our methods to the recently WordNet tagged glosses.

Published in:

Speech Technology and Human-Computer Dialogue (SpeD), 2011 6th Conference on

Date of Conference:

18-21 May 2011