MétaCan
Menu
Back to cohort
Record W2989800691 · doi:10.1093/applin/amz051

How Much Knowledge of Derived Words Is Needed for Reading?

2019· article· en· W2989800691 on OpenAlexaff
Batia Laufer, Tom Cobb

Bibliographic record

VenueApplied Linguistics · 2019
Typearticle
Languageen
FieldPsychology
TopicSecond Language Acquisition and Learning
Canadian institutionsUniversité du Québec à Montréal
Fundersnot available
KeywordsLexisPrefixLinguisticsVariety (cybernetics)Word (group theory)Computer scienceReading (process)Lexical analysisVocabularyRoot (linguistics)Lexical itemReading comprehensionNarrativeNatural language processingArtificial intelligencePhilosophy

Abstract

fetched live from OpenAlex

Abstract The study explores the usefulness of the word family as the unit of counting in studies of lexical coverage and comprehension. It determines the proportion of texts covered by the various members of a word family, that is, basewords, inflected words, and derived words, and analyzes the contribution of the affixed words to lexical thresholds. This exploration was performed by a text analysis computer program called Morpholex that analyzes the entire lexis of an entered text, pulling out all words bearing prefixes and suffixes and counting the unaffixed words as basewords. We analyzed a variety of texts, academic and narrative, authentic and simplified, and calculated the number and percentage of basewords and affixes in each text. We also located the most frequent affixes in our text corpus and demonstrated which affixes and how many contributed to 95 per cent and 98 per cent text coverages. Our results show that reaching the lexical thresholds for reading does not require the knowledge of most of the derived words in a word family since a small number of frequent affixes will provide the necessary coverage together with the basewords and inflections.

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.002
metaresearch head score (Gemma)0.046
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Observational · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.004
Threshold uncertainty score0.014

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.046
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0020.001
Science and technology studies0.0000.001
Scholarly communication0.0020.005
Open science0.0000.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0040.001

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.018
GPT teacher head0.310
Teacher spread0.292 · 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 designObservational
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

Citations68
Published2019
Admission routes1
Has abstractyes

Explore more

Same venueApplied LinguisticsSame topicSecond Language Acquisition and LearningFrench-language works237,207