An improper treatment of quantification in ordinary English
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
ACL '81 Proceedings of the 19th annual meeting on Association for Computational Linguistics
Categorial semantics and scoping
Computational Linguistics
Semantic-head-driven generation
Computational Linguistics
The relation-based knowledge representation of King Kong
ACM SIGART Bulletin - Special issue on implemented knowledge representation and reasoning systems
Sentential semantics for propositional attitudes
Computational Linguistics
Quantification and Intensionality in Situation Semantics
CICLing '02 Proceedings of the Third International Conference on Computational Linguistics and Intelligent Text Processing
A machine learning approach to modeling scope preferences
Computational Linguistics
Bidirectional contextual resolution
Computational Linguistics
An approach to multilevel semantics for applied systems
ANLC '92 Proceedings of the third conference on Applied natural language processing
On the syntactic-semantic analysis of bound anaphora
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
An algorithm for generating non-redundant quantifier scopings
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Constraints over Lambda-Structures in semantic underspecification
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Parsing parallel grammatical representations
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Assigning a semantic scope to operators
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
A semantic-head-driven generation algorithm for unification-based formalisms
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
Using higher-order logic programming for semantic interpretation of coordinate constructs
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
A unification-based semantic interpretation for coordinate constructs
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Connection relations and quantifier scope
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Quantifier scoping in the SRI core language engine
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
A quantifier scoping algorithm without a Free Variable Constraint
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Synchronous tree-adjoining grammars
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Incremental interpretation: applications, theory, and relationship to dynamic semantics
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Expressing quantifier scope in French generation
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
A hybrid system for quantifier scoping
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 3
Semantic abstraction and anaphora
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 1
A hybrid system for quantifier scoping
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 3
A Reference Architecture for Generation Systems
Natural Language Engineering
Two accounts of scope availability and semantic underspecification
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Alternating quantifier scope in CCG
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
A polynomial-time fragment of dominance constraints
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
Validation of terminological inference in an information extraction task
HLT '93 Proceedings of the workshop on Human Language Technology
Generating referring quantified expressions
INLG '00 Proceedings of the first international conference on Natural language generation - Volume 14
A Reference Architecture for Natural Language Generation Systems
Natural Language Engineering
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
Deep linguistic processing for spoken dialogue systems
DeepLP '07 Proceedings of the Workshop on Deep Linguistic Processing
Incremental syntactic and semantic processing
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 2
Natural language and exploration of an information space: the ALFresco interactive system
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 2
Semantic inference in natural language: validating a tractable approach
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Disambiguating quantifier scope in DTS
IWCS-8 '09 Proceedings of the Eighth International Conference on Computational Semantics
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
Grading knowledge: extracting degree information from texts
Grading knowledge: extracting degree information from texts
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
Distributivity, Collectivity, and Cumulativity in Terms of (In)dependence and Maximality
Journal of Logic, Language and Information
An efficient enumeration algorithm for canonical form underspecified semantic representations
FG'09 Proceedings of the 14th international conference on Formal grammar
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
ISMIS'06 Proceedings of the 16th international conference on Foundations of Intelligent Systems
Flexible disambiguation in DTS
CICLing'10 Proceedings of the 11th international conference on Computational Linguistics and Intelligent Text Processing
Expanding the range of tractable scope-underspecified semantic representations
SemEval '12 Proceedings of the First Joint Conference on Lexical and Computational Semantics - Volume 1: Proceedings of the main conference and the shared task, and Volume 2: Proceedings of the Sixth International Workshop on Semantic Evaluation
Hi-index | 0.00 |
The syntactic structure of a sentence often manifests quite clearly the predicate-argument structure and relations of grammatical subordination. But scope dependencies are not so transparent. As a result, many systems for representing the semantics of sentences have ignored scoping or generated scopings with mechanisms that have often been inexplicit as to the range of scopings they choose among or profligate in the scopings they allow.This paper presents, along with proofs of some of its important properties, an algorithm that generates scoped semantic forms from unscoped expressions encoding predicate-argument structure. The algorithm is not profligate as are those based on permutation of quantifiers, and it can provide a solid foundation for computational solutions where completeness is sacrificed for efficiency and heuristic efficacy.