mlsanityData to 7 Oct 2026

End-to-End real time tracking of children's reading with pointer network

arXiv 2310.11486 ↗First posted 17 Oct 2023eess.AS cs.AI cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

In this work, we explore how a real time reading tracker can be built efficiently for children's voices. While previously proposed reading trackers focused on ASR-based cascaded approaches, we propose a fully end-to-end model making it less prone to lags in voice tracking. We employ a pointer network that directly learns to predict positions in the ground truth text conditioned on the streaming speech. To train this pointer network, we generate ground truth training signals by using forced alignment between the read speech and the text being read on the training set. Exploring different forced alignment models, we find a neural attention based model is at least as close in alignment accuracy to the Montreal Forced Aligner, but surprisingly is a better training signal for the pointer network. Our results are reported on one adult speech data (TIMIT) and two children's speech datasets (CMU Kids and Reading Races). Our best model can accurately track adult speech with 87.8% accuracy and the much harder and disfluent children's speech with 77.1% accuracy on CMU Kids data and a 65.3% accuracy on the Reading Races dataset.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 6 of its 21 references that are in the map. First posted on arXiv 17 Oct 2023.

Builds on

6 of 21 references.

References · 6

  1. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  2. 2015Pointer Networkscited by 882
  3. 2015Listen, Attend and Spellcited by 542
  4. 2020CTC-Segmentation of Large Corpora for German End-to-end Speech Recognitioncited by 75
  5. 2020Towards Real-time Mispronunciation Detection in Kids' Speechcited by 8
  6. 2021End-to-end acoustic modelling for phone recognition of young readerscited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.