Abstract

This paper investigates the cost of processing syntactic versus extra-syntactic dependencies. The results support the hypothesis that syntactic dependencies require less processing effort than discourse-derived dependencies do (Reuland 2001, 2011; Koornneef 2008). The point is made through the analysis of a novel paradigm in Russian in which a preposed nominal stranding a numeral can show number connectivity (paucal) with a gap following the numeral or can appear in a non-agreeing (plural) form, as incathedral-paucal/plural,there were three.paucal__. Numerous syntactic diagnostics confirm that when there is number connectivity, the nominal has been fronted via A′-movement, creating a syntactic A′-chain dependency. In the absence of connectivity, the construction involves a hanging topic related via discourse mechanisms to a base-generated null pronoun. The constructions constitute a minimal pair and Reuland's proposals correctly predict that the A′-movement construction will require less processing effort compared to the hanging topic construction. A self-paced reading study for contrasting pairs as in the above example showed a statistically significant slow-down after the gap with the hanging topic as opposed to the moved nominal. We take this to support the claim that a syntactic A′-chain is more easily processed than an anaphoric dependency involving a null pronoun, which must be resolved by discourse-based mechanisms.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.