MétaCan
Menu
Back to cohort
Record W4250961188 · doi:10.31234/osf.io/guj8d

A computational theory of child overextension

2020· preprint· en· W4250961188 on OpenAlexaff
Yang Xu, Renato Ferreira Pinto

Bibliographic record

Venuenot available
Typepreprint
Languageen
FieldPsychology
TopicLanguage Development and Disorders
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsOperationalizationReferentComprehensionPsychologySet (abstract data type)VocabularyPhenomenonCategorizationCognitive psychologyInferenceCognitive scienceLinguisticsComputer scienceEpistemologyArtificial intelligence

Abstract

fetched live from OpenAlex

Overextension—the phenomenon that children extend known words to describe referents outside their vocabulary—is a hallmark of lexical innovation in early childhood. Overextension is a subject of extensive inquiry in linguistics and developmental psychology, but there exists no coherent formal account of this phenomenon. We develop a general computational framework that captures important properties of overextension reported separately in the previous literature. We operationalize overextension as probabilistic inference over a conceptual space that draws on a fusion of knowledge from lexical semantics, deep neural networks, and psychological experiments to support both production and comprehension. We show how this minimally parameterized framework explains overextension in young children over a comprehensive set of noun-referent pairs previously reported in child speech, and it also predicts the behavioral asymmetry in children’s overextensional production and comprehension reported in lab settings. Our work offers a computational theory for the origins of word meaning extension and supports a single-system view of language production and comprehension.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.007
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.005
Threshold uncertainty score0.018

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.007
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0010.001
Science and technology studies0.0010.004
Scholarly communication0.0020.006
Open science0.0010.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0050.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.023
GPT teacher head0.297
Teacher spread0.274 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations1
Published2020
Admission routes1
Has abstractyes

Explore more

Same topicLanguage Development and DisordersFrench-language works237,207