Proof Nets and the Complexity of Processing Center-Embedded Constructions

Computer Science – Computation and Language

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

To appear in Proceedings of LACL 95; uses epic.sty, eepic.sty, rotate.sty

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Proof Nets and the Complexity of Processing Center-Embedded Constructions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Proof Nets and the Complexity of Processing Center-Embedded Constructions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Proof Nets and the Complexity of Processing Center-Embedded Constructions will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-66406

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.