| 摘要 |
PROBLEM TO BE SOLVED: To speed up retrieval, to narrow the eventually obtd. retrieval space and to prevent the inclusion of errors by not only maintaining the best route and holding the quasi-optimum route for a sentence level state as well by executing Viterbi pruning of the state of a word level. SOLUTION: All the active routes are developed (101) and slots are calculated and compared and are scored (103). Whether this score is the sentence level state or not is decided (105) and if not, Viterbi decoding and pruning are executed (106). The pruning discards the route having the score existing on the outer side of a retrieval digit. The route to be pruned is low in the probability to be finally the most significant competition and is, therefore, suitable for the purpose of the N best. The Viterbi decoding holds only the best route entering a certain state. In the case of the sentence level state, the best quasi-optimum route is held (107) and the best route is selected (109) after utterance.
|
