MétaCan
Menu
Back to cohort
Record W7034543273

Two Apparent âCounterexamplesâ To Marcus: A Closer Look

2003· article· en· W7034543273 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueeScholarship (California Digital Library) · 2003
Typearticle
Languageen
FieldSocial Sciences
TopicDiscourse Analysis and Cultural Communication
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsSet (abstract data type)Simple (philosophy)Syntactic structureRule-based machine translationFeature (linguistics)Syntax
DOInot available

Abstract

fetched live from OpenAlex

Marcus, Vijayan, Bandi Rao, Vishton's experiment (1999) concerning infant ability to discriminate between simple syntactic structures has prompted many connectionists to strive to demonstrate that certain types of neural networks can replicate those results.In this paper we take a closer look at two such attempts: Shultz & Bale ( 2001) and Altmann & Dienes (1999).We were not only interested in how well these two models matched the infants' reported results, but also whether or not they were able to learn the grammars involved in this process.After performing an extensive set of experiments, we found that, at first blush, Shultz & Bale's model replicated the infant's known data, but the model largely failed to learn the grammars.We also discovered serious problems with Altmann & Dienes' model, which failed to match most of the infant's results and to learn the syntactic structure of the input patterns.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesScholarly communication, Insufficient payload (model declined to judge)
Consensus categoriesInsufficient payload (model declined to judge)
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.938
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0010.000
Scholarly communication0.0020.003
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0030.005

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.029
GPT teacher head0.287
Teacher spread0.258 · 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