SPEECH RECOGNISION SYSTEM USING COMPOSITE GRAMMAR NETWORK

摘要

PROBLEM TO BE SOLVED: To prevent an external noise or a generated sound of a word non- existing in a dictionary from being miss-translated, by constructing a dynamical grammar model from first and second word candidate lists and processing an audible voice data using a recognition device. ;SOLUTION: An output from a speech analysis module 14 is divided into two routes, and connected with hidden Markov model recognition blocks 26a, 26b. The recognition blocks 26a, 26b operate using character grammars G1, G2, respectively. N best (or M best) assumptions respectively travel through alignment modules 38a, 38b by a dynamical programming method(DP). The alignment modules by the dynamical programming method accesses a name dictionary 39, and compares it with the N best (or M best) assumptions. A module 42 constructs a grammar using the N best and M best assumptions provided by the alignment modules. Then, N best and M best candidates are evaluated using the dynamical grammar 42 and a recognition device 44.;COPYRIGHT: (C)2000,JPO