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: 26 February 2020

Abstract and Keywords

This article describes the state of the field since the most recent prominent reviews of grammatical encoding were published about a dozen years ago. It discusses a consensus view of the general architecture of grammatical encoding. This consensus holds that grammatical encoding consists of two component sets of sub-processes, one which deals with content and another which deals with structure. Each set of sub-processes proceeds through two phases or stages, the first involving selection and the second involving retrieval. The article also examines the “incrementality” or “scope” of grammatical encoding, as well as the factors that influence syntactic choice. Finally, it looks forward to emerging debates in the field that are likely to receive increased attention in the coming years, largely due to the confluence of their central questions with other prominent and topical issues in cognitive science. These debates concern the relationship between grammatical encoding and eye movements, working memory, language disorders, and dialogue.

Keywords: grammatical encoding, content, structure, selection, retrieval, incrementality, eye movements, working memory, language disorders, dialogue

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.