MétaCan
Menu
Back to cohort
Record W2970429782

The Language Identification Problem

2016· article· en· W2970429782 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.
aboutThe title or abstract carries a Canadian signal from the geographic lexicon.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldSocial Sciences
TopicLiterature, Language, and Rhetoric Studies
Canadian institutionsWestern University
Fundersnot available
KeywordsFormantLinguisticsVariation (astronomy)Computer scienceSpoken languageIdentification (biology)ParsingNatural language processingSpeech recognitionArtificial intelligenceVowel
DOInot available

Abstract

fetched live from OpenAlex

In the field of computational linguistics, spoken language recognition (through the use of wordlists and morphological markers) is a resource-intensive process: the input must be parsed from the inputted speech signal, words must be hypothesized, and then subsequently word-lists for any likely language must be iterated through. To note, spoken language recognition does not refer to the process of identifying the meaning of the input; rather, it is finding the language of which the speaker is speaking (not necessarily 'parsing' the input). In my research, the question of whether a language can be positively and uniquely identified through small nuances found in the individual formants of vowels is examined. Through analysis of language samples from the Heritage Language Variation and Change (HLVC) corpus (courtesy of Dr. N. Nagy (University of Toronto), pan-linguistic formant frequency distribution was examined. Tabulation of the first three formant frequencies was performed, and through analysis of formant distribution histograms, it is clear that all of the languages in question (Italian, Korean, and Ukrainian) show enough variation to be positively identified.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Other · Consensus signal: none
Teacher disagreement score0.886
Threshold uncertainty score0.534

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.000
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.010
GPT teacher head0.299
Teacher spread0.289 · 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