One model for the learning of language
Open accessThe DOI matches its Crossref record; 193 of the 193 references it cites were found in a registry or an index.
Abstract
Significance: It has long been hypothesized that language acquisition may be impossible without innate knowledge of the structures that occur in natural language. Here, we show that a domain general learning setup, originally developed in cognitive psychology to model rule learning, is able to acquire key pieces of natural language from relatively few examples of sentences. This develops a new approach to formalizing linguistic learning and highlights some features of language and language acquisition that may arise from general cognitive processes.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Figures





Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This pattern is highly characteristic of more traditional symbolic systems, which also prefer solutions with low description length [63] and have been engineered specifically to ‘refactor’ their representations during training to decrease description length of more general concepts [64].”
From Symbols and grounding in large language models (2023) · cites this paper as [63]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
LeCun, Y., Bengio, Y., & Hinton, G. (2015) · Nature · doi:10.1038/nature14539 · Cited by 84,126
Parallel Distributed Processing: Explorations in the Microstructure of Cognition: Foundations
Rumelhart, D. E., McClelland, J. L., & AU (1986) · doi:10.7551/mitpress/5236.001.0001 · Cited by 15,686
Elman, J. L. (1990) · Cognitive Science · doi:10.1207/s15516709cog1402_1 · Cited by 11,212
Introduction to automata theory, languages and computation
(1981) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(81)90068-9 · Cited by 10,699
Foundations of statistical natural language processing
Manning, C. D., & Schütze, H. (1999) · Cited by 9,816
Chomsky, N. (2014) · The MIT Press eBooks · doi:10.7551/mitpress/9780262527347.001.0001 · Cited by 8,244 · cited 1×
“The functions pair and append are similar in spirit to “merge” in minimalist linguistics (89, 90), except they come with none of the associated machinery that is required in those theories; here, they only concatenate.”
Chomsky, N. (1957) · doi:10.1515/9783112316009 · Cited by 7,885
Statistical learning by 8-month-old infants
Saffran, J. R., Aslin, R. N., & Newport, E. L. (1996) · Science · doi:10.1126/science.274.5294.1926 · Cited by 5,659
The faculty of language: what is it, who has it, and how did it evolve?
Hauser, M. D., Chomsky, N., & Fitch, W. T. (2002) · Science · doi:10.1126/science.298.5598.1569 · Cited by 5,189
Language identification in the limit
Gold, E. M. (1967) · Information and Control · doi:10.1016/s0019-9958(67)91165-5 · Cited by 3,572 · cited 2×
“Perhaps the most influential formal result is Gold’s Theorem (1), which implies that there are classes of even regular languages (2) which contain members that cannot be identified by learners who rely on positive examples alone.”
Valiant, L. G. (1984) · Communications of the ACM · doi:10.1145/1968.1972 · Cited by 3,279
Recent Trends in Deep Learning Based Natural Language Processing [Review Article]
Young, T., Hazarika, D., Poria, S., & Cambria, E. (2018) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2018.2840738 · Cited by 2,921
Distilling Free-Form Natural Laws from Experimental Data
Schmidt, M., & Lipson, H. (2009) · Science · doi:10.1126/science.1165893 · Cited by 2,890
Human-level concept learning through probabilistic program induction
Lake, B. M., Salakhutdinov, R., & Tenenbaum, J. B. (2015) · Science · doi:10.1126/science.aab3050 · Cited by 2,817
Three models for the description of language
Chomsky, N. (1956) · IEEE Transactions on Information Theory · doi:10.1109/tit.1956.1056813 · Cited by 2,796 · cited 2×
“sis is also shown. 3 Learning simple formal languages We rst study the model’s ability to learn several simple formal languages that are motivated by the structures present in natural language. Since Chomsky (1956), numerous authors have attempted to pinpoint what type of computational system supports natural language…”
An Introduction to Symbolic Dynamics and Coding
Lind, D., & Marcus, B. (2021) · Cambridge University Press eBooks · doi:10.1017/9781108899727 · Cited by 2,696
The myth of language universals: Language diversity and its importance for cognitive science
Evans, N., & Levinson, S. C. (2009) · Behavioral and Brain Sciences · doi:10.1017/s0140525x0999094x · Cited by 2,623 · cited 1×
“The view of learners operating over the space of computations can be motivated in language research by the diversity of linguistic constructions that must be acquired (34, 35), including, potentially, languages that lack even context-free syntactic structure (36, 37).”
Building machines that learn and think like people
Lake, B. M., Ullman, T. D., Tenenbaum, J. B., & Gershman, S. J. (2017) · Behavioral and Brain Sciences · doi:10.1017/s0140525x16001837 · Cited by 2,550
Building Machines That Learn and Think Like People
Lake, B. M., Ullman, T. D., Tenenbaum, J. B., & Gershman, S. J. (2016) · arXiv · doi:10.48550/arxiv.1604.00289 · Cited by 2,550
Implicit learning of artificial grammars
Reber, A. S. (1967) · Journal of Verbal Learning and Verbal Behavior · doi:10.1016/s0022-5371(67)80149-x · Cited by 2,026 · cited 3×
“Because of the chosen form of the prior, the model’s inferences are sensitive to description length rather than hierarchy level: Some languages that have short descriptions are higher on the hierarchy (like a n b n c n ), and some languages (like Reber) that are lower on the hierarchy are nonetheless difficult because…”
How to grow a mind: Statistics, structure, and abstraction
Tenenbaum, J. B., Kemp, C., Griffiths, T. L., & Goodman, N. D. (2011) · Science · doi:10.1126/science.1192788 · Cited by 1,815 · cited 1×
“The model thus points to how language acquisition might be unified with learning more broadly in cognition, including the many domains where children also acquire structures and abstraction from statistical evidence (216).”
An Unsolvable Problem of Elementary Number Theory
Church, A. (1936) · American Journal of Mathematics · doi:10.2307/2371045 · Cited by 1,763 · cited 1×
“…features of language and language acquisition that may arise from general cognitive processes. but philosophers, cognitive scientists, and linguists have made a convincing case that compositional representations are natu-ral for capturing human-like thinking (48–52) and computation itself (53–56).”
A formal theory of inductive inference. Part II
Solomonoff, R. J. (1964) · Information and Control · doi:10.1016/s0019-9958(64)90131-7 · Cited by 1,758
The Minimum Description Length Principle
Grünwald, P. D. (2007) · doi:10.7551/mitpress/4643.001.0001 · Cited by 1,644
On certain formal properties of grammars
Chomsky, N. (1959) · Information and Control · doi:10.1016/s0019-9958(59)90362-6 · Cited by 1,588 · cited 1×
“is perspective to learning the structures supporting natural language that was rst presented in Chomsky’s \Three models for the description of language" (Chomsky, 1956; Lees & Chomsky, 1957; Chomsky, 1959). Chomsky noted that many dependencies in natural language could be captured abstractly with fundamentall…”
Steedman, M. (2000) · The MIT Press eBooks · doi:10.7551/mitpress/6591.001.0001 · Cited by 1,585 · cited 1×
“Researchers have also explored formal languages that can be captured with other formalisms, including linear indexed grammars (106), tree-adjoining grammars (107) or combinatory categorial grammars (50).”
Structure and Interpretation of Computer Programs
Abelson, H., Sussman, G. J., & Sussman, J. (1985) · Cited by 1,567
Formal Principles of Language Acquisition
Baker, C. L., Wexler, K., & Culicover, P. W. (1982) · Language · doi:10.2307/414105 · Cited by 1,513 · cited 1×
“Indeed, infinite generalization is contrary to subset-principle accounts (6, 122– 124) that posit learners make only the narrowest generalization possible from data (cf. refs.”
Statistical learning of tone sequences by human infants and adults
Saffran, J. R., Johnson, E. K., Aslin, R. N., & Newport, E. L. (1999) · Cognition · doi:10.1016/s0010-0277(98)00075-4 · Cited by 1,429
An Introduction to Kolmogorov Complexity and Its Applications
Li, M., & Vitányi, P. (2008) · Texts in Computer Science · doi:10.1007/978-0-387-49820-1 · Cited by 1,424 · cited 1×
“Theories of language acquisition would do well to prioritize measures of description length (203, 204) in considering the complexity of hypotheses, bringing such theories in line with experimental work in human learning (59, 88, 131, 205–207).”
Everett, D. L. (2005) · Current Anthropology · doi:10.1086/431525 · Cited by 1,276
Rule Learning by Seven-Month-Old Infants
Marcus, G. F., Vijayan, S., Bandi Rao, S., & Vishton, P. M. (1999) · Science · doi:10.1126/science.283.5398.77 · Cited by 1,244
A Primer on Neural Network Models for Natural Language Processing
Goldberg, Y. (2016) · Journal of Artificial Intelligence Research · doi:10.1613/jair.4992 · Cited by 1,201
A formal theory of inductive inference. Part I
Solomonoff, R. J. (1964) · Information and Control · doi:10.1016/s0019-9958(64)90223-2 · Cited by 1,192
Computation of conditional probability statistics by 8-month-old infants
Aslin, R. N., Saffran, J. R., & Newport, E. L. (1998) · Psychological Science · doi:10.1111/1467-9280.00063 · Cited by 1,189
Graves, A., Wayne, G., & Danihelka, I. (2014) · arXiv · doi:10.48550/arxiv.1410.5401 · Cited by 1,058 · cited 2×
“Ongoing developments in program induction models—such as the ability to reuse components (101), evaluate parital hypotheses (163), work in continuous spaces (164), and apply rich toolkits of programming methods (38)—are likely to help such learning scale.”
Empirical assessment of stimulus poverty arguments
Pullum, G. K., & Scholz, B. C. (2002) · The Linguistic Review · doi:10.1515/tlir.19.1-2.9 · Cited by 919
Inductive Inference: Theory and Methods
Angluin, D., & Smith, C. H. (1983) · ACM Computing Surveys · doi:10.1145/356914.356918 · Cited by 887
(1963) · Cited by 855
Variability and Detection of Invariant Structure
Gómez, R. L. (2002) · Psychological Science · doi:10.1111/1467-9280.00476 · Cited by 840 · cited 1×
“The pattern of generalizations is complex, structured (e.g., with correlations apparent between strings), and highly dependent on which hypothesis is selected, even among those with close posterior probabilities. goes beyond what they directly observe.”
Learning at a distance I. Statistical learning of non-adjacent dependencies
Newport, E. L., & Aslin, R. N. (2004) · Cognitive Psychology · doi:10.1016/s0010-0285(03)00128-2 · Cited by 807 · cited 1×
“As this makes clear, these languages are learnable; similarly, the model is also able to learn the nonadjacent dependencies studied by Newport and Aslin (146), consisting of sentences of the form { bXt , gXd , pXr , kXu , lXi } where X ranges over { 1, 2, 3, 4 } .”
Inductive inference of formal languages from positive data
Angluin, D. (1980) · Information and Control · doi:10.1016/s0019-9958(80)90285-5 · Cited by 745
Zettlemoyer, L., & Collins, M. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1207.1420 · Cited by 728
Core Syntax: A Minimalist Approach
Adger, D. (2003) · doi:10.1093/oso/9780199243709.001.0001 · Cited by 720
Language to Logical Form with Neural Attention
Dong, L., & Lapata, M. (2016) · Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p16-1004 · Cited by 700 · cited 1×
“However, similar program-learning models have been used to acquire compositional representations of semantics (211–214) while operating over larger vocabularies.”
Computational Constraints on Syntactic Processing in a Nonhuman Primate
Fitch, W. T., & Hauser, M. D. (2004) · Science · doi:10.1126/science.1089401 · Cited by 664 · cited 1×
“Although “poverty of the stimulus” arguments are often considered classic and foundational in linguistic theorizing (3, 155– 159), prior reviews (35, 160–162) and theoretical results (28) have been devastating to the hypothesis that learners must be highly constrained in order to ensure that…”
Evidence against the context-freeness of natural language
Shieber, S. M. (1985) · Linguistics and Philosophy · doi:10.1007/bf00630917 · Cited by 655
Finding patterns common to a set of strings
Angluin, D. (1980) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(80)90041-0 · Cited by 616 · cited 1×
“Learnability proofs for certain classes of grammars have also been formulated (9–16), as well as closely related theories of induction in computer science (17–22).”
Church: a language for generative models
Goodman, N., Mansinghka, V., Roy, D. M., Bonawitz, K., & Tenenbaum, J. B. (2012) · arXiv · doi:10.48550/arxiv.1206.3255 · Cited by 577 · cited 3×
“This call may be memo-ized, which means that it remembers any stochastic choices that were made on a previous call with the same arguments (91).”
Negative evidence in language acquisition
Marcus, G. F. (1993) · Cognition · doi:10.1016/0010-0277(93)90022-n · Cited by 550 · cited 1×
“It is worth emphasizing that the assumptions of no negative evidence (173) have been questioned by many language acquisition researchers (161, 174–178).”
Parameters, binding theory and learnability
Manzini, M. R. (1987) · Florence Research (University of Florence) · Cited by 549
Learning Dependency-Based Compositional Semantics
Liang, P., Jordan, M. I., & Klein, D. (2013) · Computational Linguistics · doi:10.1162/coli_a_00127 · Cited by 546
Distributional Information: A Powerful Cue for Acquiring Syntactic Categories
Redington, M., Chater, N., & Finch, S. (1998) · Cognitive Science · doi:10.1207/s15516709cog2204_2 · Cited by 535
Universal Artificial Intellegence
Hutter, M. (2005) · Texts in Theoretical Computer Science An EATCS Series · doi:10.1007/b138233 · Cited by 523
Distributional regularity and phonotactic constraints are useful for segmentation
Brent, M. R., & Cartwright, T. A. (1996) · Cognition · doi:10.1016/s0010-0277(96)00719-6 · Cited by 514 · cited 1×
“This was necessary in order to avoid having to deal with hypotheses that generate infinite sequences (which are possible, although more challenging technically), and also may better match the observation that utterance boundaries provide an important cue in segmentation (136).”
The Acquisition of Syntactic Knowledge
Berwick, R. C. (1985) · The MIT Press eBooks · doi:10.7551/mitpress/1074.001.0001 · Cited by 510 · cited 2×
“Indeed, infinite generalization is contrary to subset-principle accounts (6, 122– 124) that posit learners make only the narrowest generalization possible from data (cf. refs.”
Learning the structure of event sequences.
Cleeremans, A., & McClelland, J. L. (1991) · Journal of Experimental Psychology: General · doi:10.1037/0096-3445.120.3.235 · Cited by 504 · cited 1×
“Reber’s was constructed to provide a learnable but nontrivial set of strings, and both it and similar languages have been modeled with neural networks (151, 152), as well as models based on chunking (153).”
Simplicity: a unifying principle in cognitive science?
Chater, N., & Vitányi, P. (2003) · Trends in Cognitive Sciences · doi:10.1016/s1364-6613(02)00005-0 · Cited by 494 · cited 5×
“” In this study, we consider a learning model that, like the one of Chater and Vitányi (2007), builds in a space of all computations.”
BackgroundMethodInfluentialHow Efficiency Shapes Human Language
Gibson, E., Futrell, R., Piantadosi, S. P., Dautriche, I., Mahowald, K., Bergen, L., & Levy, R. (2019) · Trends in Cognitive Sciences · doi:10.1016/j.tics.2019.02.003 · Cited by 485 · cited 1×
“Importantly, however, we do not take the model as making typological predictions, mainly because there are many other pressures that factor into the form of languages beyond structural biases, including considerations of communicative usefulness (131, 132).”
Self-citationMinimization of Boolean complexity in human concept learning
Feldman, J. (2000) · Nature · doi:10.1038/35036586 · Cited by 478 · cited 1×
“Indeed, theories of inductive inference centered on compositionality provide good fits to human learning curves across domains (57–61).”
A rational analysis of rule-based concept learning
Goodman, N. D., Tenenbaum, J. B., Feldman, J., & Griffiths, T. L. (2008) · Cognitive Science · doi:10.1080/03640210701802071 · Cited by 469 · cited 1×
“Notably, the Fleet implementation includes examples in other domains outside language, such as number learning (73) and logical rule induction (58), demonstrating the generality of the approach.”
Adult reformulations of child errors as negative evidence
CHOUINARD, M. M., & CLARK, E. V. (2003) · Journal of Child Language · doi:10.1017/s0305000903005701 · Cited by 460 · cited 1×
“It is worth emphasizing that the assumptions of no negative evidence (173) have been questioned by many language acquisition researchers (161, 174–178).”
Clark, E. V. (2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511806698 · Cited by 460
Finite State Automata and Simple Recurrent Networks
Cleeremans, A., Servan-Schreiber, D., & McClelland, J. L. (1989) · Neural Computation · doi:10.1162/neco.1989.1.3.372 · Cited by 458 · cited 2×
“Reber’s was constructed to provide a learnable but nontrivial set of strings, and both it and similar languages have been modeled with neural networks (151, 152), as well as models based on chunking (153).”
Getting it right by getting it wrong: When learners change languages
Hudson Kam, C. L., & Newport, E. L. (2009) · Cognitive Psychology · doi:10.1016/j.cogpsych.2009.01.001 · Cited by 453
Poverty of the Stimulus Revisited
Berwick, R. C., Pietroski, P., Yankama, B., & Chomsky, N. (2011) · Cognitive Science · doi:10.1111/j.1551-6709.2011.01189.x · Cited by 447 · cited 1×
“…Perfors et al. has been to emphasize linguistic facts that go beyond the mere presence of hierarchical structure, often depending on subtle distinctions and connections between constructions or interpretations (157), although Bayesian models have shown success in learning some such phenomena (186).”
A Bayesian framework for word segmentation: Exploring the effects of context
Goldwater, S., Griffiths, T. L., & Johnson, M. (2009) · Cognition · doi:10.1016/j.cognition.2009.03.008 · Cited by 431 · cited 1×
“137.”
Parameters and Learnability in Binding Theory
Wexler, K., & Manzini, M. R. (1987) · Studies in Theoretical Psycholinguistics · doi:10.1007/978-94-009-3727-7_3 · Cited by 425 · cited 1×
“Ahugebodyof literature has been dedicated to articulating and critiquing the subset problem of how it is that learners who use only positive evidence can avoid arriving at an overly general grammar (122, 125, 159, 165–170).”
Toward a connectionist model of recursion in human linguistic performance
Christiansen, M. (1999) · Cognitive Science · doi:10.1016/s0364-0213(99)00003-8 · Cited by 406
Learning artificial grammars with competitive chunking.
Servan-Schreiber, E., & Anderson, J. R. (1990) · Journal of Experimental Psychology: Learning, Memory, and Cognition · doi:10.1037//0278-7393.16.4.592 · Cited by 400 · cited 1×
“Reber’s was constructed to provide a learnable but nontrivial set of strings, and both it and similar languages have been modeled with neural networks (151, 152), as well as models based on chunking (153).”
SCADS: A Model of Children's Strategy Choices and Strategy Discoveries
Shrager, J., & Siegler, R. S. (1998) · Psychological Science · doi:10.1111/1467-9280.00076 · Cited by 393
Learning and Extracting Finite State Automata with Second-Order Recurrent Neural Networks
Giles, C. L., Miller, C. B., Chen, D., Chen, H. H., Sun, G. Z., & Lee, Y. C. (1992) · Neural Computation · doi:10.1162/neco.1992.4.3.393 · Cited by 392
The Developmental Trajectory of Nonadjacent Dependency Learning
Gómez, R., & Maye, J. (2005) · Infancy · doi:10.1207/s15327078in0702_4 · Cited by 310 · cited 1×
“Work by Gómez (144) and Gómez and Maye (145) has examined languages of the form aXb where the number of possible X elements varied.”
Grammatical Inference: Learning Automata and Grammars
de la Higuera, C. (2010) · Cambridge University Press eBooks · doi:10.1017/cbo9781139194655 · Cited by 310
Dynamic temperature selection for parallel tempering in Markov chain Monte Carlo simulations
Vousden, W. D., Farr, W. M., & Mandel, I. (2016) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/stv2422 · Cited by 309
A multiple process solution to the logical problem of language acquisition
MACWHINNEY, B. (2004) · Journal of Child Language · doi:10.1017/s0305000904006336 · Cited by 297 · cited 1×
“…“poverty of the stimulus” arguments are often considered classic and foundational in linguistic theorizing (3, 155– 159), prior reviews (35, 160–162) and theoretical results (28) have been devastating to the hypothesis that learners must be highly constrained in order to ensure that language…”
Aural Pattern Recognition Experiments and the Subregular Hierarchy
Rogers, J., & Pullum, G. K. (2011) · Journal of Logic, Language and Information · doi:10.1007/s10849-011-9140-2 · Cited by 290 · cited 2×
“Several other interesting examples are also shown (GoldenMean, Count(a, x )≥ 2, Count(a, x ) is even, aba, (a∗)(ba∗)+, (a)(ba)), including those which distinguish other classes (103).”
The Poverty of the Stimulus Argument
Laurence, S., & Margolis, E. (2001) · The British Journal for the Philosophy of Science · doi:10.1093/bjps/52.2.217 · Cited by 286
The Tractable Cognition Thesis
Van Rooij, I. (2008) · Cognitive Science · doi:10.1080/03640210801897856 · Cited by 285 · cited 1×
“This model provides an inferential foundation onto which psychological or linguistic constraints—perhaps including pressures in memory or computational limitations (215)—can be added in order to refine debates about what resources learners must necessarily bring to language acquisition.”
The learnability of abstract syntactic principles
Perfors, A., Tenenbaum, J. B., & Regier, T. (2011) · Cognition · doi:10.1016/j.cognition.2010.11.001 · Cited by 285 · cited 1×
“(27), who compared different grammars—for example, finite, finite state, and context-free—and showed that a small amount of childdirected speech from the CHILDES project (185) was sufficient for learners to infer that language had a hierarchical structure.”
Morgan, J. L., Meier, R. P., & Newport, E. L. (1987) · Cognitive Psychology · doi:10.1016/0010-0285(87)90017-x · Cited by 284 · cited 2×
“3, and has been examined in several empirical studies (142, 143).”
Kinship Categories Across Languages Reflect General Communicative Principles
Kemp, C., & Regier, T. (2012) · Science · doi:10.1126/science.1218811 · Cited by 284
The Use of Predictive Dependencies in Language Learning
Saffran, J. R. (2001) · Journal of Memory and Language · doi:10.1006/jmla.2000.2759 · Cited by 267
A rational account of pedagogical reasoning: Teaching by, and learning from, examples
Shafto, P., Goodman, N. D., & Griffiths, T. L. (2014) · Cognitive Psychology · doi:10.1016/j.cogpsych.2013.12.004 · Cited by 264 · cited 1×
“Our general model could easily be made compatible with positive evidence, or even other forms, including pedagogical evidence, as has been examined in similar statistical setups (179).”
The equivalence of four extensions of context-free grammars
Vijay-Shanker, K., & Weir, D. J. (1994) · Mathematical Systems Theory · doi:10.1007/bf01191624 · Cited by 260 · cited 1×
“Researchers have also explored formal languages that can be captured with other formalisms, including linear indexed grammars (106), tree-adjoining grammars (107) or combinatory categorial grammars (50).”
The Contrast Theory of negative input
SAXTON, M. (1997) · Journal of Child Language · doi:10.1017/s030500099600298x · Cited by 238
Lambda-Calculus and Combinators, an Introduction
Hindley, J. R., & Seldin, J. P. (2008) · Cambridge University Press eBooks · doi:10.1017/cbo9780511809835 · Cited by 237
On learning the grammatical order of words.
Braine, M. D. S. (1963) · Psychological Review · doi:10.1037/h0047696 · Cited by 236 · cited 4×
“Severallanguages(e.g.,Braine66)introducednonuniformsentence probabilitiesintotheoriginalgrammar.”
InfluentialAn Introduction to Tree Adjoining Grammar
Joshi, A. K. (1987) · Mathematics of Language · doi:10.1075/z.35.07jos · Cited by 231 · cited 1×
“Researchers have also explored formal languages that can be captured with other formalisms, including linear indexed grammars (106), tree-adjoining grammars (107) or combinatory categorial grammars (50).”
Mechanisms of Implicit Learning: Connectionist Models of Sequence Processing
Cleeremans, A. (1993) · The MIT Press eBooks · doi:10.7551/mitpress/4528.001.0001 · Cited by 231
Syntactic Structures Revisited: Contemporary Lectures on Classic Transformational Theory
Lasnik, H. (2000) · The MIT Press eBooks · doi:10.7551/mitpress/6592.001.0001 · Cited by 222
Formal language theory: refining the Chomsky hierarchy
Jäger, G., & Rogers, J. (2012) · Philosophical Transactions of the Royal Society B: Biological Sciences · doi:10.1098/rstb.2012.0077 · Cited by 209 · cited 2×
“Although the applicability of such examples to natural language is often contested (66), the study of such formal languages has provided a fertile ground for linguistics (67) to characterize what computations underlie human language (2, 39, 62, 63).”
An Introduction to Combinators and the (lambda)-calculus
Hindley, J. R., & Seldin, J. P. (1986) · Cited by 208
Goldberg, A. E., & Suttle, L. (2010) · Wiley Interdisciplinary Reviews Cognitive Science · doi:10.1002/wcs.22 · Cited by 206 · cited 1×
“While this model provides a theoretical proposal for learning the patterns that govern sequences of discrete symbols, it is important to remember that real-life language learning is closely tied to language use (208–210), including semantics, pragmatics, and social inference.”
Muggleton, S. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-63494-0_65 · Cited by 204 · cited 1×
“We note the similarity between these primitives and others used in modeling human conceptual systems (59, 61, 73, 74, 76, 78, 91, 100).”
The usage-based theory of language acquisition
Tomasello, M. (2012) · The Cambridge Handbook of Child Language · doi:10.1017/cbo9780511576164.005 · Cited by 203
Tabor, W., Juliano, C., & Tanenhaus, M. K. (1997) · Language and Cognitive Processes · doi:10.1080/016909697386853 · Cited by 198
Amalric, M., Wang, L., Pica, P., Figueira, S., Sigman, M., & Dehaene, S. (2017) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1005273 · Cited by 196 · cited 1×
“We note the similarity between these primitives and others used in modeling human conceptual systems (59, 61, 73, 74, 76, 78, 91, 100).”
Natural languages and context-free languages
Pullum, G. K., & Gazdar, G. (1982) · Linguistics and Philosophy · doi:10.1007/bf00360802 · Cited by 195
The role of constituent structure in the induction of an artificial language
Morgan, J. L., & Newport, E. L. (1981) · Journal of Verbal Learning and Verbal Behavior · doi:10.1016/s0022-5371(81)90312-1 · Cited by 188 · cited 4×
“(142), a finite set of strings consisting of all valid English words with “m,” “a,” and” n” (e.g., “man, am, an, a, mam”), a finite state machine for English auxiliaries from Berwick and Pilato (150), the QAXB grammar from Reeder et al. (154), a grammar modified from Hudson Kam and Newport (219), a finite language fro…”
InfluentialThe Simplicity Principle in Human Concept Learning
Feldman, J. (2003) · Current Directions in Psychological Science · doi:10.1046/j.0963-7214.2003.01267.x · Cited by 187
Bootstrapping in a language of thought: A formal model of numerical concept learning
Piantadosi, S. T., Tenenbaum, J. B., & Goodman, N. D. (2012) · Cognition · doi:10.1016/j.cognition.2011.11.005 · Cited by 183 · cited 2×
“Notably, the Fleet implementation includes examples in other domains outside language, such as number learning (73) and logical rule induction (58), demonstrating the generality of the approach.”
Self-citationThe logical primitives of thought: Empirical foundations for compositional cognitive models.
Piantadosi, S. T., Tenenbaum, J. B., & Goodman, N. D. (2016) · Psychological Review · doi:10.1037/a0039980 · Cited by 178 · cited 2×
“Thus, P(H ) implements a simplicity preference just as in induction of Turing machines (28–31), although the question of precisely which simplicity measure is psychologically accurate is an empirical one (63), and one which has been examined in closely related domains (59).”
Self-citationSome decidability results on grammatical inference and complexity
Feldman, J. (1972) · Information and Control · doi:10.1016/s0019-9958(72)90424-x · Cited by 176 · cited 1×
“In situations where some of Gold’s assumptions are altered, learnability can be established under less antagonistic assumptions (22, 25–27).”
The Selection of Syntactic Knowledge
Clark, R. (1992) · Language Acquisition · doi:10.1207/s15327817la0202_1 · Cited by 173
Recent advances of grammatical inference
Sakakibara, Y. (1997) · Theoretical Computer Science · doi:10.1016/s0304-3975(97)00014-5 · Cited by 170
Parsing Beyond Context-Free Grammars
Kallmeyer, L. (2010) · Cognitive technologies · doi:10.1007/978-3-642-14846-0 · Cited by 162 · cited 1×
“A considerable amount of effort has gone toward understanding whether natural language can be captured entirely by context-free grammars or other systems (66, 68–70), or how non–context-free aspects may be handled (71), although many arguments that have been made are inadequate technically (72).”
A Bayesian framework for concept learning
Tenenbaum, J. B. (1999) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 158
Reeder, P. A., Newport, E. L., & Aslin, R. Ν. (2012) · Cognitive Psychology · doi:10.1016/j.cogpsych.2012.09.001 · Cited by 148
What exactly is Universal Grammar, and has anyone seen it?
Dąbrowska, E. (2015) · Frontiers in Psychology · doi:10.3389/fpsyg.2015.00852 · Cited by 148 · cited 1×
“The view of learners operating over the space of computations can be motivated in language research by the diversity of linguistic constructions that must be acquired (34, 35), including, potentially, languages that lack even context-free syntactic structure (36, 37).”
The Finiteness of Natural Language
Reich, P. A. (1969) · Language · doi:10.2307/412337 · Cited by 130 · cited 1×
“Although the applicability of such examples to natural language is often contested (66), the study of such formal languages has provided a fertile ground for linguistics (67) to characterize what computations underlie human language (2, 39, 62, 63).”
A language learning model for finite parameter spaces
Niyogi, P., & Berwick, R. C. (1996) · Cognition · doi:10.1016/s0010-0277(96)00718-4 · Cited by 130
The complexity of the vocabulary of Bambara
Culy, C. (1985) · Linguistics and Philosophy · doi:10.1007/bf00630918 · Cited by 126
Abeillé, A., Hemforth, B., Winckel, E., & Gibson, E. A. F. (2020) · Cognition · doi:10.1016/j.cognition.2020.104293 · Cited by 122
The Algebraic Theory of Context-Free Languages
Chomsky, N., & Schützenberger, M. P. (1959) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(09)70104-1 · Cited by 117
Pearl, L., & Sprouse, J. (2013) · Language Acquisition · doi:10.1080/10489223.2012.738742 · Cited by 115 · cited 1×
“This work leaves open the question of how more-detailed kinds of phenomena may be acquired—for instance, long-distance dependencies in syntactic islands (180, 181).”
‘Ideal learning’ of natural language: Positive results about learning from positive evidence
Chater, N., & Vitányi, P. (2007) · Journal of Mathematical Psychology · doi:10.1016/j.jmp.2006.10.002 · Cited by 113 · cited 4×
“In this study, we consider a learning model that, like the one of Chater and Vit´anyi (2007), builds in a space of all computations .”
BackgroundMethodInfluentialGödel Machines: Fully Self-referential Optimal Universal Self-improvers
Schmidhuber, J. (2007) · Cognitive Technologies · doi:10.1007/978-3-540-68677-4_7 · Cited by 110 · cited 2×
“In addition, the model considers all possible computations as hypotheses that a learner might entertain, following on similar theories showing how such an approach could work in artificial intelligence and general inductive reasoning (29–33).”
A theory of memory for binary sequences: Evidence for a mental compression algorithm in humans
Planton, S., van Kerkoerle, T., Abbih, L., Maheu, M., Meyniel, F., Sigman, M., Wang, L., Figueira, S. D., Romano, S., & Dehaene, S. (2021) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1008598 · Cited by 104 · cited 2×
“Theories of language acquisition would do well to prioritize measures of description length (203, 204) in considering the complexity of hypotheses, bringing such theories in line with experimental work in human learning (59, 88, 131, 205–207).”
6. Recursion and the infinitude claim
Pullum, G. K., & Scholz, B. C. (2010) · Mouton eBooks · doi:10.1515/9783110219258.111 · Cited by 102 · cited 1×
“One of the most striking properties of natural language is that there are infinitely many sentences of valid, grammatical English (though see Pullum & Scholz, 2010).”
BackgroundRecursive sequence generation in monkeys, children, U.S. adults, and native Amazonians
Ferrigno, S., Cheyette, S., Piantadosi, S. T., & Cantlon, J. F. (2020) · Science Advances · doi:10.1126/sciadv.aaz1002 · Cited by 101 · cited 1×
“Both are context-free, and versions of them have been examined in recent experimental work (104, 105).”
Self-citationProductivity and Reuse in Language: A Theory of Linguistic Computation and Storage
O’Donnell, T. J. (2015) · Project Muse (Johns Hopkins University) · Cited by 100
The Subset Principle in syntax: costs of compliance
Fodor, J. D., & Sakas, W. G. (2005) · Journal of Linguistics · doi:10.1017/s0022226705003439 · Cited by 100 · cited 1×
“125 and 126).”
Levinson, S. C. (2013) · Language · doi:10.1353/lan.2013.0005 · Cited by 98 · cited 1×
“This use of recursion is meant to be domain general, as humans deal with recursion outside of syntax, like pragmatics (96), and even outside language (97–99).”
Conversational Repair and the Acquisition of Language
Clark, E. V. (2020) · Discourse Processes · doi:10.1080/0163853x.2020.1719795 · Cited by 97
The Formal Complexity of Natural Language
Savitch, W. J., Bach, E., Marsh, W., & Safran-Naveh, G. (1987) · Studies in linguistics and philosophy · doi:10.1007/978-94-009-3401-6 · Cited by 93
Theory learning as stochastic search in the language of thought
Ullman, T. D., Goodman, N. D., & Tenenbaum, J. B. (2012) · Cognitive Development · doi:10.1016/j.cogdev.2012.07.005 · Cited by 91
Production of Supra-regular Spatial Sequences by Macaque Monkeys
Jiang, X., Long, T., Cao, W., Li, J., Dehaene, S., & Wang, L. (2018) · Current Biology · doi:10.1016/j.cub.2018.04.047 · Cited by 89 · cited 1×
“Both are context-free, and versions of them have been examined in recent experimental work (104, 105).”
Effective Bayesian Inference for Stochastic Programs
Koller, D., McAllester, D., & Pfeffer, A. (1997) · Cited by 88
RNNs can generate bounded hierarchical languages with optimal memory
Hewitt, J., Hahn, M., Ganguli, S., Liang, P., & Manning, C. D. (2020) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2020.emnlp-main.156 · Cited by 86
Learning the positions of words relative to a marker element.
Braine, M. D. S. (1966) · Journal of Experimental Psychology · doi:10.1037/h0023763 · Cited by 83 · cited 2×
“Severallanguages(e.g.,Braine66)introducednonuniformsentence probabilitiesintotheoriginalgrammar.”
A Corpus Investigation of Syntactic Embedding in Pirahã
Futrell, R., Stearns, L., Everett, D. L., Piantadosi, S. T., & Gibson, E. A. F. (2016) · PLoS ONE · doi:10.1371/journal.pone.0145289 · Cited by 83 · cited 3×
“Alternatively, learners might even consider as statistical hypotheses that language was finite or infinite, as suggested by the purportedly finite languages in existence like Pirahã (36, 37).”
Self-citationVarieties of crossing dependencies: structure dependence and mild context sensitivity
Stabler, E. P. (2004) · Cognitive Science · doi:10.1207/s15516709cog2805_4 · Cited by 80
Distributional Language Learning: Mechanisms and Models of Category Formation
Aslin, R. Ν., & Newport, E. L. (2014) · Language Learning · doi:10.1111/lang.12074 · Cited by 79 · cited 1×
“Such success shows how processes like segmentation, lexical learning, and syntactic category learning may all fall under the same umbrella (138).”
Gold's Theorem and Cognitive Science
Johnson, K. (2004) · Philosophy of Science · doi:10.1086/423752 · Cited by 77 · cited 1×
“However, Gold’s negative learnability result is not widely accepted as relevant to human language (13, 23, 24).”
GRAMMATICAL COMPLEXITY AND INFERENCE
Feldman, J. A., Gips, J., Horning, J. J., & Reder, S. (1969) · Defense Technical Information Center (DTIC) · doi:10.21236/ad0692390 · Cited by 71
Learning Regular Languages from Simple Positive Examples
Denis, F. (2001) · Machine Learning · doi:10.1023/a:1010826628977 · Cited by 69
Kwiatkowski, T., Goldwater, S. J., Zettlemoyer, L., & Steedman, M. J. (2012) · Cited by 69
Hsu, A., Chater, N., & Vitanyi, P. M. B. (2011) · Cognition · doi:10.1016/j.cognition.2011.02.013 · Cited by 69 · cited 2×
“The goal of finding concise computational descriptions can likely be applied to other levels of linguistic representation, including part of speech categories or phonemes, where the relevant abstractions are thought to provide simple descriptions of apparent patterns.”
Rule, J. S., Tenenbaum, J. B., & Piantadosi, S. T. (2020) · Trends in Cognitive Sciences · doi:10.1016/j.tics.2020.07.005 · Cited by 68 · cited 2×
“Ongoing developments in program induction models—such as the ability to reuse components (101), evaluate parital hypotheses (163), work in continuous spaces (164), and apply rich toolkits of programming methods (38)—are likely to help such learning scale.”
Self-citationLearning Syntax by Automata Induction
Berwick, R. C., & Pilato, S. (1987) · Machine Learning · doi:10.1007/bf00058753 · Cited by 67 · cited 4×
“2 also shows learning curves for finite state languages examined by Reber (149) and Berwick and Pilato (150), which are described in Fig.”
InfluentialWrite, Execute, Assess: Program Synthesis with a REPL
Ellis, K., Nye, M., Pu, Y., Sosa, F., Tenenbaum, J., & Solar-Lezama, A. (2019) · arXiv · doi:10.48550/arxiv.1906.04604 · Cited by 65 · cited 1×
“Ongoing developments in program induction models—such as the ability to reuse components (101), evaluate parital hypotheses (163), work in continuous spaces (164), and apply rich toolkits of programming methods (38)—are likely to help such learning scale.”
English is Not a Context-Free Language
Higginbotham, J. (1984) · Studies in linguistics and philosophy · doi:10.1007/978-94-009-3401-6_13 · Cited by 63 · cited 1×
“A considerable amount of effort has gone toward understanding whether natural language can be captured entirely by context-free grammars or other systems (66, 68–70), or how non–context-free aspects may be handled (71), although many arguments that have been made are inadequate technically (72).”
Lai, J., & Poletiek, F. H. (2010) · Cognition · doi:10.1016/j.cognition.2010.11.011 · Cited by 62 · cited 2×
“A wealth research has sought to understand human of learning center-embedded recursion structure (Fitch & Hauser, 2004; Lai & Poletiek, 2011, 2013).”
BackgroundA mathematical theory of learning transformational grammar
Hamburger, H., & Wexler, K. N. (1975) · Journal of Mathematical Psychology · doi:10.1016/0022-2496(75)90055-3 · Cited by 58
Lambda-Calculus and Combinators in the 20th Century
Cardone, F., & Hindley, J. R. (2009) · Handbook of the history of logic · doi:10.1016/s1874-5857(09)70018-4 · Cited by 56
Chinese number-names, tree adjoining languages, and mild context-sensitivity
Radzinski, D. (1991) · OLAC - Open Language Archives Community · doi:10.5555/971764.971766 · Cited by 56
The Computational Origin of Representation
Piantadosi, S. T. (2021) · Minds and Machines · doi:10.1007/s11023-020-09540-9 · Cited by 56 · cited 1×
“…features of language and language acquisition that may arise from general cognitive processes. but philosophers, cognitive scientists, and linguists have made a convincing case that compositional representations are natu-ral for capturing human-like thinking (48–52) and computation itself (53–56).”
Self-citationThe Logical Problem of Language Acquisition: A Probabilistic Perspective
Hsu, A., & Chater, N. (2010) · Cognitive Science · doi:10.1111/j.1551-6709.2010.01117.x · Cited by 54 · cited 2×
“The goal of finding concise computational descriptions can likely be applied to other levels of linguistic representation, including part of speech categories or phonemes, where the relevant abstractions are thought to provide simple descriptions of apparent patterns.”
Yildirim, I., & Jacobs, R. A. (2012) · Cognition · doi:10.1016/j.cognition.2012.08.005 · Cited by 54 · cited 1×
“…Tenenbaum, & Goodman, 2012; Goodman & Tenenbaum, 2014; Piantadosi, 2011; Piantadosi, Tenenbaum, & Goodman, 2016; Piantadosi & Jacobs, 2016; Yildirim & Jacobs, 2013), we define a set of operations that compose and have learners consider all compositions of these operations as possible hypotheses.”
BackgroundIcard, T. (2019) · Mind · doi:10.1093/mind/fzz065 · Cited by 52 · cited 1×
“Both flip and sample are notable in that they are stochastic, allowing nondeterminism in the program (91, 92), an ability that is possibly itself useful for organisms with finite memory (93).”
Three Learnable Models for the Description of Language
Clark, A. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13089-2_2 · Cited by 49
People Infer Recursive Visual Concepts from Just a Few Examples
Lake, B. M., & Piantadosi, S. T. (2019) · Computational Brain & Behavior · doi:10.1007/s42113-019-00053-y · Cited by 49
Self-citationFour Problems Solved by the Probabilistic Language of Thought
Piantadosi, S. T., & Jacobs, R. A. (2016) · Current Directions in Psychological Science · doi:10.1177/0963721415609581 · Cited by 47 · cited 1×
“This develops a new approach to formalizing linguistic learning and highlights some features of language and language acquisition that may arise from general cognitive processes. but philosophers, cognitive scientists, and linguists have made a convincing case that compositional representations are…”
Self-citationLearning Libraries of Subroutines for Neurally–Guided Bayesian Program Induction
Ellis, K., Morales, L., Sablé-Meyer, M., Solar-Lezama, A., & Tenenbaum, J. B. (2018) · neural information processing systems · Cited by 44
Discovering Solutions with Low Kolmogorov Complexity and High Generalization Capability
Schmidhuber, J. (1995) · Elsevier eBooks · doi:10.1016/b978-1-55860-377-6.50067-0 · Cited by 43
Bootstrap Learning via Modular Concept Discovery
Dechter, E., Malmaud, J., Adams, R. P., & Tenenbaum, J. B. (2014) · Cited by 43
Question Asking as Program GenerationPreprint
Rothe, A., Lake, B. M., & Gureckis, T. M. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1711.06351 · Cited by 42
Identification in the limit of categorial grammars
Kanazawa, M. (1996) · Journal of Logic Language and Information · doi:10.1007/bf00173697 · Cited by 41
Boeckx, C. A. (2007) · Language and Linguistics Compass · doi:10.1111/j.1749-818x.2007.00043.x · Cited by 41 · cited 1×
“This work leaves open the question of how more-detailed kinds of phenomena may be acquired—for instance, long-distance dependencies in syntactic islands (180, 181).”
Humans store about 1.5 megabytes of information during language acquisition
Mollica, F., & Piantadosi, S. T. (2019) · Royal Society Open Science · doi:10.1098/rsos.181393 · Cited by 40 · cited 1×
“This accords with the small estimates of the total information required for syntax (117) and highlights that, even though the hypothesis space is large, that doesn’t mean that huge amounts of data will be required.”
Self-citationPoverty of the Stimulus Without Tears
Pearl, L. (2021) · Language Learning and Development · doi:10.1080/15475441.2021.1981908 · Cited by 40
Investigating Recursion Within a Domain-Specific Framework
Martins, M. J. D., & Fitch, W. T. (2013) · Springer eBooks · doi:10.1007/978-1-4614-9414-0_2 · Cited by 39 · cited 1×
“This use of recursion is meant to be domain general, as humans deal with recursion outside of syntax, like pragmatics (96), and even outside language (97–99).”
On the Semantics of the Subset Principle
Musolino, J. (2006) · Language Learning and Development · doi:10.1207/s15473341lld0203_3 · Cited by 39
Erdogan, G., Yildirim, I., & Jacobs, R. A. (2015) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1004610 · Cited by 37
On the Insufficiency of Surface Data for the Learning of Transformational Languages
Wexler, K. N., & Hamburger, H. (1973) · Springer eBooks · doi:10.1007/978-94-010-2506-5_6 · Cited by 33
Yildirim, I., & Jacobs, R. A. (2014) · Psychonomic Bulletin & Review · doi:10.3758/s13423-014-0734-y · Cited by 31
Acquisition of Children's Addition Strategies: A Model of Impasse-Free, Knowledge-Level Learning
Jones, R. M., & VanLehn, K. A. (1994) · Machine Learning · doi:10.1007/bf00993172 · Cited by 31 · cited 1×
“This has been documented in, for instance, mathematics, where children successively revise algorithms they use for arithmetic (40–43).”
Why it might pay to assume that languages are infinite
Savitch, W. J. (1993) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf02451546 · Cited by 30 · cited 1×
“The model shows that a is easier to learn than a(1,2,3) or a(1,2,3,4), and this is because the infinite language has a simpler description, matching prior theoretical analysis (127).”
Learning trees from strings: a strong learning algorithm for some context-free grammars
Clark, A. (2013) · Journal of Machine Learning Research · Cited by 28
Chinese numbers, MIX, scrambling, and range concatenation grammars
Boullier, P. (1999) · Conference of the European Chapter of the Association for Computational Linguistics · doi:10.3115/977035.977044 · Cited by 27 · cited 2×
“64; the ChineseNumeral language { ab n 1 ab n 2 . . . ab n k : n i > n n +1 } has been discussed previously as a model of numerals in Chinese (109, 110) and a motivating example for range concatenation grammars.”
A dynamical systems perspective on the relationship between symbolic and non-symbolic computation
Tabor, W. (2009) · Cognitive Neurodynamics · doi:10.1007/s11571-009-9099-8 · Cited by 25
Language acquisition and the Subset Principle
MacLaughlin, D. M. (1995) · The Linguistic Review · doi:10.1515/tlir.1995.12.2.143 · Cited by 25
Three Myths from the Language Acquisition Literature
Schoneberger, T. (2010) · The Analysis of Verbal Behavior · doi:10.1007/bf03393086 · Cited by 23
Computational Learning Theory and Language Acquisition
Clark, A., & Lappin, S. (2012) · Elsevier eBooks · doi:10.1016/b978-0-444-51747-0.50013-5 · Cited by 22 · cited 1×
“However, Gold’s negative learnability result is not widely accepted as relevant to human language (13, 23, 24).”
Infinitely productive language can arise from chance under communicative pressure
Piantadosi, S. T., & Fedorenko, E. (2017) · Journal of Language Evolution · doi:10.1093/jole/lzw013 · Cited by 22 · cited 1×
“This shows that languages with infinite cardinality may result from core infernetial properties of a computationally sophisticated learner (see also Piantadosi & Fedorenko, 2017).”
BackgroundSelf-citationHow “small” is “starting small” for learning hierarchical centre-embedded structures?
Lai, J., & Poletiek, F. H. (2013) · Journal of Cognitive Psychology · doi:10.1080/20445911.2013.779247 · Cited by 21 · cited 1×
“A wealth research has sought to understand human of learning center-embedded recursion structure (Fitch & Hauser, 2004; Lai & Poletiek, 2011, 2013).”
BackgroundContext-freeness and the computer processing of human languages
Pullum, G. K. (1983) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.3115/981311.981313 · Cited by 21 · cited 1×
“This language might be more easily learnable with other operations like “scrambling” (130) but is difficult to express with our assumed primitives.”
Towards General Algorithms for Grammatical Inference
Clark, A. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-16108-7_2 · Cited by 21
Learning list concepts through program inductionPreprint
Rule, J., Schulz, E., Piantadosi, S. T., & Tenenbaum, J. B. (2018) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/321505 · Cited by 21
Self-citationComplexity in Language Acquisition
Clark, A., & Lappin, S. (2013) · Topics in Cognitive Science · doi:10.1111/tops.12001 · Cited by 20 · cited 2×
“Learnability analyses have too often ignored these issues and conflated the class which can practically be learned with the total hypothesis space (160).”
Calibrating generative models: The probabilistic Chomsky–Schützenberger hierarchy
Icard, T. (2020) · Journal of Mathematical Psychology · doi:10.1016/j.jmp.2019.102308 · Cited by 19 · cited 1×
“We note that the classical Chomsky hierarchy no longer directly applies to formal languages in this probabilistic setting (94, 95).”
Parameters, Binding Theory and learnability
Manzini, M. R., & Wexler, K. N. (1987) · Florence Research (University of Florence) · Cited by 19
Bayesian validation of grammar productions for the language of thought
Romano, S., Salles, A., Amalric, M., Dehaene, S., Sigman, M., & Figueira, S. D. (2018) · PLoS ONE · doi:10.1371/journal.pone.0200420 · Cited by 17
Identification in the Limit of Substitutable Context-Free Languages
Clark, A., & Eyraud, R. (2005) · Lecture notes in computer science · doi:10.1007/11564089_23 · Cited by 16
Solving Bongard Problems with a Visual Language and Pragmatic ReasoningPreprint
Depeweg, S., Rothkopf, C. A., & Jäkel, F. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1804.04452 · Cited by 16
Probabilistic Grammars and Languages
Kornai, A. (2011) · Journal of Logic Language and Information · doi:10.1007/s10849-011-9135-z · Cited by 14 · cited 1×
“We note that the classical Chomsky hierarchy no longer directly applies to formal languages in this probabilistic setting (94, 95).”
9. On the inadequacy of type-3 and type-2 grammars for human languages
Langendoen, D. T. (1977) · Amsterdam studies in the theory and history of linguistic science. Series 4, Current issues in linguistic theory · doi:10.1075/cilt.4.12lan · Cited by 12
Computational Models of Learning the Raising-Control Distinction
Mitchener, W. G., & Becker, M. (2010) · Research on Language and Computation · doi:10.1007/s11168-011-9073-6 · Cited by 12
Subtle Implicit Language Facts Emerge from the Functions of Constructions
Goldberg, A. E. (2016) · Frontiers in Psychology · doi:10.3389/fpsyg.2015.02019 · Cited by 12
Recursion and Recursion- Like Structure in Ensembles of Neural Elements
Tabor, W. (2012) · Cited by 8
Why We Should Abandon the Semantic Subset Principle
Musolino, J., d’Agostino, K. L., & Piantadosi, S. (2018) · Language Learning and Development · doi:10.1080/15475441.2018.1499517 · Cited by 8 · cited 1×
“Ahugebodyof literature has been dedicated to articulating and critiquing the subset problem of how it is that learners who use only positive evidence can avoid arriving at an overly general grammar (122, 125, 159, 165–170).”
Self-citationA Hierarchical Probabilistic Language-of-Thought Model of Human Visual Concept Learning.
Overlan, M. C., Jacobs, R. A., & Piantadosi, S. T. (2016) · Cognitive Science · Cited by 3
Self-citation
Research works printed but not linked: 34
- N. Chomsky, Aspects of the Theory of Syntax (MIT Press, Cambridge, MA, 1965).
- D. N. Osherson, M. Stob, S. Weinstein, Systems that Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists (MIT Press, 1986).
- J. J. Horning, “A study of grammatical inference,” PhD thesis, Stanford University, Stanford, CA (1969).
- A. Clark, S. Lappin, Linguistic Nativism and the Poverty of the Stimulus (John Wiley, 2010).
- R. Siegler, J. Shrager, “ Strategy choices in addition and subtraction: How do children know what to do?” in Origins of Cognitive Skills, C. Sophian, Ed. (Lawrence Erlbaum Associates, 1984), pp. 229– 293.
- R. Siegler, E. Jenkins, How Children Discover New Strategies (Lawrence Erlbaum Associates, 1989).
- A. Gopnik, A. N. Meltzoff, P. K. Kuhl, The Scientist in the Crib: What Early Learning Tells Us about the Mind (Perennial, New York, NY, 2001).
- P. Langley, G. L. Bradshaw, H. A. Simon, BACON.5: The discovery of conservation laws. IJCAI 81, 121– 126 (1981).
- J. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection (MIT Press, Cambridge, MA, 1992).
- G. Boole, An Investigation of the Laws of Thought: On Which Are Founded the Mathematical Theories of Logic and Probabilities (Walton and Maberly, London, United Kingdom, 1854).
- J. Fodor, The Language of Thought (Harvard University Press, Cambridge, MA, 1975).
- I. Heim, A. Kratzer, Semantics in Generative Grammar (Wiley-Blackwell, Malden, MA, 1998).
- S. T. Piantadosi, “Learning and the language of thought,” PhD thesis, Massachusetts Institute of Technology, Cambridge, MA (2011).
- N. D. Goodman, J. B. Tenenbaum, T. Gerstenberg, Concepts in a Probabilistic Language of Thought (MIT Press, 2015).
- M. C. Corballis, The Recursive Mind: The Origins of Human Language, Thought, and Civilization (Princeton University Press, 2011).
- R. Huybregts, “ The weak inadequacy of context-free phrase structure grammars” in Van periferie naar kern, G.J. de Haan, M. Trommelen, W. Zonneveld, Eds. (Foris, Dordrecht, The Netherlands, 1984), pp. 81– 99.
- Y. Bar-Hillel, E. Shamir, Finite-state languages: Formal representations and adequacy problems. Bull. Res. Counc. Isr. 8F, 155– 166 (1960).
- P. M. Postal, “ Limitations of phrase-structure grammars” in The Structure of Language: Readings in the Philosophy of Language, J. Fodor, J. Katz, Eds. (Prentice-Hall, Englewood Cliffs, NJ, 1964), pp. 137– 151.
- C. Yang, The Infinite Gift (Simon and Schuster, New York, NY, 2006).
- A. Carnie, Syntax: A Generative Introduction (John Wiley, 2013).
- E. W. Bach, Discontinuous constituents in generalized categorial grammar. North East Linguistic Soc. 11, 1– 12 (1981).
- D. Marr, Vision: A Computational Investigation into the Human Representation and Processing of Visual Information (W.H. Freeman, 1982).
- G. F. Marcus, The Algebraic Mind: Integrating Connectionism and Cognitive Science (MIT Press, 2003).
- N. Chomsky., Language and Problems of Knowledge: The Managua Lectures (MIT Press, 1988).
- C. L. Baker, Syntactic theory and the projection problem. Linguist. Inq. 10, 533– 581 (1979).
- S. Crain, “ The semantic subset principle in the acquisition of quantification” in Workshop on the Acquisition of WH-Extraction and Related Work on Quantification (University of Massachusetts, Amherst, MA, 1992).
- M. Bowerman, “ The ‘no negative evidence’ problem: How do children avoid constructing an overly general grammar?” in Explaining Language Universals, J.A. Hawkins, Ed. (Basil Blackwell, 1988), pp. 73– 101.
- A. E. Goldberg, Constructions at Work: The Nature of Generalization in Language (Oxford University Press on Demand, 2006).
- B. MacWhinney, The CHILDES Project: Tools for Analyzing Talk (Lawrence Erlbaum, Hillsdale, NJ, 2000).
- J. Borges, The Library of Babel in Labyrinths (Penguin, Harmondsworth, United Kingdom, 1970).
- P. Smolensky, G. Legendre, The Harmonic Mind (MIT Press, Cambridge, MA, 2006).
- T. Hunter, “ The Chomsky Hierarchy” in A Companion to Chomsky, N. Allott, T. Lohndal, G. Rey, Eds. (Blackwell, 2020), pp. 74– 95.
- M. Tomasello, Constructing a Language: A Usage-Based Theory of Language Acquisition (Harvard University Press, 2009).
- O. Tange, Gnu parallel – The command-line power tool.; login. The USENIX Mag. 36, 42– 47 (2011).
Cited by
Building machines that learn and think with people
Collins, K. M., Sucholutsky, I., Bhatt, U., Chandra, K., Wong, L., Lee, M., Zhang, C. E., Zhi-Xuan, T., Ho, M., Mansinghka, V., et al. (2024) · Nature Human Behaviour · doi:10.1038/s41562-024-01991-9 · Cited by 73
“…word learning 160 , to visual perception 161,162 , physical reasoning 99,163,164 , concept learning 165–167 , language processing and acquisition 158,168–170 , causal inference in children 171,172 and adults 173,174 , memory reconstruction 175 , and theory formation 176,177 , among many others.”
Symbols and mental programs: a hypothesis about human singularity
Dehaene, S., Al Roumi, F., Lakretz, Y., Planton, S., & Sablé-Meyer, M. (2022) · Trends in Cognitive Sciences · doi:10.1016/j.tics.2022.06.010 · Cited by 189
“Recent simulations suggest that a single Bayesian selection algorithm may learn many different languages and data structures [93,136].”
BackgroundUsing Computational Models to Test Syntactic Learnability
Wilcox, E. G., Futrell, R., & Levy, R. (2024) · Linguistic Inquiry · doi:10.1162/ling_a_00491 · Cited by 62
What Artificial Neural Networks Can Tell Us about Human Language Acquisition
Warstadt, A., & Bowman, S. R. (2022) · Algebraic Structures in Natural Language · doi:10.1201/9781003205388-2 · Cited by 111
How linguistics learned to stop worrying and love the language models
Futrell, R., & Mahowald, K. (2025) · Behavioral and Brain Sciences · doi:10.1017/s0140525x2510112x · Cited by 104
Metadata
- Authors
- Yang, Y., & Piantadosi, S. T.
- Affiliations
- Georgia Institute of Technology (US)
- University of California, Berkeley (US)
- Corresponding author
- Piantadosi, Steven T.
- Venue
- Proceedings of the National Academy of Sciences
- Publisher
- National Academy of Sciences
- Published
- 2022-01-24
- Volume
- 119
- Issue
- 5
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- PMC
- PMC8812683
- OpenAlex
- W2768443630
- Cited by
- 50
- References
- 187
- Citations by year
- 2026: 1 · 2025: 11 · 2024: 12 · 2023: 12 · 2022: 14
- FWCI
- 18.65
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- Locations
- Proceedings of the National Academy of Sciences (publishedVersion, cc-by)
- PubMed Central (publishedVersion, cc-by)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- eScholarship (California Digital Library) (submittedVersion, cc-by)
- arXiv (Cornell University)
- Funders
- NSF (1760874)
- NIH (1R01HD085996)
- Topics
- Social Sciences › Psychology › Developmental and Educational Psychology › Language Development and Disorders
- Social Sciences › Psychology › Experimental and Cognitive Psychology › Categorization, perception, and language
- Social Sciences › Arts and Humanities › Language and Linguistics › Syntax, Semantics, Linguistic Variation
- Keywords
- language acquisition, linguistic learning, rule induction, domain-general learning, formalization of language, cognitive processes
- MeSH terms
- Humans, Language, Learning, Linguistics
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.