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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alshawi, H.: The Core Language Engine. MIT Press, Cambridge (1992)
Alshawi, H., Crouch, R.: Monotonic Semantic Interpretation. In: Proc. Of the 30th Annual Meeting of the ACL, pp. 32–39. MIT Press, Cambridge (1992)
Bunt, H.: Underspecification in Semantic Representations: Which Technique for What Purpose? In: 5th Workshop on Computational Semantics (IWCS-5), pp. 37–54 (2003)
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)
Copestake, A., Flickinger, D., Sag, I.A.: Minimal Recursion Semantics. An introduction. Stanford University (manuscript, 1999)
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)
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)
Debusmann, R., Duchier, D., Rossberg, A.: Modular Grammar Design with Typed Parametric Principles. In: Proc. of FG-MOL 2005, Edinburgh (2005)
Egg, M., Koller, A., Niehren, J.: The Constraint Language for Lambda Structures. Journal of Logic, Language and Information 10, 457–485 (2001)
Hobbs, J.R., Shieber, S.: An Algorithm for Generating Quantifier Scoping. Computational Linguistics 13, 47–63 (1987)
Joshi, A.K., Kallmeyer, L.: Factoring Predicate Argument and Scope Semantics: Underspecified Semantics with LTAG. Research on Language and Computation 1, 3–58 (2003)
Joshi, A.K., Schabes, Y.: Tree-Adjoining Grammars. In: Rozenberg, G., Salomaa, A. (eds.), pp. 69–123. Springer, Berlin (1997)
Kamp, H., Reyle, U.: From Discourse to Logic. Kluwer Academic Publishers, Dordrecht (1993)
Larson, R.K.: Quantifying into NP. Ms. MIT (1985)
Lesmo, L., Robaldo, L., Gerbrandy, J.: Quantifiers in Dependency tree Semantics. In: Proc. Inference in Computational Semantics (ICOS-5) (2006)
May, R., Bale, A.: Inverse Linking. Encyclopedia Entry in Syncom (2002), http://kleene.sss.uci.edu/~rmay
Mel’cuk, I.: Dependency syntax: theory and practice. SUNY University Press (1988)
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)
Pollard, C., Sag, I.: Head-Driven Phrase Structure Grammar. The University of Chicago Press (1994)
Reyle, U.: Dealing with ambiguities by Underspecification: Construction, Representation and Deduction. Journal of Semantics, 123–179 (1993)
Sher, G.: Ways of branching quantifiers. Linguistics and Philosophy 13, 393–422 (1990)
Sher, G.: Partially-ordered (branching) generalized quantifiers: a general definition. The Journal of Philosophical Logic 26, 1–43 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lesmo, L., Robaldo, L. (2006). Dependency Tree Semantics. In: Esposito, F., Raś, Z.W., Malerba, D., Semeraro, G. (eds) Foundations of Intelligent Systems. ISMIS 2006. Lecture Notes in Computer Science(), vol 4203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11875604_62
Download citation
DOI: https://doi.org/10.1007/11875604_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45764-0
Online ISBN: 978-3-540-45766-4
eBook Packages: Computer ScienceComputer Science (R0)