maturation and Learnability in Parametric Systems  

Oleh:

Berrtolo, Stefano

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: Language Acquisition: A Journal of Developmental Linguistics (ada di JSTOR) vol. 4 no. 4 (1995), page 277-318.
Fulltext: 20011427.pdf (3.69MB)

Ketersediaan

Perpustakaan PKBB Nomor Panggil: 405/LAA/4 Non-tandon: tidak ada Tandon: 1

Lihat Detail Induk

Isi artikel

Recent work in parametric language learning has showed that even very small systems of linguitically plausible parameters pose very serious problem for error-driven and conservative learning algoritms. It has been argued that such problems may be solved by considering that different parameters may become available for resetting 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, parameterically concieved, 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 Wexler'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.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali