Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE (www.oxfordhandbooks.com). © 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: 20 August 2019

Abstract and Keywords

This article provides a research programme in which typological patterns are ultimately explained in terms of language processing and use. It presents three general organizing principles that describe common patterns in grammars and performance: Minimize Domains, Minimize Forms, and Maximize Online Processing. The first is illustrated with patterns involving relative clauses; the second, with morphological data and markedness hierarchies; and the third, with a number of linear precedence regularities that hold across different language types. The article finally outlines some general issues raised by this approach to linguistic typology, and discusses challenges that remain. It is concluded that typological patterns can be profitably described, predicted, and to a significant extent explained in terms of principles of efficiency and complexity in processing. These principles, individually and in combination, can motivate a broad range of preference data in performance and in grammars.

Keywords: Minimize Domains, Minimize Forms, Maximize Online Processing, typological patterns, language processing, grammars, relative clauses, morphological data, markedness hierarchies

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.