Extending a quantifier scope resolution algorithm by accounting for negation.

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.

Name thesis:degree_name

M.Sc.

Level thesis:degree_level

Masters

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Windsor

Year dc:date.issued

2002

Author dc:creator

• Pareddy, Sudhakar Reddy.

Advisor dc:contributor.advisor

• Saba, Walid Shaker,

Licence

• http://creativecommons.org/licenses/by-nc-nd/4.0/

Language dc:language.iso

en_CA

Handle dc:identifier.uri

https://hdl.handle.net/20.500.14776/1667

OAI identifier oai:identifier

oai:uwindsor.scholaris.ca:20.500.14776/1667