Minimization of search network in speech recognition

Details Minimization of search network in speech recognition Minimization of search network in speech recognition

1999-07-15

2002-09-24

Chawan, Vijay (Department: 2654)

Data processing: speech signal processing, linguistics, language

Speech signal processing

Recognition

C704S254000, C704S255000, C704S253000, C704S251000

Reexamination Certificate

active

06456970

ABSTRACT:

TECHNICAL FIELD OF THE INVENTION
This invention relates to speech recognition and more particularly to minimization of a search network.
BACKGROUND OF THE INVENTION
Continuous speech recognition is a resource-intensive algorithm. Commercial dictation software requires more than 10M bytes to install on the disk and 32M bytes RAM to run the application. Static memory is required to store the program (algorithm), grammar, dictionary, and acoustic models. The data will not change, therefore can be stored in disk or ROM. Dynamic memory is required to run the search. Search involves parsing the input speech and building a dynamically changing search tree, therefore, RAM is required for both Read and Write capabilities. The target application for this patent disclosure is for small vocabulary speech recognition implemented on, for example, fixed-point DSP chips. On a DSP implementation, RAM size is a critical cost factor because RAM occupies a large percentage of the total die size. ROM, on the other hand, is much cheaper in silicon real estate.
SUMMARY OF THE INVENTION
In accordance with one embodiment of the present invention, in the search network expansion in speech recognition only the current slot is maintained as long as we know what model and what state the slot is at and the previous slots can be discarded.


REFERENCES:
patent: 4829575 (1989-05-01), Lloyd
patent: 5625749 (1997-04-01), Goldenthal et al.
patent: 5699456 (1997-12-01), Brown et al.
patent: 5719997 (1998-02-01), Brown et al.
patent: 0 248 377 (1994-07-01), None
Singer et al., (“Non-Uniform unit parsing for SSS-LR continuous speech recognition”, ICASSP-94., 1994 IEEE International Conference on Acoustics, Speech, and Signal Processing, 1994, vol. ii, pp. 149-152, 4/94).*
Katunobu et al., (“Continuous speech recognition by context-dependent phonetic HMM and an efficient algorithm for finding N-Best sentence Hypothesis”, ICASSP-92., 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing, vol. 1, pp. 21-24, 3/92).*
Ken Hanazawa et al., “An Efficient Search Method for Large-Vocabulary Continuous-Speech Recognition” IEEE, pp. 1787-1790, Apr. 21, 1997.
Hiroshi Hirayama et al., “DSP-Based Large Vocabulary Speaker-Independent Speech Recognition” NEC Research and Development, vol. 37, No. 4, pp. 528-534, Oct. 1, 1996.
Neeraj Deshmukh et al., “Efficient Search Strategies in Hierarchical Pattern Recognition Systems” IEEE, pp. 88-91, 1995.

Affiliated with

Also associated with

Rating

Minimization of search network in speech recognition does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Minimization of search network in speech recognition, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimization of search network in speech recognition will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2861923