Dependency Tree Semantics

  • Leonardo Lesmo
  • Livio Robaldo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4203)


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.


Unary Predicate Discourse Referent Phrase Structure Grammar Computational Semantic Scope Ambiguity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alshawi, H.: The Core Language Engine. MIT Press, Cambridge (1992)Google Scholar
  2. 2.
    Alshawi, H., Crouch, R.: Monotonic Semantic Interpretation. In: Proc. Of the 30th Annual Meeting of the ACL, pp. 32–39. MIT Press, Cambridge (1992)Google Scholar
  3. 3.
    Bunt, H.: Underspecification in Semantic Representations: Which Technique for What Purpose? In: 5th Workshop on Computational Semantics (IWCS-5), pp. 37–54 (2003)Google Scholar
  4. 4.
    Chaves, R.P.: Non-Redundant Scope Disambiguation in Underspecified Semantics. In: ten Cate, B. (ed.) Proc. of the 8th ESSLLI Student Session, pp. 47–58 (2003)Google Scholar
  5. 5.
    Copestake, A., Flickinger, D., Sag, I.A.: Minimal Recursion Semantics. An introduction. Stanford University (manuscript, 1999)Google Scholar
  6. 6.
    Debusmann, R., Duchier, D., Koller, A., Kuhlmann, M., Smolka, G., Thater, S.: A Relational Syntax-Semantics Interface Based on Dependency Grammar. In: Proc. 20th COLING, Geneva (2004a)Google Scholar
  7. 7.
    Debusmann, R., Duchier, D., Kruijff, G.-J.M.: Extensible Dependency Grammar: A New Methodology. In: Proc. of the COLING 2004 Workshop on Recent Advances in Dependency Grammar, Geneva (2004b)Google Scholar
  8. 8.
    Debusmann, R., Duchier, D., Rossberg, A.: Modular Grammar Design with Typed Parametric Principles. In: Proc. of FG-MOL 2005, Edinburgh (2005)Google Scholar
  9. 9.
    Egg, M., Koller, A., Niehren, J.: The Constraint Language for Lambda Structures. Journal of Logic, Language and Information 10, 457–485 (2001)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Hobbs, J.R., Shieber, S.: An Algorithm for Generating Quantifier Scoping. Computational Linguistics 13, 47–63 (1987)Google Scholar
  11. 11.
    Joshi, A.K., Kallmeyer, L.: Factoring Predicate Argument and Scope Semantics: Underspecified Semantics with LTAG. Research on Language and Computation 1, 3–58 (2003)MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Joshi, A.K., Schabes, Y.: Tree-Adjoining Grammars. In: Rozenberg, G., Salomaa, A. (eds.), pp. 69–123. Springer, Berlin (1997)Google Scholar
  13. 13.
    Kamp, H., Reyle, U.: From Discourse to Logic. Kluwer Academic Publishers, Dordrecht (1993)Google Scholar
  14. 14.
    Larson, R.K.: Quantifying into NP. Ms. MIT (1985)Google Scholar
  15. 15.
    Lesmo, L., Robaldo, L., Gerbrandy, J.: Quantifiers in Dependency tree Semantics. In: Proc. Inference in Computational Semantics (ICOS-5) (2006)Google Scholar
  16. 16.
    May, R., Bale, A.: Inverse Linking. Encyclopedia Entry in Syncom (2002),
  17. 17.
    Mel’cuk, I.: Dependency syntax: theory and practice. SUNY University Press (1988)Google Scholar
  18. 18.
    Mel’cuk, I.: Semantics and the Lexicon in modern Linguistics. In: Proc. of the 1st Int. Conf. on Intelligent Text Processing (CICLing), pp. 6–18 (2000)Google Scholar
  19. 19.
    Pollard, C., Sag, I.: Head-Driven Phrase Structure Grammar. The University of Chicago Press (1994)Google Scholar
  20. 20.
    Reyle, U.: Dealing with ambiguities by Underspecification: Construction, Representation and Deduction. Journal of Semantics, 123–179 (1993)Google Scholar
  21. 21.
    Sher, G.: Ways of branching quantifiers. Linguistics and Philosophy 13, 393–422 (1990)CrossRefGoogle Scholar
  22. 22.
    Sher, G.: Partially-ordered (branching) generalized quantifiers: a general definition. The Journal of Philosophical Logic 26, 1–43 (1997)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Leonardo Lesmo
    • 1
  • Livio Robaldo
    • 1
  1. 1.Dipartimento di InformaticaUniversitá di TorinoItaly

Personalised recommendations