Sentence-hypotheses generation in a continuous-speech recognition system


In this paper, the dynamic-programming algorithm for continuous-speech recognition is modified in orderto obtain a top-N sentence-hypotheses Iist instead of the usual one sentence only. The theoretical basis of this extension is a generalization of Bellman's principle of optimality. Due to the computational complexity of the new algorithm, a sub-optimal… (More)


5 Figures and Tables