text-only page produced automatically by LIFT Text Transcoder Skip all navigation and go to page contentSkip top navigation and go to directorate navigationSkip top navigation and go to page navigation
National Science Foundation
Search  
Awards
design element
Search Awards
Recent Awards
Presidential and Honorary Awards
About Awards
Grant Policy Manual
Grant General Conditions
Cooperative Agreement Conditions
Special Conditions
Federal Demonstration Partnership
Policy Office Website


Award Abstract #0092784
Automatic Resolution of Semantic Ambiguity in Natural Language


NSF Org: IIS
Division of Information & Intelligent Systems
divider line
divider line
Initial Amendment Date: March 21, 2001
divider line
Latest Amendment Date: January 4, 2005
divider line
Award Number: 0092784
divider line
Award Instrument: Continuing grant
divider line
Program Manager: Tatiana D. Korelsky
IIS Division of Information & Intelligent Systems
CSE Directorate for Computer & Information Science & Engineering
divider line
Start Date: March 15, 2001
divider line
Expires: February 28, 2007 (Estimated)
divider line
Awarded Amount to Date: $343396
divider line
Investigator(s): Theodore Pedersen tpederse@d.umn.edu (Principal Investigator)
divider line
Sponsor: University of Minnesota-Twin Cities
200 OAK ST SE
MINNEAPOLIS, MN 55455 612/624-5599
divider line
NSF Program(s): HUMAN LANGUAGE & COMMUNICATION,
HUMAN COMPUTER INTER PROGRAM
divider line
Field Application(s): 0104000 Information Systems
divider line
Program Reference Code(s): HPCC, 9216, 1187, 1045
divider line
Program Element Code(s): 7274, 6845

ABSTRACT

Most words in natural language have multiple possible meanings. This simple fact causes no end of difficulties for computer systems that seek to understand and generate natural language. The semantic ambiguity of words impacts natural language subtasks such as prepositional phrase attachment and pronoun reference resolution, as well as large-scale applications such as machine translation and information retrieval. Automatic methods that resolve ambiguity in word meaning have the potential to advance the state-of-the-art in natural language processing as a whole, but most approaches to word sense disambiguation have proven difficult to deploy on a wide scale because they are dependent on the availability of specialized sources of knowledge that do not exist across a range of domains. The PI's goal in this project is to develop techniques that will ease and ultimately eliminate knowledge acquisition bottlenecks for word sense disambiguation. He will achieve this by pursuing three specific objectives: 1) develop methods that automatically identify the most relevant contextual features for determining the sense of any ambiguous word; 2) develop disambiguation algorithms that learn from "just a few" manually created examples; and 3) develop unsupervised methods that allow any set of word meanings to serve as the target of the disambiguation process. The combined effect of meeting these objectives will be to liberate word sense disambiguation from dependence on particular knowledge sources and thereby simplify their integration into natural language processing systems

 

Please report errors in award information by writing to: awardsearch@nsf.gov.

 

 

Print this page
Back to Top of page
  Web Policies and Important Links | Privacy | FOIA | Help | Contact NSF | Contact Web Master | SiteMap  
National Science Foundation
The National Science Foundation, 4201 Wilson Boulevard, Arlington, Virginia 22230, USA
Tel: (703) 292-5111, FIRS: (800) 877-8339 | TDD: (800) 281-8749
Last Updated:
April 2, 2007
Text Only


Last Updated:April 2, 2007