10th Annual Conference of the International Speech Communication Association

Brighton, United Kingdom
September 6-10, 2009

Parallel Fast Likelihood Computation for LVCSR Using Mixture Decomposition

Naveen Parihar (1), Ralf Schlüter (2), David Rybach (2), Eric A. Hansen (1)

(1) Mississippi State University, USA
(2) RWTH Aachen University, Germany

This paper describes a simple and robust method for improving the runtime of likelihood computation on multi-core processors without degrading system accuracy. The method improves runtime by parallelizing likelihood computations on a multi-core processor. Mixtures are decomposed among the cores and each core computes the likelihood of the mixture allocated to it. We study two approaches to mixture decomposition Chunk based and Decisiontree based. When applied to RWTH TC-STAR EPPS English LVCSR system on an Intel Core2 Quad processor with varying pruningbeam width settings, the method resulted in a 54% to 70% improvement in the likelihood computation runtime, and a 18% to 59% improvement in the overall runtime.

Full Paper

Bibliographic reference.  Parihar, Naveen / Schlüter, Ralf / Rybach, David / Hansen, Eric A. (2009): "Parallel fast likelihood computation for LVCSR using mixture decomposition", In INTERSPEECH-2009, 3047-3050.