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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Robaldo, L. (2007). Dependency tree semantics: Branching quantification in underspecification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4733 LNAI, pp. 374–385). https://doi.org/10.1007/978-3-540-74782-6_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
