Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE ( © Oxford University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a title in Oxford Handbooks Online for personal use (for details see Privacy Policy and Legal Notice).

date: 04 June 2020

Abstract and Keywords

This chapter summarizes major results in the domain of experimental approaches to ergativity, focusing on three major topics. First, it discusses studies that explore the competition between accusative and ergative alignment, where researchers have attempted to derive the typological preference for accusative alignment from processing- and learnability based constraints. Next, it examines studies concerning the interrelated issues of long-distance dependencies and agreement. The unique dissociation of case and argument-hood in ergative languages has afforded researchers new means of testing conclusions regarding the privileged grammatical status of subject, the relative import and function of case and agreement in the grammar, and the origins of constraints on extraction in ergative languages and beyond. Given that linguists have only recently begun to conduct experimental research on ergative languages, we conclude by suggesting areas for future research where ergativity might provide genuine insights rather than just replicate existing studies of accusative languages.

Keywords: ergativity, processing, learnability, relative clauses, subject processing advantage, ERP, split ergativity, syntactic ergativity

Access to the complete content on Oxford Handbooks Online requires a subscription or purchase. Public users are able to search the site and view the abstracts and keywords for each book and chapter without a subscription.

Please subscribe or login to access full text content.

If you have purchased a print title that contains an access token, please see the token for information about how to register your code.

For questions on access or troubleshooting, please check our FAQs, and if you can''t find the answer there, please contact us.