Proof Nets and the Complexity of Processing Center-Embedded Constructions
cmp-lg
2007-05-23 v1 Computation and Language
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.
Cite
@article{arxiv.cmp-lg/9711012,
title = {Proof Nets and the Complexity of Processing Center-Embedded Constructions},
author = {Mark Johnson},
journal= {arXiv preprint arXiv:cmp-lg/9711012},
year = {2007}
}
Comments
To appear in Proceedings of LACL 95; uses epic.sty, eepic.sty, rotate.sty