Font Size: a A A

A minimally supervised word sense disambiguation algorithm using syntactic dependencies and semantic generalizations

Posted on:2006-03-21Degree:M.SType:Thesis
University:University of North TexasCandidate:Faruque, Md. EhsanulFull Text:PDF
GTID:2458390008965759Subject:Computer Science
Abstract/Summary:
Natural language is inherently ambiguous. For example, the word "bank" can mean a financial institution or a river shore. Finding the correct meaning of a word in a particular context is a task known as word sense disambiguation (WSD), which is essential for many natural language processing applications such as machine translation, information retrieval, and others.; While most current WSD methods try to disambiguate a small number of words for which enough annotated examples are available, the method proposed in this thesis attempts to address all words in unrestricted text. The method is based on constraints imposed by syntactic dependencies and concept generalizations drawn from an external dictionary. The method was tested on standard benchmarks as used during the SENSEVAL-2 and SENSEVAL-3 WSD international evaluation exercises, and was found to be competitive.
Keywords/Search Tags:Word, WSD
Related items