mlsanityData to 13 Oct 2026

Completely Unsupervised Speech Recognition By A Generative Adversarial Network Harmonized With Iteratively Refined Hidden Markov Models

arXiv 1904.04100 ↗First posted 8 Apr 2019cs.CL cs.SD eess.AScited by 8

Not on the map. Why?

Abstract (arXiv)

Producing a large annotated speech corpus for training ASR systems remains difficult for more than 95% of languages all over the world which are low-resourced, but collecting a relatively big unlabeled data set for such languages is more achievable. This is why some initial effort have been reported on completely unsupervised speech recognition learned from unlabeled data only, although with relatively high error rates. In this paper, we develop a Generative Adversarial Network (GAN) to achieve this purpose, in which a Generator and a Discriminator learn from each other iteratively to improve the performance. We further use a set of Hidden Markov Models (HMMs) iteratively refined from the machine generated labels to work in harmony with the GAN. The initial experiments on TIMIT data set achieve an phone error rate of 33.1%, which is 8.5% lower than the previous state-of-the-art.

Key facts. Cited by 8 papers in the map (data through 13 Oct 2026). First posted on arXiv 8 Apr 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 13 Oct)

Citing papers per year: 2021: 2; 2022: 1; 2023: 1; 2024: 2; 2025: 1; 2026: 1.

8 papers.