This paper describes how we can use the generalized Baum-Welch (GBW) algorithm to
develop better extended Baum-Welch (EBW) algorithms. Based on GBW, we show that the
backoff term in the EBW algorithm comes from KL-divergence which is used as a
regularization function. This finding allows us to develop a fast EBW algorithm, which can
reduce the time of model space discriminative training by half, without incurring any
degradation on recognition accuracy. We compare the performance of the new EBW …