Proof Nets and the Complexity of Processing Center-Embedded Constructions
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- November 1997
- DOI:
- 10.48550/arXiv.cmp-lg/9711012
- arXiv:
- arXiv:cmp-lg/9711012
- Bibcode:
- 1997cmp.lg...11012J
- Keywords:
-
- Computation and Language;
- Computer Science - Computation and Language
- E-Print:
- To appear in Proceedings of LACL 95