Abstract
This paper shows how proof nets can be used to formalize the notion of “incomplete dependency” used in psycholinguistic theories of the unacceptability of center embedded constructions. Such theories of human language processing can usually be restated in terms of geometrical constraints on proof nets. The paper ends with a discussion of the relationship between these constraints and incremental semantic interpretation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chomsky, N., 1965, Aspects of the Theory of Syntax, Cambridge, MA: The MIT Press.
Chomsky, N. and Miller, G., 1963, “Finitary models of language users,” pp. 419–492 in Handbook of Mathematical Psychology, Vol. 2, R. Luce, ed., New York: John Wiley and Sons.
Gibson, E. and Thomas, J., 1996, “The processing complexity of English center-embedded and selfembedded structures,” in The Proceedings of the NELS, North Eastern Linguistic Society, ed., Amherst, MA: Graduate Student Association, University of Massachusetts.
Girard, J.-Y., 1995, “Linear Logic: Its syntax and semantics,” pp. 1–42 in Advances in Linear Logic, J.-Y. Girard, Y. Lafont, and L. Regnier, eds., Cambridge, England: Cambridge University Press.
Girard, J.-Y., Lafont, Y., and Taylor, P., 1989, Proofs and Types, Cambridge Tracts in Theoretical Computer Science, Vol. 7, Cambridge, England: Cambridge University Press.
Lamarche, F. and Retoré, C., 1996, “Proof nets for the Lambek calculus — An overview,” pp. 241–262 in Proofs and Linguistic Categories, Proceedings of the 1996 Roma Workshop, V.M. Abrusci and C. Casadio, eds., Bologna: Cooperativa Libraria Universitaria Editrice Bologna.
Lewis, R., 1996a, “Interference in short-term memory: The magical number two (or three) in sentence processing,” Journal of Psycholinguistic Research 25(1), 93–115.
Lewis, R., 1996b, “A theory of grammatical but unacceptable embeddings,” Unpublished manuscript, Ohio State University.
Moortgat, M., 1997, “Categorial type logics,” pp. 93–178 in Handbook of Logic and Language, J. van Benthem and A. ter Meulen, eds., Cambridge, MA: The MIT Press.
Morrill, G.V., 1994, Type-Logical Grammar: Categorial Logic of Signs, Dordrecht: Kluwer Academic Publishers.
Retoré, C., 1996, “Calcul de Lambek et logique linéaire,” Traitement Automatique des Langues 37(2), 39–70.
Roorda, D., 1991, “Resource logics: Proof-theoretical investigations,” Ph.D. Thesis, University of Amsterdam.
Roorda, D., 1992, “Proof nets for Lambek calculus,” Journal of Logic and Computation 2, 211–231.
Stabler, E.P., 1994, “The finite connectivity of linguistic structure,” pp. 303–336 in Perspectives in Sentence Processing, C. Clifton, L. Frazier, and K. Rayner, eds., Hillsdale, NJ: Lawrence Erlbaum.
van Benthem, J., 1995, Language in Action: Categories, Lambdas and Dynamic Logic, Cambridge, MA: The MIT Press.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Johnson, M. Proof Nets and the Complexity of Processing Center Embedded Constructions. Journal of Logic, Language and Information 7, 433–447 (1998). https://doi.org/10.1023/A:1008386826277
Issue Date:
DOI: https://doi.org/10.1023/A:1008386826277