Skip to main content
Springer Nature Link
Log in

Towards a Computational Treatment of Binding Theory

  • Conference paper
Logical Aspects of Computational Linguistics (LACL 2005)

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

  • 496 Accesses

Abstract

We present two approaches to the task of computing in an inductive compositional way semantic representations of the meaning of a sentence that take into account the principles of Binding Theory. The two algorithms reflect two different interpretations that have been proposed for the principles of Binding Theory as first formulated by Noam Chomsky. We present the two algorithms as additional machinery to enrich well-known bottom-up procedures to compute the logical form of a sentence in a (non intensional) Montagovian style.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Chomsky, N.: Lectures on Government and Binding. Foris, Dordrecht (1981)

    Google Scholar 

  2. Büring, D.: Binding Theory. Cambridge Textbooks in Linguistics. Cambridge University Press, Cambridge (to appear)

    Google Scholar 

  3. Reinhart, T.: Anaphora and Semantic Interpretation. University of Chicago Press (1983)

    Google Scholar 

  4. Chomsky, N.: The minimalist program. MIT Press, Cambridge, MA (1995)

    MATH  Google Scholar 

  5. Reinhart, T., Reuland, E.: Reflexivity. Linguistic Inquiry 24, 657–720 (1993)

    Google Scholar 

  6. Pesetsky, D.: Zero Syntax: Experiencers and Cascades. MIT Press, Cambridge (1994)

    Google Scholar 

  7. Heim, I., Kratzer, A.: Semantics in Generative Grammar. Blackwell, Oxford (1998)

    Google Scholar 

  8. Egg, M., Niehren, J., Ruhrberg, P., Xu, F.: Constraints over lambda-structures in semantic underspecification. In: Boitet, C., Whitelock, P. (eds.) Proceedings of the Thirty-Sixth Annual Meeting of the ACL, San Francisco, California, pp. 353–359. Morgan Kaufmann, San Francisco (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università degli Studi di Verona, Strada Le Grazie, 15, 37134, Verona, Italy

    Roberto Bonato

Authors
  1. Roberto Bonato
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LPL-CNRS, Université de Provence, 29 Avenue Robert Schuman, P.O. Box, 13621, Aix-en-Provence, France

    Philippe Blache

  2. Linguistics Dept., UCLA, Box 951543, 90095-1542, Los Angeles, CA, USA

    Edward Stabler

  3. ERSS, Université Bordeaux 3, CNRS, Domaine Universitaire, 33607, Pessac Cedex, France

    Joan Busquets

  4. LaBRI, Université Bordeaux 1, CNRS, 351, Cours de la Libération, 33405, Talence Cedex, France

    Richard Moot

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bonato, R. (2005). Towards a Computational Treatment of Binding Theory. In: Blache, P., Stabler, E., Busquets, J., Moot, R. (eds) Logical Aspects of Computational Linguistics. LACL 2005. Lecture Notes in Computer Science(), vol 3492. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11422532_3

Download citation

  • DOI: https://doi.org/10.1007/11422532_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25783-7

  • Online ISBN: 978-3-540-31953-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation