Open AccessBook
Formal Principles of Language Acquisition
Kenneth Wexler,Peter W. Culicover +1 more
- 01 Jan 1980
1.4K
TL;DR: The authors of this book have developed a rigorous and unified theory that opens the study of language learnability to discoveries about the mechanisms of language acquisition in human beings and has important implications for linguistic theory, child language research, and the philosophy of language.
read more
Abstract: The question of language learnability is central to modern linguistics. Yet, despite its importance, research into the problems of language learnability has rarely gone beyond the informal, commonsense intuitions that currently prevail among linguists and psychologists.By focusing their inquiry on formal language learnability theory--the interface of formal mathematical linguistics, linguistic theory and cognitive psychology--the authors of this book have developed a rigorous and unified theory that opens the study of language learnability to discoveries about the mechanisms of language acquisition in human beings. Their research has important implications for linguistic theory, child language research, and the philosophy of language."Formal Principles of Language Acquisition" develops rigorous mathematical methods for demonstrating the learnability of classes of grammars. It adapts the well-developed theories of transformational grammar to establish psychological motivation for a set of formal constraints on grammars sufficient for learnability. In addition, the research deals with such matters as the complex interaction between the mechanism of language learning and the learning environment, the empirical adequacy of the learnability constraints, feasibility and attainability of classes of grammars, the role of semantics in language learnability, and the adequacy of transformational grammars as models of human linguistic competence.This first serious and extended development of a formal and precise theory of language learnability will interest researchers in psychology and linguistics, and is recommended for use in graduate courses in language acquisition, linguistic theory, psycholinguistics, and mathematical linguistics, as well as interdisciplinary courses that deal with language learning, use, and philosophy.Contents: Methodological Considerations; Foundations of a Theory of Learnability; A Learnability Result for Transformational Grammar; Degree-2 Learnability; Linguistic Evidence for the Learnability Constraints; Function, Performance and Explanations; Further Issues: Linguistic Interaction, Invariance Principle, Open Problems; Notes, Bibliography, Index.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
The Acquisition of Anaphora by Simple Recurrent Networks
TL;DR: This article applies Simple Recurrent Networks to the task of assigning an interpretation to reflexive and pronominal anaphora, a task that demands more refined sensitivity to syntactic structure than has been previously explored.
23
•Journal Article
A Linguistic Basis for Student Difficulties with Algebra.
TL;DR: In this paper, a major component of student difficulty with algebra is the inability to make sense of the algebraic symbol system as a language, and accordingly, remedies should be sought by considering algebra in a linguistic context.
23
•Dissertation
Dimensions of Ellipsis: Investigations in Turkish
Atakan Ince
- 01 Jan 2009
TL;DR: In this article, Atakan Ince examines the elliptical structures of (a) sluicing (John called someone, but I don't know who), (b) fragment answers (A: Who did John call?, B: Mary), (c) gapping (John is eating ice-cream, and Mary apple pie!), and (d) right node raising (John cooked and Mary ate the apple pie!) in Turkish.
On the Complexity of Conclusive Update
Nina Gierasimczuk,Dick de Jongh +1 more
TL;DR: This work focuses on the characterization of finite identifiability, which uses definite finite tell-tale sets, finite subsets of languages which are uniquely characteristic for them, and introduces preset learners, learning functions that explicitly use (collections of) DFTTs, and strict preset learners which in each case use this whole finite collection.
22
Related Papers (5)
Noam Chomsky
- 01 Jan 1981
Eric Wanner,Lila R. Gleitman +1 more
- 16 Sep 2009
John Robert Ross
- 01 Jan 1967
Noam Chomsky
- 01 Jan 1992