An algorithm for generating quantifier scopings
Computational Linguistics
Quantifier scoping in the SRI core language engine
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
An integrated framework for semantic and pragmatic interpretation
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Categorial semantics and scoping
Computational Linguistics
A quantifier scoping algorithm without a Free Variable Constraint
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Dependency Tree Semantics: Branching Quantification in Underspecification
AI*IA '07 Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing
A pragmatic treatment of quantification in natural language
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
| Hi-index | 0.00 |
Certain restrictions on possible scopings of quantified noun phrases in natural language are usually expressed in terms of formal constraints on binding at a level of logical form. Such reliance on the form rather than the content of semantic interpretations goes against the spirit of compositionality. I will show that those scoping restrictions follow from simple and fundamental facts about functional application and abstraction, and can be expressed as constraints on the derivation of possible meanings for sentences rather than constraints of the alleged forms of those meanings.