TEAM: an experiment in the design of transportable natural-language interfaces
Artificial Intelligence
An algorithm for generating quantifier scopings
Computational Linguistics
Determining the Scope of English Quantifiers
Determining the Scope of English Quantifiers
ACL '81 Proceedings of the 19th annual meeting on Association for Computational Linguistics
Categorial semantics and scoping
Computational Linguistics
An implementable semantics for comparative constructions
Computational Linguistics
Computational Linguistics
Sentential semantics for propositional attitudes
Computational Linguistics
A machine learning approach to modeling scope preferences
Computational Linguistics
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Parsing parallel grammatical representations
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Translation by Quasi Logical Form transfer
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Gemini: a natural language system for spoken-language understanding
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
Logical Forms in the core language engine
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
A calculus for semantic composition and scoping
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Quantifier scope and constituency
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Towards a cognitively plausible model for quantification
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Monotonic semantic interpretation
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
A hybrid system for quantifier scoping
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 3
A hybrid system for quantifier scoping
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 3
Gemini: a natural language system for spoken-language understanding
HLT '93 Proceedings of the workshop on Human Language Technology
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
Quantifier scope disambiguation using extracted pragmatic knowledge: preliminary results
EMNLP '09 Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 3 - Volume 3
Generating quantifiers and negation to explain homework testing
IUNLPBEA '10 Proceedings of the NAACL HLT 2010 Fifth Workshop on Innovative Use of NLP for Building Educational Applications
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
Quantification and commonsense reasoning
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
A corpus of scope-disambiguated English text
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 2
Unrestricted quantifier scope disambiguation
TextGraphs-6 Proceedings of TextGraphs-6: Graph-based Methods for Natural Language Processing
| Hi-index | 0.00 |
An algorithm for generating the possible quantifier scopings for a sentence, in order of preference, is outlined. The scoping assigned to a quantifier is determined by its interactions with other quantifiers, modals, negation, and certain syntactic-constituent boundaries. When a potential scoping is logically equivalent to another, the less preferred one is discarded.The relative scoping preferences of the individual quantifiers are not embedded in the algorithm, but are specified by a set of rules. Many of the rules presented here have appeared in the linguistics literature and have been used in various natural language processing systems. However, the co-ordination of these rules and the resulting coverage represents a significant contribution. Because experimental data on human quantifier-scoping preferences are still fragmentary, we chose to design a system in which the set of preference rules could be easily modified and expanded.The algorithm described has been implemented in Prolog as part of a larger natural language processing system. Extensions of this algorithm are in progress.