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.