{"id":{"repo_id":"windsor","oai_identifier":"oai:uwindsor.scholaris.ca:20.500.14776/1667"},"canonical_url":"https://search.dev.ndltd.org/etd/windsor/oai:uwindsor.scholaris.ca:20.500.14776/1667","repository":{"repo_id":"windsor","name":"University of Windsor","base_url":"https://uwindsor.scholaris.ca/server/oai/request"},"display":{"title":"Extending a quantifier scope resolution algorithm by accounting for negation.","abstract":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["Pareddy, Sudhakar Reddy."],"institution":"University of Windsor","degree_name":"M.Sc.","degree_level":"Masters","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":["Saba, Walid Shaker,"],"committee_chairs":[],"committee_members":[],"year":2002,"date_issued":"2002-01-01","date_published":"2002-01-01","updated_at":"2026-07-27T22:04:59Z","subjects":[],"languages":["en_CA"],"rights":[],"rights_urls":["http://creativecommons.org/licenses/by-nc-nd/4.0/"],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/20.500.14776/1667","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Saba, Walid Shaker,"]},{"key":"dc:creator","label":"Author","values":["Pareddy, Sudhakar Reddy."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2025-06-12 11:27"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2013-03-21 8:35","2025-06-12T15:27:39Z"]},{"key":"dc:date.issued","label":"Date","values":["2002-01-01"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.Sc."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Windsor"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_CA"]},{"key":"dc:rights","label":"Dc Rights","values":["http://creativecommons.org/licenses/by-nc-nd/4.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/20.500.14776/1667"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["Extending a quantifier scope resolution algorithm by accounting for negation."]}]}],"canonical_facts":{"dc:contributor.advisor":["Saba, Walid Shaker,"],"dc:creator":["Pareddy, Sudhakar Reddy."],"dc:date.accessioned":["2025-06-12 11:27"],"dc:date.available":["2013-03-21 8:35","2025-06-12T15:27:39Z"],"dc:date.issued":["2002-01-01"],"dc:description.abstract":["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."],"dc:identifier.uri":["https://hdl.handle.net/20.500.14776/1667"],"dc:language.iso":["en_CA"],"dc:rights":["http://creativecommons.org/licenses/by-nc-nd/4.0/"],"dc:title":["Extending a quantifier scope resolution algorithm by accounting for negation."],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Masters"],"thesis:degree_name":["M.Sc."],"thesis:institution_name":["University of Windsor"]},"updated_at":"2026-07-27T22:04:59Z"}