Abstract
This paper presents Dependency Tree Semantics (DTS), an underspecified logic for representing quantifier scope ambiguities. DTS features a direct interface with a Dependency grammar, an easy management of partial disambiguations and the ability to represent branching quantifier readings. This paper focuses on the syntax of DTS, while does not take into account the model-theoretic interpretation of its well-formed structures. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Lesmo, L., & Robaldo, L. (2006). Dependency tree semantics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4203 LNAI, pp. 550–559). Springer Verlag. https://doi.org/10.1007/11875604_62
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
