A Semi-Complete Disambiguation Algorithm for Open Text

PDF Version Also Available for Download.


This paper discusses a semi-complete disambiguation algorithm for open text.

Physical Description

1 p.

Creation Information

Mihalcea, Rada, 1974- 2000.


This paper is part of the collection entitled: UNT Scholarly Works and was provided by UNT College of Engineering to Digital Library, a digital repository hosted by the UNT Libraries. It has been viewed 78 times . More information about this paper can be viewed below.


People and organizations associated with either the creation of this paper or its content.


Provided By

UNT College of Engineering

The UNT College of Engineering strives to educate and train engineers and technologists who have the vision to recognize and solve the problems of society. The college comprises six degree-granting departments of instruction and research.

Contact Us


Descriptive information to help identify this paper. Follow the links below to find similar items on the Digital Library.

Degree Information


This paper discusses a semi-complete disambiguation algorithm for open text.

Physical Description

1 p.


Copyright 2000 American Association for Artificial Intelligence (AAAI). All rights reserved. http://www.aaai.org

Abstract: Word Sense Disambiguation (WSD) is one of the most difficult areas of Natural Language Processing (NLP); the semantic comprehension of a text, and the possibility to expand a text with semantically related information, drastically depends on the availability of a highly accurate WSD algorithm. Solutions considered so far by researchers for the WSD problem, are making use of machine readable dictionaries (Leacock, Chodorow and Miller 1998), or the information gathered from raw or semantically disambiguated corpora (Yarowsky 1995). These methods are designed either to work with a few pre-selected words, in which case a high accuracy is obtained, or they are general methods which disambiguate, with lower precision, all the words in a text. With the present work, the authors are trying to achieve a compromise between these two different directions. There are fields in NLP, like Information Retrieval and others, which could benefit from a method which performs a semi-complete disambiguation (i.e. it disambiguates only a certain percentage of the words in a text), but which is highly accurate.


  • Seventeenth National Conference on Artificial Intelligence, 2000, Austin, Texas, United States


Item Type


This paper is part of the following collection of related materials.

UNT Scholarly Works

Materials from the UNT community's research, creative, and scholarly activities and UNT's Open Access Repository. Access to some items in this collection may be restricted.

What responsibilities do I have when using this paper?


Dates and time periods associated with this paper.

Creation Date

  • 2000

Added to The UNT Digital Library

  • April 13, 2012, 9:48 a.m.

Description Last Updated

  • March 27, 2014, 1:05 p.m.

Usage Statistics

When was this paper last used?

Yesterday: 0
Past 30 days: 0
Total Uses: 78

Interact With This Paper

Here are some suggestions for what to do next.


PDF Version Also Available for Download.

International Image Interoperability Framework

IIF Logo

We support the IIIF Presentation API

Mihalcea, Rada, 1974-. A Semi-Complete Disambiguation Algorithm for Open Text, paper, 2000; (digital.library.unt.edu/ark:/67531/metadc83293/: accessed January 23, 2019), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT College of Engineering.