Proof Nets and the Complexity of Processing Center-Embedded Constructions

Simple item page
dc.creatorJohnson, Mark
dc.date1997-11-20
dc.date.accessioned2026-07-07T02:36:08Z
dc.date.available2026-07-07T02:36:08Z
dc.descriptionThis 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.
dc.descriptionTo appear in Proceedings of LACL 95; uses epic.sty, eepic.sty, rotate.sty
dc.identifierhttps://arxiv.org/abs/cmp-lg/9711012
dc.identifierhttp://arxiv.org/abs/cmp-lg/9711012
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/15810
dc.subjectComputation and Language
dc.titleProof Nets and the Complexity of Processing Center-Embedded Constructions
dc.typetext

Files

Collections

arXiv