Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 193 of the 193 references it cites were found in a registry or an index.

One model for the learning of language

Open access
Yang, Yuan, Piantadosi, Steven T. · 2022 · Proceedings of the National Academy of Sciences

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1073/pnas.2021865119

Cites

193 of 193 references verified0 citation errors · 0 not checkable

Statistics

Figures

Fig. 1. Learning curves for the model, provided with data from each target formal language. Precision (blue), Recall (green), and F score (red) are for the learning model, while Memorized (F) (gray) gives the F score for a model that only memorized the training data. Here, we have adopted the convention that Σ={a,b},n,m∈N, Count(v, x) counts the number of times the character v occurs in string x, and |w| is the number of characters in a string w. The x axis is the number of sampled tokens from the target formal language (note the logarithmic scale).
Fig. 1. Learning curves for the model, provided with data from each target formal language. Precision (blue), Recall (green), and F score (red) are for the learning model, while Memorized (F) (gray) gives the F score for a model that only memorized the training data. Here, we have adopted the convention that Σ={a,b},n,m∈N, Count(v, x) counts the number of times the character v occurs in string x, and |w| is the number of characters in a string w. The x axis is the number of sampled tokens from the target formal language (note the logarithmic scale).CC BY · PubMed Central
Fig. 2. Learning curves for the model when run on examples from artificial language learning, including the Finite State grammar from Reber (149), a version of word segmentation motivated by Saffran et al. (134), “ABA” and “ABB” grammars from Marcus et al. (139), context-free grammars from Newport and coworkers (141, 146), a grammar from Morgan et al. (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 from Braine (147), a version of lexical learning from ref. 190, and string sets analogous to Gómez (144).
Fig. 2. Learning curves for the model when run on examples from artificial language learning, including the Finite State grammar from Reber (149), a version of word segmentation motivated by Saffran et al. (134), “ABA” and “ABB” grammars from Marcus et al. (139), context-free grammars from Newport and coworkers (141, 146), a grammar from Morgan et al. (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 from Braine (147), a version of lexical learning from ref. 190, and string sets analogous to Gómez (144).CC BY · PubMed Central
Fig. 3. Finite state machines from Reber (149) (Left) and Berwick and Pilato (150) (Center). Words in this latter machine were converted to single characters to simplify the learning model. Grammars are from Morgan and Newport (141) and Morgan et al. (142) (Right).
Fig. 3. Finite state machines from Reber (149) (Left) and Berwick and Pilato (150) (Center). Words in this latter machine were converted to single characters to simplify the learning model. Grammars are from Morgan and Newport (141) and Morgan et al. (142) (Right).CC BY · PubMed Central
Fig. 4. Learning curves for the simplified English grammar (2). Note that here, precision and recall was computed on the top 100 strings. This language is learned to high accuracy considerably faster than memorization.
Fig. 4. Learning curves for the simplified English grammar (2). Note that here, precision and recall was computed on the top 100 strings. This language is learned to high accuracy considerably faster than memorization.CC BY · PubMed Central
Fig. 5. A visualization of the generalizations by the learning model for the simple English grammar, after observing 200 data points. This shows the posterior probability (greyscale) assigned to strings not observed in the data (columns) by each hypothesis (row). The rows are sorted with the highest posterior probability at the top, and duplicate rows with identical generalizations patterns have been removed. 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.
Fig. 5. A visualization of the generalizations by the learning model for the simple English grammar, after observing 200 data points. This shows the posterior probability (greyscale) assigned to strings not observed in the data (columns) by each hypothesis (row). The rows are sorted with the highest posterior probability at the top, and duplicate rows with identical generalizations patterns have been removed. 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.CC BY · PubMed Central

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.

A few free checks a day · papers already verified open instantly · results are public

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?

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

Show all 187 references

Research works printed but not linked: 37

  1. N. Chomsky, Aspects of the Theory of Syntax (MIT Press, Cambridge, MA, 1965).
  2. D. N. Osherson, M. Stob, S. Weinstein, Systems that Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists (MIT Press, 1986).
  3. J. J. Horning “A study of grammatical inference ” PhD thesis Stanford University Stanford CA (1969).
  4. A. Clark, S. Lappin, Linguistic Nativism and the Poverty of the Stimulus (John Wiley, 2010).
  5. 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.
  6. R. Siegler, E. Jenkins, How Children Discover New Strategies (Lawrence Erlbaum Associates, 1989).
  7. 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).
  8. P. Langley, G. L. Bradshaw, H. A. Simon, BACON.5: The discovery of conservation laws. IJCAI 81, 121–126 (1981).
  9. J. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection (MIT Press, Cambridge, MA, 1992).
  10. 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).
  11. J. Fodor, The Language of Thought (Harvard University Press, Cambridge, MA, 1975).
  12. I. Heim, A. Kratzer, Semantics in Generative Grammar (Wiley-Blackwell, Malden, MA, 1998).
  13. S. T. Piantadosi “Learning and the language of thought ” PhD thesis Massachusetts Institute of Technology Cambridge MA (2011).
  14. N. D. Goodman, J. B. Tenenbaum, T. Gerstenberg, Concepts in a Probabilistic Language of Thought (MIT Press, 2015).
  15. M. C. Corballis, The Recursive Mind: The Origins of Human Language, Thought, and Civilization (Princeton University Press, 2011).
  16. 10.1017/cbo9780511626302 · doi:10.1017/cbo9780511626302
  17. 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.
  18. Y. Bar-Hillel, E. Shamir, Finite-state languages: Formal representations and adequacy problems. Bull. Res. Counc. Isr. 8F, 155–166 (1960).
  19. 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.
  20. C. Yang, The Infinite Gift (Simon and Schuster, New York, NY, 2006).
  21. A. Carnie, Syntax: A Generative Introduction (John Wiley, 2013).
  22. E. W. Bach, Discontinuous constituents in generalized categorial grammar. North East Linguistic Soc. 11, 1–12 (1981).
  23. D. Marr, Vision: A Computational Investigation into the Human Representation and Processing of Visual Information (W.H. Freeman, 1982).
  24. G. F. Marcus, The Algebraic Mind: Integrating Connectionism and Cognitive Science (MIT Press, 2003).
  25. 10.1037/0278-7393.16.4.592 · doi:10.1037/0278-7393.16.4.592 · Paper page
  26. N. Chomsky ., Language and Problems of Knowledge: The Managua Lectures (MIT Press, 1988).
  27. C. L. Baker, Syntactic theory and the projection problem. Linguist. Inq. 10, 533–581 (1979).
  28. 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).
  29. 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.
  30. A. E. Goldberg, Constructions at Work: The Nature of Generalization in Language (Oxford University Press on Demand, 2006).
  31. B. MacWhinney, The CHILDES Project: Tools for Analyzing Talk (Lawrence Erlbaum, Hillsdale, NJ, 2000).
  32. J. Borges, The Library of Babel in Labyrinths (Penguin, Harmondsworth, United Kingdom, 1970).
  33. P. Smolensky, G. Legendre, The Harmonic Mind (MIT Press, Cambridge, MA, 2006).
  34. 10.1207/s15516709cog2302_2 · doi:10.1207/s15516709cog2302_2 · Paper page
  35. T. Hunter, “The Chomsky Hierarchy” in A Companion to Chomsky, N. Allott, T. Lohndal, G. Rey, Eds. (Blackwell, 2020), pp. 74–95.
  36. M. Tomasello, Constructing a Language: A Usage-Based Theory of Language Acquisition (Harvard University Press, 2009).
  37. O. Tange, Gnu parallel – The command-line power tool.; login. The USENIX Mag. 36, 42–47 (2011).

Cited by

See all 81

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
Published
2022-01-24
Volume
119
Issue
5
ISSN
  • 0027-8424 (ISSN-L)
  • 1091-6490
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
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: One model for the learning of language. https://app.cochat.ai/papers/10.1073/pnas.2021865119
The paper
Yang, Y., & Piantadosi, S. T. (2022). One model for the learning of language. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.2021865119

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.