Skip to main content
SpringerLink
Log in

Dependency Tree Semantics: Branching Quantification in Underspecification

  • Conference paper
AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (AI*IA 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4733))

Included in the following conference series:

  • 1574 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alshawi, H.: The Core Language Engine, pp. 32–39. Mit Press, Cambridge, UK (1992)

    Google Scholar 

  2. Barwise, J.: On branching quantifiers in English. The Journal of Philosophical Logic 8, 47–80 (1979)

    MATH  MathSciNet  Google Scholar 

  3. Bos, J.: Predicate Logic Unplugged. In: Proc. Of the 10th Amsterdam Colloquium, Amsterdam, pp. 133–142 (1996)

    Google Scholar 

  4. Bosco, C.: A grammatical relation system for treebank annotation. PhD thesis, University of Turin (2004)

    Google Scholar 

  5. Bosco, C., Lombardo, V.: A relation schema for treebank annotation. In: Cappelli, A., Turini, F. (eds.) AI*IA 2003. LNCS (LNAI), vol. 2829, pp. 462–473. Springer, Heidelberg (2003)

    Google Scholar 

  6. Bunt, H.: Underspecification in Semantic Representations: Which Technique for What Purpose? In: Proc. of the 5th Workshop on Computational Semantics, Tilburg, The Netherlands, pp. 37–54 (2003)

    Google Scholar 

  7. Copestake, A., Flickinger, D., Sag, I.A.: Minimal Recursion Semantics. An introduction. Manuscript, Stanford University (1999)

    Google Scholar 

  8. Debusmann, R.: Extensible Dependency Grammar: A Modular Grammar Formalism Based On Multigraph Description. PhD thesis, Saarland University (2006)

    Google Scholar 

  9. Ebert, C.: Formal Investigations of Underspecified Representations. PhD thesis, Department of Computer Science, King’s College London (2005)

    Google Scholar 

  10. Egg, M., Koller, A., Niehren, J.: The Constraint Language for Lambda Structures. Journal of Logic, Language and Information 10, 457–485 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  11. Farkas, D.: Dependent Indefinites and Direct Scope. In: Condoravdi, C., Renardel, G. (eds.) Logical Perspectives on Language and Information, Stanford. CSLI Lecture Notes, pp. 41–72 (2001)

    Google Scholar 

  12. Fodor, J., Sag, I.: Referential and quantificational indefinites. Linguistics and Philosophy 5, 355–398 (1982)

    Article  Google Scholar 

  13. Hintikka, J.: Quantifiers vs Quantification Theory. Dialectica 27, 329–358 (1973)

    Article  Google Scholar 

  14. Hobbs, J.R., Shieber, S.: An Algorithm for Generating Quantifier Scoping. Computational Linguistics 13, 47–63 (1987)

    Google Scholar 

  15. Hudson, R.: English word grammar. Basil Blackwell, Oxford, Cambridge (1990)

    Google Scholar 

  16. Kamp, H., Reyle, U.: From Discourse to Logic. Kluwer Academic Publishers, Dordrecht (1993)

    Google Scholar 

  17. Joshi, A.K., Schabes, Y.: Tree-Adjoining Grammars. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 69–123. Springer, Heidelberg (1997)

    Google Scholar 

  18. Joshi, A.K., Kallmeyer, L.: Factoring Predicate Argument and Scope Semantics: Underspecified Semantics with LTAG. Research on Language and Computation 1, 3–58 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  19. Joshi, A.K., Kallmeyer, L., Romero, M.: Flexible Composition in LTAG: Quantifier Scope and Inverse Linking. In: Musken, R., Bunt, H. (eds.) Computing Meaning, vol. 3, Kluwer, Dordrecht (2003)

    Google Scholar 

  20. Lesmo, L., Lombardo, V.: Transformed Subcategorization Frames in Chunk Parsing. In: LREC 2002. Proc. of the 3rd Int. Conf. on Language Resources and Evaluation, Las Palmas, pp. 512–519 (2002)

    Google Scholar 

  21. Lev, I.: Decoupling Scope Resolution from Semantic Composition. In: Proc. 6th Workshop on Computational Semantics, Tilburg, the Netherlands, pp. 139–150 (2005)

    Google Scholar 

  22. Mel’cuk, I.: Dependency syntax: theory and practice. SUNY University Press (1988)

    Google Scholar 

  23. Moran, D.B.: Quantifier scoping in the SRI core language engine. In: Proc. of the 26th annual meeting on ACL, Buffalo, New York, pp. 33–40 (1988)

    Google Scholar 

  24. Park, J.: A Lexical Theory of Quantification in Ambiguous Query Interpretation. PhD thesis, University of Pennsylvania, USA (1996)

    Google Scholar 

  25. Pereira, F.: A calculus for semantic composition and scoping. In: Proc. of the 27th annual meeting on ACL, Vancouver, Canada, pp. 152–160 (1988)

    Google Scholar 

  26. Reinhart, T.: Quantifier-Scope: How labor is divided between QR and choice functions. Linguistics and Philosophy 20, 335–397 (1997)

    Article  Google Scholar 

  27. Reyle, U.: Dealing with ambiguities by Underspecification: Construction, Representation and Deduction. Journal of Semantics, 123–179 (1993)

    Google Scholar 

  28. Reyle, U.: Co-Indexing Labelled DRSs to Represent and Reason with Ambiguities. In: Peters, S., van Deemter, K. (eds.) Semantic Ambiguity and Underspecification, Stanford, pp. 239–268 (1996)

    Google Scholar 

  29. Robaldo, L.: Dependency Tree Semantics. PhD thesis, University of Turin, Italy (2007)

    Google Scholar 

  30. Sher, G.: Ways of branching quantifiers. Linguistics and Philosophy 13, 393–422 (1990)

    Article  Google Scholar 

  31. Sher, G.: Partially-ordered (branching) generalized quantifiers: a general definition. The Journal of Philosophical Logic 26, 1–43 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  32. Steedman, M.: Surface-Compositional Scope-Alternation Without Existential Quantifiers. Draft 5.1, for comments (2006)

    Google Scholar 

  33. van Genabith, J., Crouch, R.: F-Structures, QLFs and UDRSs. In: Proc. of the the 1st Int1 Conference on LFG, pp. 190–205. CSLI Publications, Stanford, CA (1996)

    Google Scholar 

  34. Webber, B. L.: A Formal Approach to Discourse Anaphora PhD thesis, Harvard University, USA (1999)

    Google Scholar 

  35. Winter, Y.: Choice Functions and the Scopal Semantics of Indefinites. Linguistics and Philosophy 20(4), 399–467 (1997)

    Article  MathSciNet  Google Scholar 

  36. Winter, Y.: Distributivity and Dependency. Natural Language Semantics 8, 27–69 (2000)

    Article  Google Scholar 

  37. Winter, Y.: Functional Quantification. Research on Language and Computation 2, 331–363 (2004)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science - University of Turin, C.so Svizzera 185, 10149, Torino, Italy

    Livio Robaldo

Authors
  1. Livio Robaldo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Roberto Basili Maria Teresa Pazienza

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Robaldo, L. (2007). Dependency Tree Semantics: Branching Quantification in Underspecification. In: Basili, R., Pazienza, M.T. (eds) AI*IA 2007: Artificial Intelligence and Human-Oriented Computing. AI*IA 2007. Lecture Notes in Computer Science(), vol 4733. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74782-6_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74782-6_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74781-9

  • Online ISBN: 978-3-540-74782-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation