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.
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
Chomsky, N.: Lectures on Government and Binding. Foris, Dordrecht (1981)
Büring, D.: Binding Theory. Cambridge Textbooks in Linguistics. Cambridge University Press, Cambridge (to appear)
Reinhart, T.: Anaphora and Semantic Interpretation. University of Chicago Press (1983)
Chomsky, N.: The minimalist program. MIT Press, Cambridge, MA (1995)
Reinhart, T., Reuland, E.: Reflexivity. Linguistic Inquiry 24, 657–720 (1993)
Pesetsky, D.: Zero Syntax: Experiencers and Cascades. MIT Press, Cambridge (1994)
Heim, I., Kratzer, A.: Semantics in Generative Grammar. Blackwell, Oxford (1998)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)