Patent EP0067070A1 successfully refreshed from Google Patents.
US4910784A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Low cost speech recognition system and method
Assignee: Texas Instruments Inc
•
Filing: 1987-07-30
•
Granted: 1990-03-20
•
Expires: 2007-07-30
Abstract
Abstract A low cost speech recognition system generates frames of received speech having binary feature components. The received speech frames are compared with reference templates, and error values representing the difference between the received speech and the reference templates are generated. At the end of an utterance, if one template resulted in a sufficiently small error value, the word represented by that template is selected as the recognized word.
Inventors
- 👤 George R. Doddington
- 👤 P. K. Rajasekaran
- 👤 Michael L. McMahan
- 👤 Wallace Anderson
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-03 11:27
CPC Classifications
G; G10; G10L; G10L15/00; G10L15/28
Claims Analysis
Total Claims: 27
Claim 1
Independent Claim
204 words
A system for recognizing speech, comprising: a digitizer for sampling analog speech signals at predetermined intervals and generating a digital representation thereof as digital speech signals; a feature extractor coupled to said digitizer for grouping the digital speech signals into frames and generating a transform of the digital speech signals as grouped in each frame, wherein the transform has a plurality of feature coefficients, and wherein each feature coefficient has a corresponding binary feature coefficient indicating whether the feature coefficient has a value greater or less than a preselected threshold for that feature coefficient; a queue coupled to said feature extractor for receiving frames of binary feature coefficients as speech frames and arranging them in consecutive order; a comparator coupled to said queue for comparing a plurality of speech frames with a plurality of reference templates having frames of binary feature coefficients and generating a plurality of error values indicating the closeness of the match therebetween, wherein the reference templates are respectively representative of different words; and a decision controller coupled to said comparator for receiving the results of the comparisons, and for selecting a best match between a portion of a speech utterance as represented by said speech frames and the reference templates.
Claim 2
Independent Claim
204 words
A system for recognizing speech, comprising: a digitizer for sampling analog speech signals at predetermined intervals and generating a digital representation thereof as digital speech signals; a feature extractor coupled to said digitizer for grouping the digital speech signals into frames and generating a transform of the digital speech signals as grouped in each frame, wherein the transform has a plurality of feature coefficients, and wherein each feature coefficient has a corresponding binary feature coefficient indicating whether the feature coefficient has a value greater or less than a preselected threshold for that feature coefficient; a queue coupled to said feature extractor for receiving frames of binary feature coefficients as speech frames and arranging them in consecutive order; a comparator coupled to said queue for comparing a plurality of speech frames with a plurality of reference templates having frames of binary feature coefficients and generating a plurality of error values indicating the closeness of the match therebetween, wherein the reference templates are respectively representative of different words; and a decision controller coupled to said comparator for receiving the results of the comparisons, and for selecting a best match between a portion of a speech utterance as represented by said speech frames and the reference templates.
Claim 3
Dependent Claim
43 words
The system of claim 1, wherein said decision controller further includes means for detecting the beginning and end of an utterance as defined by its acounstic energy levels, and wherein said decision controller selects a best match only after an utterance is completed.
Claim 4
Dependent Claim
37 words
The system of claim 2, wherein said decision controller selects a best match only if at least one comparison in said queue has an error less than a predetermined threshold, and wherein an utterance is rejected otherwise.
Claim 5
Dependent Claim
30 words
The system of claim 3, wherein an utterance is rejected if the two comparisons having the lowest errors have error values which are within a preselected range of each other.
Claim 6
Dependent Claim
57 words
The system of claim 1, wherein said comparator computes an exclusive-OR between each frame of each reference template and a corresponding speech frame of binary feature coefficients in said queue, and wherein the error value indicates the number of bits which do not match between respective reference templates and the corresponding speech frame of binary feature coefficients.
Claim 7
Dependent Claim
32 words
The system of claim 1, wherein only alternate speech frames of binary feature coefficients in said queue are used by said comparator for each comparison step with the plurality of reference templates.
Claim 8
Independent Claim
122 words
A method for recognizing spoken words, comprising the steps of: (a) digitizing an analog speech signal representing an utterance of speech by sampling the analog speech signal at preselected intervals to generate digital speech signals; grouping the digital speech signals into frames and transforming each frame of digital speech signals into a speech frame comprising a plurality of binary coefficients indicating acoustic features; providing a plurality of reference templates respectively representative of different words, each reference template having a plurality of frames of binary coefficients; comparing respective speech frames of binary coefficients with the reference templates, and generating error values indicating the magnitude of the differences therebetween; and selecting a reference template which generates the lowest error value as the recognized word.
Claim 9
Independent Claim
122 words
A method for recognizing spoken words, comprising the steps of: (a) digitizing an analog speech signal representing an utterance of speech by sampling the analog speech signal at preselected intervals to generate digital speech signals; grouping the digital speech signals into frames and transforming each frame of digital speech signals into a speech frame comprising a plurality of binary coefficients indicating acoustic features; providing a plurality of reference templates respectively representative of different words, each reference template having a plurality of frames of binary coefficients; comparing respective speech frames of binary coefficients with the reference templates, and generating error values indicating the magnitude of the differences therebetween; and selecting a reference template which generates the lowest error value as the recognized word.
Claim 10
Dependent Claim
26 words
The method of claim 7, wherein a reference template is selected as the recognized word only if its error value is less than a predetermined value.
Claim 11
Dependent Claim
58 words
The method of claim 7, wherein the reference template frames have a time duration twice as long as the speech frames of binary coefficients but are represented by the same number of binary coefficients, wherein only alternate ones of consecutive speech frames of binary coefficients are compared with the reference templates in the generation of said error values.
Claim 12
Dependent Claim
47 words
The method of claim 7, wherein the comparison of speech frames of binary coefficients with the reference templates comprises performing an exclusive OR between corresponding speech and reference template frames, whereby the generated error values are the Hamming distance between the corresponding speech and reference template frames.
Claim 13
Independent Claim
165 words
A method for enrolling speech for use with a speech recognition system, comprising the steps of: selecting a word to be enrolled and determining an expected length in speech frames necessary for the representation thereof; receiving an utterance of the selected word in the form of an analog speech signal; digitizing the analog speech signal representative of the utterance by collecting samples thereof at preselected intervals as digital speech signals; grouping the digital speech signals into frames having a predetermined time duration; extracting binary features for each frame of digital speech signals to form respective speech frames of binary features corresponding to each of the frames of digital speech signals; comparing the length of the utterance as represented by speech frames of binary features to the expected length; and if the utterance as represented by speech frames of binary features has a length in speech frames within a preselected amount of the expected length, enrolling the speech frames representing the utterance as a reference template.
Claim 14
Independent Claim
165 words
A method for enrolling speech for use with a speech recognition system, comprising the steps of: selecting a word to be enrolled and determining an expected length in speech frames necessary for the representation thereof; receiving an utterance of the selected word in the form of an analog speech signal; digitizing the analog speech signal representative of the utterance by collecting samples thereof at preselected intervals as digital speech signals; grouping the digital speech signals into frames having a predetermined time duration; extracting binary features for each frame of digital speech signals to form respective speech frames of binary features corresponding to each of the frames of digital speech signals; comparing the length of the utterance as represented by speech frames of binary features to the expected length; and if the utterance as represented by speech frames of binary features has a length in speech frames within a preselected amount of the expected length, enrolling the speech frames representing the utterance as a reference template.
Claim 15
Dependent Claim
66 words
The method of claim 11, wherein the reception of an utterance of the selected word in the form of an analog speech signal and the digitizing of the analog speech signal are performed a plurality of times, and wherein the extraction of binary features with respect to each set of digital speech signals resulting therefrom is used to create a composite set of binary feature frames.
Claim 16
Dependent Claim
25 words
The method of claim 12, wherein the plurality of utterances as received in the form of analog speech signals are made by a single speaker.
Claim 17
Dependent Claim
24 words
The method of claim 12, wherein the plurality of utterances as received in the form of analog speech signals are made by different speakers.
Claim 18
Dependent Claim
135 words
The method of claim 7, wherein the transforming of each frame of digital speech signals into a speech frame comprising a plurality of binary coefficients comprises initially transforming each frame of digital speech signals into a plurality of speech parameters defining respective feature coefficients; comparing each of the plurality of speech parameters included in a respective speech frame with a preselected threshold value; assigning a first or a second value as a binary coefficient corresponding to the respective speech parameter depending upon whether the speech parameter is greater or less than the preselected threshold value corresponding thereto; and assembling a plurality of said binary coefficients obtained from respective comparisons of all of the speech parameters included in a speech frame with preselected threshold values as a string of said binary coefficients representing a speech frame.
Claim 19
Dependent Claim
21 words
The method of claim 15, wherein the first and second values assignable as a binary coefficient are respectively "1" and "0".
Claim 20
Dependent Claim
22 words
The method of claim 16, wherein each string of binary coefficients representing a speech frame is of eight data bits in length.
Claim 21
Independent Claim
215 words
A method for recognizing spoken words, comprising the steps of: digitizing an analog speech signal representing an utterance of speech by sampling the analog speech signal at preselected intervals to generate digital speech data; grouping the samples of digital speech data into frames having a plurality of samples of digital speech data; transforming the frames of digital speech data into a cepstrum transform having a plurality of cepstral parameters for each frame which define respective feature coefficients; comparing each cepstral parameter with a preselected threshold value; assigning a first or a second value to a binary feature coefficient depending upon whether the cepstral parameter is greater or less than the preselected threshold value corresponding thereto; assembling a plurality of said binary feature coefficients obtained from respective comparisons of all of the cepstral parameters included in a frame with preselected threshold values as a string of said binary feature coefficients representing a frame of speech data; providing a plurality of reference templates respectively representative of different words, each reference template having a plurality of frames of binary feature coefficients; comparing speech frames of binary feature coefficients with the reference templates, and generating error values indicating the magnitude of the differences therebetween; and selecting a reference template which generates the lowest error value as the recognized word.
Claim 22
Independent Claim
215 words
A method for recognizing spoken words, comprising the steps of: digitizing an analog speech signal representing an utterance of speech by sampling the analog speech signal at preselected intervals to generate digital speech data; grouping the samples of digital speech data into frames having a plurality of samples of digital speech data; transforming the frames of digital speech data into a cepstrum transform having a plurality of cepstral parameters for each frame which define respective feature coefficients; comparing each cepstral parameter with a preselected threshold value; assigning a first or a second value to a binary feature coefficient depending upon whether the cepstral parameter is greater or less than the preselected threshold value corresponding thereto; assembling a plurality of said binary feature coefficients obtained from respective comparisons of all of the cepstral parameters included in a frame with preselected threshold values as a string of said binary feature coefficients representing a frame of speech data; providing a plurality of reference templates respectively representative of different words, each reference template having a plurality of frames of binary feature coefficients; comparing speech frames of binary feature coefficients with the reference templates, and generating error values indicating the magnitude of the differences therebetween; and selecting a reference template which generates the lowest error value as the recognized word.
Claim 23
Dependent Claim
55 words
The method of claim 18, further including analyzing each frame of digital speech data to determine linear predictive coding speech parameters for each frame; and thereafter transforming the linear predictive coding speech parameters for each frame into a cepstrum transform having a plurality of cepstral parameters for each frame which define the respective feature coefficients.
Claim 24
Independent Claim
275 words
A method for recognizing spoken words, comprising the steps of: digitizing an analog speech signal representing an utterance of speech by sampling the analog speech signal at preselected intervals to generate digital speech data; grouping the samples of digital speech data into frames having a plurality of samples of digital speech data; transforming each frame of digital speech data into a plurality of speech parameters defining respective feature coefficients; comparing each of the plurality of speech parameters included in a respective speech frame with a preselected threshold value; assigning a first or a second value as a binary coefficient corresponding to the respective speech parameter depending upon whether the speech parameter is greater or less than the preselected threshold value corresponding thereto; assembling a plurality of said binary coefficients obtained from respective comparisons of all of the speech parameters included in a speech frame with preselected threshold values as a string of said binary coefficients representing a speech frame; arranging a plurality of speech frames, each comprising a plurality of binary coefficients, in consecutive order in a queue; providing a plurality of reference templates respectively representative of different words, each reference template having a plurality of frames of binary coefficients, wherein the reference template frames have a time duration twice as long as the speech frames of binary coefficients but are represented by the same number of binary coefficients; comparing alternate ones of the consecutive speech frames of binary coefficients as arranged in the queue with the reference templates, and generating error values indicating the magnitude of the differences therebetween; and selecting a reference template which generates the lowest error value as the recognized word.
Claim 25
Independent Claim
275 words
A method for recognizing spoken words, comprising the steps of: digitizing an analog speech signal representing an utterance of speech by sampling the analog speech signal at preselected intervals to generate digital speech data; grouping the samples of digital speech data into frames having a plurality of samples of digital speech data; transforming each frame of digital speech data into a plurality of speech parameters defining respective feature coefficients; comparing each of the plurality of speech parameters included in a respective speech frame with a preselected threshold value; assigning a first or a second value as a binary coefficient corresponding to the respective speech parameter depending upon whether the speech parameter is greater or less than the preselected threshold value corresponding thereto; assembling a plurality of said binary coefficients obtained from respective comparisons of all of the speech parameters included in a speech frame with preselected threshold values as a string of said binary coefficients representing a speech frame; arranging a plurality of speech frames, each comprising a plurality of binary coefficients, in consecutive order in a queue; providing a plurality of reference templates respectively representative of different words, each reference template having a plurality of frames of binary coefficients, wherein the reference template frames have a time duration twice as long as the speech frames of binary coefficients but are represented by the same number of binary coefficients; comparing alternate ones of the consecutive speech frames of binary coefficients as arranged in the queue with the reference templates, and generating error values indicating the magnitude of the differences therebetween; and selecting a reference template which generates the lowest error value as the recognized word.
Claim 26
Dependent Claim
56 words
The method as set forth in claim 20, further including shifting all speech frames already arranged in the queue one position within the queue in response to the insertion of a new speech frame into the queue during the filling of the queue to maintain the plurality of speech frames as arranged therein in consecutive order.
Claim 27
Dependent Claim
85 words
The method of claim 21, wherein the comparing of alternate ones of the consecutive speech frames of binary coefficients as arranged in the queue with the reference templates continues until all of the reference templates have been compared to the alternate speech frames of the queue; thereafter arranging a subsequent plurality of speech frames in consecutive order in a succeeding queue; and comparing alternate ones of the consecutive speech frames in the succeeding queue with the reference templates in the generation of said error values.
References Cited (Backward Citations)
US2575909A
Cited
US3225141A
Cited
US3322898A
Cited
US3647978A
Cited
US3943295A
Cited
US4181813A
Cited
US4780906A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1993-03-19 | 1993-09-18 | 1994-03-20 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-03-19 | 1997-09-18 | 1998-03-20 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-03-19 | 2001-09-18 | 2002-03-20 | $7700.00 | Window Closed / Lapsed |