Proof Nets and the Complexity of Processing Center Embedded Constructions

Authors:
Mark Johnson
Affiliations:
Department of Cognitive and Linguistic Sciences, Brown University, Box 1978, Providence, RI 02912, U.S.A. (E-mail: Email: mj@lx.cog.brown.edu)
Venue:
Journal of Logic, Language and Information
Year:
1998

Citing 2
Cited 4

Proofs and types

Proofs and types
Linear logic: its syntax and semantics

Proceedings of the workshop on Advances in linear logic

Incremental processing and acceptability

Computational Linguistics
Dutch Grammar and Processing: A Case Study in TLG

Logic, Language, and Computation
Interaction Grammars

Research on Language and Computation
Controlling extraction in abstract categorial grammars

FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper shows how proof nets can be used to formalize the notion of’’incomplete dependency‘‘ used in psycholinguistic theories of theunacceptability of center embedded constructions. Such theories ofhuman language processing can usually be restated in terms ofgeometrical constraints on proof nets. The paper ends with adiscussion of the relationship between these constraints andincremental semantic interpretation.