Dependency Tree Semantics: Branching Quantification in Underspecification

Authors:
Livio Robaldo
Affiliations:
Department of Computer Science - University of Turin, C.so Svizzera 185, 10149, Torino, Italy
Venue:
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
Year:
2007

Citing 6
Cited 0

An algorithm for generating quantifier scopings

Computational Linguistics
Tree-adjoining grammars

Handbook of formal languages, vol. 3
The Constraint Language for Lambda Structures

Journal of Logic, Language and Information
A lexical theory of quantification in ambiguous query interpretation

A lexical theory of quantification in ambiguous query interpretation
A calculus for semantic composition and scoping

ACL '89 Proceedings of the 27th 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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dependency Tree Semantics (DTS) is a formalism that allows to underspecify quantifier scope ambiguities. This paper provides an introduction of DTS and highlights its linguistic and computational advantages. From a linguistics point of view, DTS is able to represent the so-called Branching Quantifier readings, i.e. those readings in which two or more quantifiers have to be evaluated in parallel. From a computational point of view, DTS features an easy syntax---semantics interface wrt a Dependency Grammar and allows for incremental disambiguations.