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: 21 May 2019

Abstract and Keywords

This chapter draws a distinction between Universal Grammar (the initial state of the computational system that underwrites the human capacity for language) and the Language Acquisition Device (the complex of components of the mind/brain involved in constructing grammar+lexicon pairs upon exposure to primary linguistic data). It then considers whether there are any substantive phonological components of Universal Grammar strictu sensu. Two of the strongest empirical arguments for the existence of such phonological content in UG have been (i) apparent constraints on the space of variation induced from the typological record, and (ii) apparently universal dispreferences against certain phonological configurations (known as markedness). The chapter examines these arguments in the light of recent literature, concluding that the phenomena submit at least as well to historical, phonetic, or other non-UG explanations. We suggest that language acquisition experiments, involving natural and artificial languages, may be a more fruitful domain for future research into these questions.

Keywords: evolutionary phonology, historical linguistics, Language Acquisition Device, markedness, Optimality Theory, Persian, phonology, typology

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.