US5222187A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Grammar-based checksum constraints for high performance speech recognition circuit
Assignee: Texas Instruments Inc
•
Filing: 1989-12-29
•
Granted: 1993-06-22
•
Expires: 2009-12-29
Abstract
Abstract A speech system recognizes words from a spoken phrase that conform to checksum constraints. Grammar rules are applied to hypothesize words according to the checksum constraints. The checksum associated with the phrase is thus inherent in the grammar. Sentences which do not meet a predetermined checksum constraint are not valid under the grammar rules and are therefore inherently rejected. The checksum constraints result in increased recognition accuracy.
Inventors
- 👤 George R. Doddington
- 👤 Charles T. Hemphill
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 13:52
CPC Classifications
G; G10; G10L; G10L15/00; G10L15/08; G10L15/18; G10L15/183; G10L15/19; G10L15/193; G10L17/00; G10L17/22
Claims Analysis
Total Claims: 36
Claim 1
Independent Claim
48 words
A method of recognizing speech comprising the steps of: receiving spoken input; observing words from said spoken input; conforming a sequence of said observed words to one or more checksum constraints; and recognizing said conformed sequence by controlling such speech recognition with a grammar embedding said checksum constraints.
Claim 2
Independent Claim
48 words
A method of recognizing speech comprising the steps of: receiving spoken input; observing words from said spoken input; conforming a sequence of said observed words to one or more checksum constraints; and recognizing said conformed sequence by controlling such speech recognition with a grammar embedding said checksum constraints.
Claim 3
Dependent Claim
46 words
The method of claim 1 wherein said recognizing step includes the steps of: hypothesizing words from said spoken input to form a hypothesized phrase; and applying a grammar rule to said hypothesized words, said grammar rule operable to implement a checksum constraint on the hypothesized phrase.
Claim 4
Dependent Claim
12 words
The method of claim 2 wherein each hypothesized word comprises a number.
Claim 5
Dependent Claim
43 words
The method of claim 2 wherein said step of applying includes the step of applying a grammar rule associated with a first state and with said hypothesized words such that a second state is determined, said second state indicative of a checksum value.
Claim 6
Dependent Claim
29 words
The method of claim 2 and further comprising the step of computing a probability for each hypothesized word to aid implementation of said checksum constraint on said hypothesized phrase.
Claim 7
Dependent Claim
25 words
The method of claim 1 wherein said controlling step comprises the step of controlling the speech recognition using a finite-state automaton embedding said checksum constraints.
Claim 8
Dependent Claim
25 words
The method of claim 1 wherein said controlling step comprises the step of controlling the speech recognition using a unification grammar embedding said checksum constraints.
Claim 9
Dependent Claim
52 words
Circuitry for recognizing speech comprising: circuitry for receiving spoken input; circuitry for observing words from said spoken input; circuitry for conforming a sequence of said observed words to one or more checksum constraints; and circuitry for recognizing said conformed sequence by controlling such speech recognition with a grammar embedding said checksum constraints.
Claim 10
Dependent Claim
52 words
Circuitry for recognizing speech comprising: circuitry for receiving spoken input; circuitry for observing words from said spoken input; circuitry for conforming a sequence of said observed words to one or more checksum constraints; and circuitry for recognizing said conformed sequence by controlling such speech recognition with a grammar embedding said checksum constraints.
Claim 11
Dependent Claim
44 words
The circuitry of claim 8 wherein said recognizing circuitry comprises: circuitry for hypothesizing words from said spoken input to form a hypothesized phrase; and circuitry for applying a grammar rule to said hypothesized words operable to implement a checksum constraint on the hypothesized phrase.
Claim 12
Dependent Claim
16 words
The circuitry of claim 9 wherein said circuitry for hypothesizing words comprises circuitry for hypothesizing numbers.
Claim 13
Dependent Claim
41 words
The circuitry of claim 9 wherein said applying circuitry comprises circuitry for applying a grammar rule associated with a first state and with an observed word such that a second state is determined, said second state indicative of a checksum value.
Claim 14
Dependent Claim
28 words
The circuitry of claim 9 and further comprising circuitry for computing a probability for each hypothesized work to aid implementation of said checksum constraint on said hypothesized phrase.
Claim 15
Dependent Claim
24 words
The circuitry of claim 8 wherein said controlling circuitry comprisess circuitry for controlling the speech recognition using a finite-state grammar embedding said checksum constraints.
Claim 16
Dependent Claim
23 words
The circuitry of claim 8 wherein said controlling circuitry comprises circuitry for controlling the speech recognition using a unification grammar embedding said constraints.
Claim 17
Independent Claim
88 words
A method of recognizing speech from a spoken phrase comprising a plurality of words in a grammar-based system, comprising the steps of: receiving said spoken phrase; activating a first state; hypothesizing a word from the spoken phrase; applying a grammar rule associated with said first state to said hypothesized word and an observed word such that a second state is determined, said second state indicative of a checksum value; and recognizing speech by controlling such speech recognition with a grammar embedding checksum constraints which employ said checksum value.
Claim 18
Independent Claim
88 words
A method of recognizing speech from a spoken phrase comprising a plurality of words in a grammar-based system, comprising the steps of: receiving said spoken phrase; activating a first state; hypothesizing a word from the spoken phrase; applying a grammar rule associated with said first state to said hypothesized word and an observed word such that a second state is determined, said second state indicative of a checksum value; and recognizing speech by controlling such speech recognition with a grammar embedding checksum constraints which employ said checksum value.
Claim 19
Dependent Claim
12 words
The method of claim 15 wherein each hypothesized word comprises a number.
Claim 20
Dependent Claim
58 words
The method of claim 15 and further comprising the steps of: repeating said steps of hypothesizing and applying until the end of the spoken phrase is reached, wherein said steps of hypothesizing words and applying associated grammar rules thereto are performed in order to determine states associated with a next word position and respective of said hypothesized words.
Claim 21
Dependent Claim
26 words
The method of claim 17 and further comprising the step of computing a probability for each hypothesized phrase to aid in said step of recognizing speech.
Claim 22
Dependent Claim
20 words
The method of claim 18 and further comprising activating each of said determined successive states after applying the grammar rule.
Claim 23
Dependent Claim
31 words
The method of claim 19 and further comprising the step of comparing the probabilities of hypothetical phrases when a determined state has previously been activated in conjunction with another hypothesized phrase.
Claim 24
Dependent Claim
57 words
The method of claim 15 wherein said step of hypothesizing further comprises hypothesizing phrases of successive said hypothesized words from said spoken phrase; and said step of applying further comprises applying grammar rules to each of said successive hypothesized words to determine successive states associated with successive word positions, each successive state indicative of a checksum value.
Claim 25
Dependent Claim
14 words
The method of claim 21 wherein each hypothesized phrase comprises a plurality of numbers.
Claim 26
Dependent Claim
26 words
The method of claim 15 and further comprising the step of computing a probability for each hypothesized word to aid in said step of recognizing speech.
Claim 27
Dependent Claim
13 words
The method of claim 15 wherein said grammar rules comprise finite-state automaton transitions.
Claim 28
Dependent Claim
13 words
The method of claim 15 wherein said grammar rules comprise unification grammar rules.
Claim 29
Dependent Claim
75 words
Circuitry for recognizing speech from a spoken phrase comprising a plurality of words, comprising: circuitry for hypothesizing words from the spoken phrase; circuitry for applying grammar rules to determine a transition from a source state to a destination state responsive to a hypothesized word, such that a checksum may be determined from said destination state; and circuitry for recognizing speech by controlling such speech recognition with a grammar embedding checksum constraints by employing said checksum.
Claim 30
Dependent Claim
75 words
Circuitry for recognizing speech from a spoken phrase comprising a plurality of words, comprising: circuitry for hypothesizing words from the spoken phrase; circuitry for applying grammar rules to determine a transition from a source state to a destination state responsive to a hypothesized word, such that a checksum may be determined from said destination state; and circuitry for recognizing speech by controlling such speech recognition with a grammar embedding checksum constraints by employing said checksum.
Claim 31
Dependent Claim
12 words
The circuitry of claim 26 wherein each hypothesized work comprises a number.
Claim 32
Dependent Claim
31 words
The circuitry of claim 26 wherein each state is associated with a work position within a hypothesized phrase comprised of successive hypothesized words and a checksum value for the hypothesized phrase.
Claim 33
Dependent Claim
22 words
The circuitry of claim 28 wherein said hypothesizing circuitry is operable to hypothesize a plurality of hypothesized phrases for each spoken phrase.
Claim 34
Dependent Claim
24 words
The circuitry of claim 29 and further comprising circuitry for computing a probability for each hypothesized work to aid said circuitry for recognizing speech.
Claim 35
Dependent Claim
24 words
The circuitry of claim 30 and further comprising circuitry for computing a probability for each hypothesized phrase to aid said circuitry for recognizing speech.
Claim 36
Dependent Claim
27 words
The circuitry of claim 29 and further comprising circuitry for computing a probabilities of hypothetical phrases having a common destination state to aid said circuitry for recognizing.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-06-21 | 1996-12-21 | 1997-06-22 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-06-21 | 2000-12-21 | 2001-06-22 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-06-21 | 2004-12-21 | 2005-06-22 | $7700.00 | Window Closed / Lapsed |