Elamur Research⌕
☰
home / papers / 2021 / Grapheme-to-Phoneme Transformer Model for Transfer Learning Dialects

Grapheme-to-Phoneme Transformer Model for Transfer Learning Dialects

Paper · 2021 · Eric Engelhart, Mahsa Elyasi and Gaurav Bharaj

Summary

The paper tackles grapheme-to-phoneme (G2P) conversion for English dialects that have only small pronunciation dictionaries. Hand-built lexicons are costly and cannot handle unseen words, and transformer G2P models usually need far more data than such dialects provide. The authors pretrain a compact Transformer (4.1M parameters) on sentence-level data derived from CMUDict American English. They then swap the decoder's phoneme embedding and output projection to fit each target dialect's phoneme inventory and fine-tune the whole network.

Training pairs are built by taking LibriTTS sentences and transcribing them through dictionary lookup. Small dictionaries are simulated by keeping only the most frequent words. The method is tested on Indian English (CMUSphinx) and British RP (Britfone), each at four dictionary sizes. With just 1K British words, fine-tuning reduces phoneme error rate from roughly 27% to about 2.5%. This suggests that dialect-specific G2P, useful for accent-aware TTS, is feasible from very small lexicons.

Key points

  • Model: 3 encoder and 3 decoder layers, hidden size 256, feedforward size 512, 8 heads, dropout 0.1, maximum sequence length 240. It is trained with Adam at learning rate 0.0005, batch size 128 and gradient clipping 1.0.
  • Training schedule:
    • pretraining on CMUDict-derived data for 100 epochs;
    • training from scratch for 50 epochs;
    • fine-tuning for 25 epochs;
    • in every case the checkpoint with the lowest validation loss is kept.
  • Dictionary sizes were 1K, 3K, 5K and 10K words, giving 16 models in total. Training sentences are limited to those in which every word appears in the reduced dictionary, whereas test sentences are drawn using the complete dictionary. Sentences falling in the bottom 3% and top 3% by length were excluded.
  • British English at 1K words reached 26.877% PER from scratch versus 2.469% when fine-tuned. Indian English at 10K reached 2.039% fine-tuned versus 2.166% from scratch, using half as many training steps.
  • The gains depend on how much sentence data a dictionary can produce. At 5K words, Britfone yielded about 9K sentence pairs, whereas the Indian English dictionary yielded about 87K. This explains why scratch models for Indian English catch up at larger sizes.

Interesting ideas

  • I1. To mimic a low-resource lexicon, the authors take subsets of a large dictionary ordered by word frequency, which produces realistic learning curves across data sizes.
  • I2. Transfer reuses the whole pretrained network and replaces only the layers that are tied to the label inventory, followed by brief fine-tuning.
  • I3. A word-level lexicon is turned into sentence-level supervision, keeping only sentences in which every word is covered by the trusted resource.
  • I4. The model is trained on a restricted dictionary but tested on the full dictionary, which directly measures generalization to unseen items.
  • I5. A nonce-word text (Jabberwocky) serves as a qualitative stress test, showing that the fine-tuned model degrades gracefully while the scratch model falls apart.

For Mova

How these ideas could serve Mova, our small open language model — its files, stages and tests:

  • I1 (learn): Ordering silver data or lexicon entries by frequency and evaluating at several cut-off sizes would show how much each training resource actually contributes, instead of a single score.
  • I2 (tree): gparse could be pretrained on one large treebank and then given a new label head for a different UD dialect or annotation scheme, with short fine-tuning to adapt.
  • I3 (learn): Silver training data could be restricted to sentences whose tokens all carry trusted analyses, so that partially reliable examples never enter training.
  • I4 (tokens): The lemmatizer and morphology in crate en could be trained with part of the lexicon hidden, then scored on the held-out words to quantify out-of-vocabulary robustness.
  • I5 (tokens): A small suite of invented-word sentences could act as a negative-control check that the tagger relies on morphology and context rather than memorized vocabulary.

Our summary of the paper, in our own words — not its text. The work belongs to its authors; read it at the links above.

 Fields, topics and concepts

Cite

Cite as Eric Engelhart, Mahsa Elyasi and Gaurav Bharaj. 2021. Grapheme-to-Phoneme Transformer Model for Transfer Learning Dialects. arXiv:2104.04091.

The paper itself, not this page. BibTeX from the library's record of the work. DOI 10.48550/arxiv.2104.04091 · arXiv 2104.04091

@misc{engelhart2021grapheme,
  title = {{Grapheme-to-Phoneme Transformer Model for Transfer Learning Dialects}},
  author = {Eric Engelhart, Mahsa Elyasi and Gaurav Bharaj},
  year = {2021},
  doi = {10.48550/arxiv.2104.04091},
  eprint = {2104.04091},
  archivePrefix = {arXiv},
  url = {https://doi.org/10.48550/arxiv.2104.04091}
}

References

12 references, 2 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet.

  1. R. Weide, “The carnegie mellon pronouncing dictionary [cmudict. 0.6],” Pittsburgh, PA: Carnegie Mellon University, 2005. find
  2. H. S. Elovitz, R. W. Johnson, A. McHugh, and J. E. Shore, “Automatic translation of english text to phonetics by means of letter-to-sound rules,” NAVAL RESEARCH LAB WASHINGTON DC, Tech. Rep., 1976. find
  3. K. Rao, F. Peng, H. Sak, and F. Beaufays, “Grapheme-to-phoneme conversion using long short-term memory recurrent neural networks,” in 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2015, pp. 4225– 4229. find
  4. B. Peters, J. Dehdari, and J. van Genabith, “Massively multilingual neural grapheme-to-phoneme conversion,” arXiv preprint arXiv:1708.01464, 2017. ↗
  5. S. Yolchuyeva, G. Németh, and B. Gyires-Tóth, “Transformer based grapheme-to-phoneme conversion,” arXiv preprint arXiv:2004.06338, 2020. ↗
  6. K. Vesik, M. Abdul-Mageed, and M. Silfverberg, “One model to pronounce them all: Multilingual grapheme-to-phoneme conversion with a transformer ensemble,” 2020. find
  7. M. Bisani and H. Ney, “Joint-sequence models for grapheme-to-phoneme conversion,” Speech Communication, vol. 50, no. 5, pp. 434–451, 2008. ↗
  8. A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, L. Kaiser, and I. Polosukhin, “Attention is all you need,” ArXiv, vol. abs/1706.03762, 2017. ↗
  9. M. Yu, H. D. Nguyen, A. Sokolov, J. Lepird, K. M. Sathyendra, S. Choudhary, A. Mouchtaris, and S. Kunzmann, “Multilingual grapheme-to-phoneme conversion with byte representation,” in ICASSP 2020-2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2020, pp. 8234– 8238. find
  10. M. A. C. Blandón, E. N. Cordón, and D. Jouvet, “A multilingual approach towards improving the linguistic module of a tts system: Case navarro-lapurdian dialect,” 2019. find
  11. T. Schlippe, S. Ochs, and T. Schultz, “Wiktionary as a source for automatic pronunciation extraction,” in Eleventh Annual Conference of the International Speech Communication Association, 2010. find
  12. H. Zen, V. Dang, R. Clark, Y. Zhang, R. J. Weiss, Y. Jia, Z. Chen, and Y. Wu, “Libritts: A corpus derived from librispeech for text-to-speech,” arXiv preprint arXiv:1904.02882, 2019. ↗

Updated

↑ back to top

This page in Markdown → https://md.research.elamur.ai/free/en/papers/engelhart-2021-grapheme-phoneme-transformer-model-transfer/