| 摘要 |
In the speech recognition system disclosed herein, the Viterbi decoding of an acoustic recognition network is augmented by implementing additional data structures for each arc in the network which represent, for each arc, the best path cost of reaching the last point on that arc and an arc in time which represents, for the best path, the time of leaving the previous arc. These additional data structures enable a trace back procedure which identifies not only the presumably optimal path but also alternate paths having good scores.
|
