Extending a quantifier scope resolution algorithm by accounting for negation.

Publication Year:
2002
Usage 134
Downloads 94
Abstract Views 40
Repository URL:
https://scholar.uwindsor.ca/etd/2052; https://scholar.uwindsor.ca/cgi/viewcontent.cgi?article=3051&context=etd
Author(s):
Pareddy, Sudhakar Reddy.
Publisher(s):
University of Windsor
Tags:
Computer Science.
thesis / dissertation description
This thesis report investigates a central problem to natural language understanding, namely the problem of scope ambiguity. The types of scope ambiguities that are considered are those that are generally resolved by speakers of a given language by relaying on common knowledge. Typical of this is the problem of resolving quantifier scope ambiguity. In this report we investigate the thesis that the QC algorithm of Saba and Corriveau can be extended to account for negation. We propose an extension to Saba and Corriveau QC algorithm. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2002 .P37. Source: Masters Abstracts International, Volume: 41-04, page: 1116. Adviser: Walid Shaker Saba. Thesis (M.Sc.)--University of Windsor (Canada), 2002.