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: 14 December 2018

Abstract and Keywords

Spoken word recognition is the study of how lexical representations are accessed from phonological patterns in the speech signal. That is, we conventionally make two simplifying assumptions: Because many fundamental problems in speech perception remain unsolved, we provisionally assume the input is a string of phonemes that are the output of speech perception processes, and that the output is a string of recognized words that are passed onto mechanisms supporting, for example, sentence processing. These kinds of assumptions allow psycholinguists to break language understanding into manageable research domains, and as we review, they have afforded great progress in understanding spoken word recognition. However, we also review a growing body of results that are incompatible with these assumptions: Spoken word recognition is constrained by subphonemic details and top-down influences from higher level processing. We argue that these findings are incompatible with current theoretical frameworks, and that a new theoretical paradigm is needed.

Keywords: lexical access, computational models, segmentation, embedded word problem, interaction, top-down influences

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.