Unsupervised speech recognition is a task of training a speech recognition model with unpaired data. To determine when and how unsupervised speech recognition can succeed, and how classification error relates to candidate training objectives, we develop a theoretical framework for unsupervised speech recognition grounded in classification error bounds. We introduce two conditions under which unsupervised speech recognition is possible. The necessity of these conditions are also discussed. Under these conditions, we derive a classification error bound for unsupervised speech recognition and validate this bound in simulations. Motivated by this bound, we propose a single-stage sequence-level cross-entropy loss for unsupervised speech recognition.
Figures & tables
Figure 1: Simulation result for sequence-level bound between sequence-level marginal distributions ∑x1N∣pr(x1N)−q(x1N)∣ and Dq . The simulation is done with ∣X∣=4 , ∣C∣=3 , N=3 , ∥PC+∥1≤2 . PC is guaranteed to have full column rank by conditioning that the minimum singular value is larger than 0.01. The grey dots refer to simulation points.