Graph Connectionist Temporal Classification for Phoneme Recognition

Henry Grafé, Hugo Van hamme
9/5/2025
eess.AScs.AI

No confident code implementation found for this paper.

Abstract

Automatic Phoneme Recognition (APR) systems are often trained using pseudo phoneme-level annotations generated from text through Grapheme-to-Phoneme (G2P) systems. These G2P systems frequently output multiple possible pronunciations per word, but the standard Connectionist Temporal Classification (CTC) loss cannot account for such ambiguity during training. In this work, we adapt Graph Temporal Classification (GTC) to the APR setting. GTC enables training from a graph of alternative phoneme sequences, allowing the model to consider multiple pronunciations per word as valid supervision. Our experiments on English and Dutch data sets show that incorporating multiple pronunciations per word into the training loss consistently improves phoneme error rates compared to a baseline trained with CTC. These results suggest that integrating pronunciation variation into the loss function is a promising strategy for training APR systems from noisy G2P-based supervision.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{graf2025graph,
  title  = {Graph Connectionist Temporal Classification for Phoneme Recognition},
  author = {Henry Grafé and Hugo Van hamme},
  year   = {2025},
  eprint = {2509.05399},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2509.05399v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2509.05399.svg)](https://codeofpaper.com/paper/2509.05399)

Discussion