MétaCan
Menu
← Back to cohort
Record W4287752972 · doi:10.48550/arxiv.2006.13343

One Model to Pronounce Them All: Multilingual Grapheme-to-Phoneme\n Conversion With a Transformer Ensemble

2020· preprint· en· W4287752972 on OpenAlexaff
Kaili Vesik, Muhammad Abdul-Mageed, Miikka Silfverberg

Bibliographic record

VenuearXiv (Cornell University) · 2020
Typepreprint
Languageen
FieldComputer Science
TopicNatural Language Processing Techniques
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsGraphemeTransformerComputer scienceWord error rateTask (project management)Speech recognitionLanguage modelArtificial intelligenceNatural language processingSpeech synthesisEngineeringVoltage

Abstract

fetched live from OpenAlex

The task of grapheme-to-phoneme (G2P) conversion is important for both speech\nrecognition and synthesis. Similar to other speech and language processing\ntasks, in a scenario where only small-sized training data are available,\nlearning G2P models is challenging. We describe a simple approach of exploiting\nmodel ensembles, based on multilingual Transformers and self-training, to\ndevelop a highly effective G2P solution for 15 languages. Our models are\ndeveloped as part of our participation in the SIGMORPHON 2020 Shared Task 1\nfocused at G2P. Our best models achieve 14.99 word error rate (WER) and 3.30\nphoneme error rate (PER), a sizeable improvement over the shared task\ncompetitive baselines.\n

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.002
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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.006
Threshold uncertainty score0.020

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.003
Open science0.0020.002
Research integrity0.0010.004
Insufficient payload (model declined to judge)0.0060.006

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.098
GPT teacher head0.221
Teacher spread0.124 · 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

Citations0
Published2020
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)→Same topicNatural Language Processing Techniques→French-language works237,207→