Maturation and Learnability in Parametric Systems
- 1 October 1995
- journal article
- Published by Taylor & Francis in Language Acquisition
- Vol. 4 (4) , 277-318
- https://doi.org/10.1207/s15327817la0404_2
Abstract
Recent work in parametric language learning has showed that even very small systems of linguistically plausible parameters pose very serious problems for error-driven and conservative learning algorithms. It has been argued that such problems may be solved by considering that different parameters may become available for reset ring at different times, as an effect of biological maturation. This article presents a general framework for studying the effects of the Maturation Hypothesis on the problem of language learning, parametrically conceived, and offers a general method for finding all maturational solutions (where some exist) for any parametric hypothesis space and any learning algorithm that differs from Gibson and Wexier's TLA only in the number of parameters that can be reset at each step. Implications for research in natural language acquisition are discussed in the concluding section.Keywords
This publication has 11 references indexed in Scilit:
- On The Language InstinctPublished by American Psychological Association (APA) ,1994
- Formalizing Triggers: A Learning Model for Finite SpacesPublished by Defense Technical Information Center (DTIC) ,1993
- Negative evidence in language acquisitionCognition, 1993
- The Selection of Syntactic KnowledgeLanguage Acquisition, 1992
- Null subjects: A problem for parameter-setting models of language acquisitionCognition, 1990
- The Maturation of SyntaxPublished by Springer Nature ,1987
- Language Acquisition and the Theory of ParametersPublished by Springer Nature ,1986
- Formal models of language learningCognition, 1979
- A First LanguagePublished by Harvard University Press ,1973
- Language identification in the limitInformation and Control, 1967