Proof Nets and the Complexity of Processing Center-Embedded Constructions
<|reference_start|>Proof Nets and the Complexity of Processing Center-Embedded Constructions: 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.<|reference_end|>
@article{johnson1997proof,
    title={Proof Nets and the Complexity of Processing Center-Embedded
  Constructions},
    author={Mark Johnson (Brown University)},
    journal={arXiv preprint arXiv:cmp-lg/9711012},
    year={1997},
    archivePrefix={arXiv},
    eprint={cmp-lg/9711012},
    primaryClass={cmp-lg cs.CL}
}