Completely Unsupervised Phoneme Recognition by a Generative Adversarial Network Harmonized with Iteratively Refined Hidden Markov Models

Kuan-Yu Chen, Che-Ping Tsai, Da-Rong Liu, Hung-Yi Lee, Lin-shan Lee


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.


 DOI: 10.21437/Interspeech.2019-2068

Cite as: Chen, K., Tsai, C., Liu, D., Lee, H., Lee, L. (2019) Completely Unsupervised Phoneme Recognition by a Generative Adversarial Network Harmonized with Iteratively Refined Hidden Markov Models. Proc. Interspeech 2019, 1856-1860, DOI: 10.21437/Interspeech.2019-2068.


@inproceedings{Chen2019,
  author={Kuan-Yu Chen and Che-Ping Tsai and Da-Rong Liu and Hung-Yi Lee and Lin-shan Lee},
  title={{Completely Unsupervised Phoneme Recognition by a Generative Adversarial Network Harmonized with Iteratively Refined Hidden Markov Models}},
  year=2019,
  booktitle={Proc. Interspeech 2019},
  pages={1856--1860},
  doi={10.21437/Interspeech.2019-2068},
  url={http://dx.doi.org/10.21437/Interspeech.2019-2068}
}