MétaCan
Menu
Back to cohort
Record W3158064982 · doi:10.3765/amp.v9i0.4940

Learning French Liaison with Gradient Symbolic Representations: Errors, Predictions, Consequences

2021· article· en· W3158064982 on OpenAlexaff
Anne‐Michelle Tessier, Karen Jesney

Bibliographic record

VenueProceedings of the Annual Meetings on Phonology · 2021
Typearticle
Languageen
FieldComputer Science
TopicNatural Language Processing Techniques
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsCollocation (remote sensing)LinguisticsWord (group theory)GrammarComputer scienceCryptographic nonceNatural language processingPsychologyCognitive psychologyArtificial intelligenceMachine learningPhilosophy

Abstract

fetched live from OpenAlex

Smolensky & Goldrick (2016) first made the case for Gradient Symbolic Representations (GSRs) as the inputs to phonological grammar using the phenomena of French liaison. Under this view, many common French words are stored underlyingly with partially-activated word-final consonants, and others with gradient blends of partially-activated word-initial consonants. In this paper, we follow up some of that view's predictions and consequences, focusing on the acquisition of French liaison using GSRs. We compare our simulations of error-driven GSR learning with observed errors made by French-learning children, and find the results to be encouragingly similar. We also compare predictions about the end state of GSR learning with a pilot study reporting adult French speakers' use of liaison in nonce words, where we find a rather less good explanatory fit. The paper emphasizes the role of word and collocation frequency in the development of phonological patterns by a GSR learner, and outlines many future avenues for research.

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.015
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.006
Threshold uncertainty score0.011

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.015
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0000.000
Science and technology studies0.0000.002
Scholarly communication0.0010.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.009
GPT teacher head0.251
Teacher spread0.242 · 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 designSimulation or modeling
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

Citations5
Published2021
Admission routes1
Has abstractyes

Explore more

Same venueProceedings of the Annual Meetings on PhonologySame topicNatural Language Processing TechniquesFrench-language works237,207