Multi-Pattern Viterbi Algorithm for joint decoding of multiple speech patterns

Nishanth Ulhas Nair

doi:10.1016/j.sigpro.2010.05.006

2010-12-01

PRE

Nishanth Ulhas Nair *

T.V. Sreenivas

DOI：10.1016/j.sigpro.2010.05.006

原文链接

原文求助

摘要

En 中文

Joint decoding of multiple speech patterns so as to improve speech recognition performance is important, especially in the presence of noise. In this paper, we propose a Multi-Pattern Viterbi algorithm (MPVA) to jointly decode and recognize multiple speech patterns for automatic speech recognition (ASR). The MPVA is a generalization of the Viterbi Algorithm to jointly decode multiple patterns given a Hidden Markov Model (HMM). Unlike the previously proposed two stage Constrained Multi-Pattern Viterbi Algorithm (CMPVA), the MPVA is a single stage algorithm. MPVA has the advantage that it cart be extended to connected word recognition (CWR) and continuous speech recognition (CSR) problems. MPVA is shown to provide better speech recognition performance than the earlier techniques: using only two repetitions of noisy speech patterns (-5 dB SNR, 10% burst noise), the word error rate using MPVA decreased by 28.5%, when compared to using individual decoding. (C) 2010 Elsevier B.V. All rights reserved.

Keyword:

Joint decoding

ASR

Viterbi algorithm

MPVA

Multi-pattern