Patent ID: 6574595
Filing Date: 2003-06-03
Classification: G10L

Abstract:
A method comprising the steps of:a. determining if a speech utterance has started, if an utterance has not started then obtaining next frame and re-running step a, otherwise continuing to step b; b. obtaining a speech frame of the speech utterance that represents a frame period that is next in time; c. extracting features from the speech frame; d. computing likelihood scores for all active sub-word models for the present frame of speech; e. performing dynamic programming to build a speech recognition network of likely sub-word paths; f. performing a beam search using the speech recognition network; g. updating a decoding tree of the speech utterance after the beam search; h. finding the best scoring sub-word path of said likely sub-word paths and determining a number of sub-words in said best scoring sub-word path; i. determining if said best scoring sub-word path has a sub-word length greater than a minimum number of sub-words and if the best scoring path is greater proceeding to step j, otherwise returning to step b; j. determining if recorded root is a sub-string of best path and if recorded root is not a sub-string of best path recording best path as recorded root and returning to step b, otherwise proceeding to step k; k. determining if the recorded root has remained stable for a threshold number of additional sub-words and if said root of said best scoring path has not remained stable for the threshold number returning to step b otherwise proceeding to step 1; l. declaring barge-in; m. disabling any prompt that is playing; and n. backtracking through the best scoring path to obtain a string having a greatest likelihood of corresponding to the utterance; and outputting the string.