A parallel processing algorithm for speech recognition using markov random fields

✍ Scribed by Hideki Noda; Mehdi N. Shirazi; Bing Zhang

• Publisher: John Wiley and Sons
• Year: 1994
• Tongue: English
• Weight: 770 KB
• Volume: 25
• Category: Article
• ISSN: 0882-1666
• DOI: 10.1002/scj.4690250209

✦ Synopsis

Abstract

This paper proposes a new method in which the speech recognition processing is executed framewise on the time axis by local parallel operations using the Markov random fields (MRF). There have not been many studies presented concerning the parallel execution of the speech processing. On the hand, it is anticipated that parallel processing algorithms for the recognition process proposed in this paper will be very useful in high‐performance continuous speech recognition systems, for example, where a strong computational power is required.

The essence of parallel execution is to estimate the optimal state sequence by a parallel process based on the iterated conditional modes (ICM) for the given model parameters and the sequence of observed values. The local probability for the state sequence is indispensable for this purpose. It is shown that the local probability can be derived by representing the generation probability of the state sequence in a HMM (hidden Markov model) as a Gibbs distribution and calculating its conditional distribution.

The foregoing property implies that the one‐sided Markov chain used in HMM can be converted into a two‐sided Markov chain in the one‐dimensional MRF. Through the speaker‐independent digit speech recognition experiment, it is shown that the proposed parallel processing algorithm has recognition performance comparable to that of the Viterbi algorithm.