Paper: A Quantifier Scoping Algorithm Without A Free Variable Constraint

ACL ID C90-3034
Title A Quantifier Scoping Algorithm Without A Free Variable Constraint
Venue International Conference on Computational Linguistics
Session Main Conference
Year 1990
Authors
  • Ian Lewin (University of Edinburgh, Edinburgh UK)

Three recent demands on quantifier scoping al- gorithms have been that they should be explic- itly stated, they should be sound and complete with respect to the input sentence [Hobbs and Shieber 1987] and they should not employ a 'Free Variable Constraint' [Pereira 1989]. The first de- mand is for good academic practice. The second is to ask for an algorithm that generates all and only the possible scopings of a sentence. The third demand is for an algorithm that avoids appealing to the syntax of logical form in or- der to determine possible scopings. I present a modified version of [Hobbs and Shieber 1987], which simplifies its operation, and can be con- sidered sound and complete, depending on what interpretations of English sentences are deemed possible. Finally, any doubts concerning t...