Skip to main content
SpringerLink
Log in

Scope Underspecification with Tree Descriptions: Theory and Practice

  • Chapter
  • First Online:
Book cover Resource-Adaptive Cognitive Processes

Part of the book series: Cognitive Technologies ((COGTECH))

  • 765 Accesses

Abstract

Scope underspecification is the standard technique used in computational linguistics to deal efficiently with scope ambiguities, a certain type of semantic ambiguity. Its key idea is to not enumerate all semantic readings from a syntactic analysis during or after parsing as in more traditional approaches to semantic construction, but to derive a single, compact underspecified representation (USR) that describes the set of readings instead.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. Althaus, E., Duchier, D., Koller, A., Mehlhorn, K., Niehren, J., Thiel, S.: An efficient graph algorithm for dominance constraints. Journal of Algorithms 48, 194–219 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  2. Apt, K.R.: Principles of Constraint Programming. Cambridge University Press, Cambridge (2003)

    Book  MATH  Google Scholar 

  3. Backofen, R., Rogers, J., Vijay-Shanker, K.: A first-order axiomatization of the theory of finite trees. Journal of Logic, Language, and Information 4, 5–39 1995

    Article  MathSciNet  MATH  Google Scholar 

  4. Bender, E., Flickinger, D.P., Oepen, S.: The grammar matrix: An open-source starter-kit for the rapid development of cross-linguistically consistent broad-coverage precision grammars. In: Proceedings of the ACL Workshop on Effective Tools and Methodologies for Teaching Natural Language Processing and Computational Linguistics. Philadelphia (2002)

    Google Scholar 

  5. Bodirsky, M., Duchier, D., Niehren, J., Miele, S.: An efficient algorithm for weakly normal dominance constraints. In: ACM-SIAM Symposium on Discrete Algorithms. The ACM Press, New York (2004)

    Google Scholar 

  6. Bos, J.: Predicate logic unplugged. In: Amsterdam Colloquium. Amsterdam pp. 133–143 (1996)

    Google Scholar 

  7. Comon, H., Dauchet, M., Gilleron, R., Löding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications. Available at http://www.grappa.univ-lille3.fr/tata (2007)

  8. Copestake, A., Flickinger, D.: An open-source grammar development environment and broad-coverage english grammar using HPSG. In: Conference on Language Resources and Evaluation. The LKB system is available at http://www.delph-in.net/lkb/ (2000)

  9. Copestake, A., Flickinger, D., Pollard, C., Sag, I.: Minimal recursion semantics: An introduction. Journal of Research on Language and Computation \bf 3(2–3), 281–332 (2004)

    Google Scholar 

  10. Copestake, A., Lascarides, A., Flickinger, D.: An algebra for semantic construction in constraint-based grammars. In: Proceedings of the 39th Annual Meeting of the Association for Computational Linguistics, pp. 132–139. Toulouse, France (2001)

    Google Scholar 

  11. Dalrymple, M. (ed.): Semantics and syntax in Lexical Functional Grammar. MIT Press, Cambridge, MA (1999)

    MATH  Google Scholar 

  12. Debusmann, R., Duchier, D., Koller, A., Kuhlmann, M., Smolka, G., Thater, S.: A relational syntax-semantics interface based on dependency grammar. In: Proceedings of the 20th COLING. Geneva (2004)

    Google Scholar 

  13. Duchier, D., Niehren, J.: Dominance constraints with set operators. In: Proceedings of the First International Conference on Computational Logic, no. 1861 in Lecture Notes in Computer Science, pp. 326–341. Springer-Verlag, Berlin (2000)

    Google Scholar 

  14. Egg, M.: Flexible semantics for reinterpretation phenomena. CSLI Press, Stanford, CA (2005)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  16. Erk, K., Koller, A., Niehren, J.: Processing underspecified semantic descriptions in the constraint language for lambda structures. Research on Language and Computation 1, 127–169 2003

    Article  MathSciNet  MATH  Google Scholar 

  17. Flickinger, D., Koller, A., Thater, S.: A new well-formedness criterion for semantics debugging. In: S. Müller (ed.) The Proceedings of the 12th International Conference on Head-Driven Phrase Structure Grammar, pp. 129–142. CSLI Publications, Stanford, CA (2005)

    Google Scholar 

  18. Frey, W.: Syntaktische bedingungen für die semantisch interpretation. über bindung, implizite argumente und skopus. studia grammatika (1993)

    Google Scholar 

  19. Fuchss, R., Koller, A., Niehren, J., Thater, S.: Minimal recursion semantics as dominance constraints: Translation, evaluation, and analysis. In: Proceedings of the 42nd ACL. Barcelona (2004)

    Google Scholar 

  20. Gardent, C., Webber, B.: Describing discourse semantics. In: Proceedings of the 4th TAG+ Workshop. Philadelphia (1998)

    Google Scholar 

  21. Gottlob, G., Koch, C., Schulz, K.U.: Conjunctive queries over trees. In: 23rd ACM Symposium on Principles of Database Systems, pp. 189–200. ACM Press, New York (2004)

    Google Scholar 

  22. Higgins, D., Sadock, J.: A machine learning approach to modeling scope preferences. Computational Linguistics 29(1), 73–96 (2003)

    Article  Google Scholar 

  23. Jaspars, J., Koller, A.: A calculus for direct deduction with dominance constraints. In: Proceedings of the 12th Amsterdam Colloquium. Amsterdam (1999)

    Google Scholar 

  24. Koller, A., Niehren, J., Thater, S.: Bridging the gap between underspecification formalisms: Hole semantics as dominance constraints. In: EACL’03. Budapest (2003)

    Google Scholar 

  25. Koller, A., Niehren, J., Treinen, R.: Dominance constraints: Algorithms and complexity. In: Proceedings of LACL, pp. 106–125. Appeared in 2001 as volume 2014 of LNAI, Springer Verlag (1998)

    Google Scholar 

  26. Koller, A., Regneri, M., Thater, S.: Regular tree grammars as a formalism for scope underspecification. In: Proceedings of ACL-08 (2008)

    Google Scholar 

  27. Koller, A., Thater, S.: The evolution of dominance constraint solvers. In: Proceedings of the ACL-05 Workshop on Software. Ann Arbor (2005)

    Google Scholar 

  28. Koller, A., Thater, S.: An improved redundancy elimination algorithm for underspecified descriptions. In: Proceedings of COLING/ACL-2006. Sydney (2006)

    Google Scholar 

  29. Koller, A., Thater, S.: Solving unrestricted dominance graphs. In: Proceedings of the 12th Conference on Formal Grammar. Dublin (2007)

    Google Scholar 

  30. Marcus, M.P., Hindle, D., Fleck, M.M.: D-theory: Talking about talking about trees. In: 21st Annual Meeting of the ACL, pp. 129–136, Cambridge (1983).

    Google Scholar 

  31. Müller, S.: The Grammix CD Rom. a software collection for developing typed feature structure grammars. In: T.H. King, E.M. Bender (eds.) Grammar Engineering across Frameworks 2007, Studies in Computational Linguistics ONLINE, pp. 259–266. CSLI Publications, Stanford (2007). URL http://hpsg.fu-berlin.de/stefan/Pub/grammix.html

  32. Müller, T., Müller, M.: Finite set constraints in Oz. In: F. cois Bry, B. Freitag, D. Seipel (eds.) 13. Workshop Logische Programmierung, pp. 104–115. Technische Universität München (1997)

    Google Scholar 

  33. Niehren, J., Koller, A.: Dominance constraints in context unification. In: Proceedings of the Third Conference on Logical Aspects of Computational Linguistics (LACL ’98). Grenoble, France (1998)

    Google Scholar 

  34. Niehren, J., Pinkal, M., Ruhrberg, P.: A uniform approach to underspecification and parallelism. In: Proceedings ACL’97, pp. 410–417. Madrid (1997)

    Google Scholar 

  35. Niehren, J., Thater, S.: Bridging the gap between underspecification formalisms: Minimal recursion semantics as dominance constraints. In: Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics (2003)

    Google Scholar 

  36. Oepen, S., Toutanova, K., Shieber, S., Manning, C., Flickinger, D., Brants, T.: The LinGO Redwoods treebank: Motivation and preliminary applications. In: Proceedings of the 19th International Conference on Computational Linguistics (COLING’02), pp. 1253–1257 (2002)

    Google Scholar 

  37. Oz Development Team: The Mozart Programming System. Web pages (2004). http://www.mozart-oz.org

  38. Pafel, J.: Skopus und logische Struktur: Studien zum Quantorenskopus im Deutschen. Habilitationsschrift, Eberhard-Karls-Universität Tübingen (1997)

    Google Scholar 

  39. Poesio, M.: Ambiguity, Underspecification and Discourse Interpretation. In: Proceedings of the First International Workshop on Computational Semantics (1994)

    Google Scholar 

  40. Reyle, U.: Dealing with ambiguities by underspecification: Construction, representation and deduction. Journal of Semantics 10(1), 123–179 (1993)

    Article  MathSciNet  Google Scholar 

  41. Rogers, J., Vijay-Shanker, K.: Obtaining trees from their descriptions: An application to tree-adjoining grammars. Computational Intelligence 10, 401–421 1994

    Article  Google Scholar 

  42. Skut, W., Krenn, B., Brants, T., Uszkoreit, H.: An annotation scheme for free word order languages. In: Proceedings of the Fifth Conference on Applied Natural Language Processing ANLP-97. Washington, DC (1997)

    Google Scholar 

  43. Thatcher, J.W., Wright, J.B.: Generalized finite automata theory with anapplication to a decision problem of second-order logic. Mathematical Systems Theory 2(1), 57–81 (1967)

    Article  MathSciNet  Google Scholar 

  44. Thater, S.: Minimal recursion semantics as dominance constraints: Graph-theoretic foundation and application to grammar engineering. Ph.D. thesis, Department of Computational Linguistics, Saarland University (2007)

    Google Scholar 

  45. van Deemter, K.: Towards a logic of ambiguous expressions. In: van Deemter, K., Peters, S. (eds.) Semantic Ambiguity and Underspecification pp. 203–237. CSLI Press, Stanford, CA (1996)

    Google Scholar 

  46. Vestre, E.: An algorithm for generating non-redundant quantifier scopings. In: Proceedings of the Fifth EACL. Berlin (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. MMCI and Department of Computational Linguistics and Phonetics, Saarland University, 66123, Saarbrücken, Germany

    Alexander Koller

  2. Department of Computational Linguistics and Phonetics, Saarland University, 66123, Saarbrücken, Germany

    Stefan Thater & Manfred Pinkal

Authors
  1. Alexander Koller
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefan Thater
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Manfred Pinkal
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alexander Koller .

Editor information

Editors and Affiliations

  1. Inst. Computerlinguistik, Universität des Saarlandes, Saarbrücken, 66041, Germany

    Matthew W. Crocker

  2. Deutsches Forschungszentrum für, Künstliche Intelligenz, Universität des Saarlandes, Stuhlsatzenhausweg 3, Saarbrücken, 66123, Germany

    Jörg Siekmann

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Koller, A., Thater, S., Pinkal, M. (2010). Scope Underspecification with Tree Descriptions: Theory and Practice. In: Crocker, M., Siekmann, J. (eds) Resource-Adaptive Cognitive Processes. Cognitive Technologies. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89408-7_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89408-7_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89407-0

  • Online ISBN: 978-3-540-89408-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation