1991-06-25
1993-08-31
Fleming, Michael R.
G10L 900
Patent
active
052416194
ABSTRACT:
As a step in finding the one most likely word sequence in a spoken language system, an N-best search is conducted to find the N most likely sentence hypotheses. During the search, word theories are distinguished based only on the one previous word. At each state within a word, the total probability is calculated for each of a few previous words. At the end of each word, the probability score is recorded for each previous word theory, together with the name of the previous word. At the end of the sentence, a recursive traceback is performed to derive the list of the N best sentences.
REFERENCES:
patent: 4741036 (1988-04-01), Bahl et al.
patent: 4748670 (1988-05-01), Bahl et al.
Soong, Frank and Huang, Eng-Fong; "A Tree-Trellis Based Fast Search for Finding the N-Best Sentence Hypothesis in Continuous Speech Recognition"; 1991 International Conference on Acoustics Speech and Signal Processing, May 16, 1991, pp. 705-708.
Schwartz et al.; "The N-Best Algorithm: An Efficient and Exact Procedure for Finding the N Most likely Sentence Hypotesis", IEEE ICASSP, 1990, pp. 1-4.
"The Forward-Backward Search Algorithm", by Austin, Schwartz and Placeway, IEEE ICASSP, Toronto, Canada, May, 1991, pp. 1-4.
Austin Stephen C.
Schwartz Richard M.
Bolt Beranek and Newman Inc.
Doerrler Michelle
Fleming Michael R.
LandOfFree
Word dependent N-best search method does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Word dependent N-best search method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Word dependent N-best search method will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2304102