US5774628A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Speaker-independent dynamic vocabulary and grammar in speech recognition
Assignee: Texas Instruments Inc
•
Filing: 1995-04-10
•
Granted: 1998-06-30
•
Expires: 2015-04-10
Abstract
Abstract This is an automated speech recognition system, the system comprising: an input device for receiving voice signals; a means for computing the voice signals into stochastic RGDAGs and individual grammars; a search engine that directly processes the stochastic RGDAGs; a means for adding the individual grammars within the RGDAG; a means for replacing the individual grammars within the RGDAG; and a means for deleting the individual grammars within the RGDAG. The system can include a means for adding modified grammars within RGDAGs; a means for linking a terminal symbol from a first grammar to a start symbol in a second grammar; a means for finding a maximum depth of each symbol in the RGDAG; a means for determining if the system requires parse information for the grammar by looking for ancestor symbols; a means for specifing a plurality of RGs within the RGDAGs as starting points for the search engine; and a means for returning a parse through each of a plurality of RGs in the RGDAGs for a recognized utterance. Other devices, systems and methods are also disclosed.
Inventors
- 👤 Charles T. Hemphill
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 20:59
CPC Classifications
G; G10; G10L; G10L15/00; G10L15/08; G10L15/18; G10L15/183; G10L15/19; G10L15/193; G10L15/22; G10L2015/226; G10L2015/228
Claims Analysis
Total Claims: 23
Claim 1
Independent Claim
82 words
An automated speech recognition system, said system comprising: a. an input device for receiving voice signals; b. a means for computing said voice signals into at least one stochastic RGDAG (Regular Grammars Directed Acyclic Graph) and individual grammars; c. a search engine that directly processes said stochastic RGDAG; d. a means for adding said individual grammars within said RGDAG; e. a means for replacing said individual grammars within said RGDAG; and f. a means for deleting said individual grammars within said RGDAG.
Claim 2
Dependent Claim
82 words
An automated speech recognition system, said system comprising: a. an input device for receiving voice signals; b. a means for computing said voice signals into at least one stochastic RGDAG (Regular Grammars Directed Acyclic Graph) and individual grammars; c. a search engine that directly processes said stochastic RGDAG; d. a means for adding said individual grammars within said RGDAG; e. a means for replacing said individual grammars within said RGDAG; and f. a means for deleting said individual grammars within said RGDAG.
Claim 3
Dependent Claim
19 words
The system of claim 1, wherein said system further includes a means for adding modified grammars within an RGDAG.
Claim 4
Dependent Claim
29 words
The system of claim 1, wherein said system further includes a means for linking a terminal symbol from a first grammar to a start symbol in a second grammar.
Claim 5
Dependent Claim
23 words
The system of claim 1, wherein said system further includes a means for finding a maximum depth of each symbol in said RGDAG.
Claim 6
Dependent Claim
29 words
The system of claim 1, wherein said system further includes a means for determining if said system requires parse information for said individual grammars by looking for ancestor symbols.
Claim 7
Dependent Claim
29 words
The system of claim 1, wherein said system further includes a means for specifying a plurality of regular Grammars within said RGDAG as starting points for said search engine.
Claim 8
Dependent Claim
31 words
The system of claim 1, wherein said system further includes a means for returning a parse through each of a plurality of regular Grammars in said RGDAG for a recognized utterance.
Claim 9
Independent Claim
73 words
A method of speech recognition providing speaker independence and dynamic vocabularies and grammars, said method comprising: a. inputting device for receiving voice signals; b. computing said voice signals into at least one stochastic RGDAG (Regular Grammars Directed Acyclic Graph) and individual grammars; c. directly searching said stochastic RGDAG; d. adding said individual grammars within said RGDAG; e. replacing said individual grammars within said RGDAG; and f. deleting said individual grammars within said RGDAG.
Claim 10
Independent Claim
73 words
A method of speech recognition providing speaker independence and dynamic vocabularies and grammars, said method comprising: a. inputting device for receiving voice signals; b. computing said voice signals into at least one stochastic RGDAG (Regular Grammars Directed Acyclic Graph) and individual grammars; c. directly searching said stochastic RGDAG; d. adding said individual grammars within said RGDAG; e. replacing said individual grammars within said RGDAG; and f. deleting said individual grammars within said RGDAG.
Claim 11
Dependent Claim
15 words
The method of claim 8, wherein said method further includes adding modified grammars within RGDAG.
Claim 12
Dependent Claim
26 words
The method of claim 8, wherein said method further includes linking a terminal symbol from a first grammar to a start symbol in a second grammar.
Claim 13
Dependent Claim
20 words
The method of claim 8, wherein said method further includes finding a maximum depth of each symbol in said RGDAG.
Claim 14
Dependent Claim
26 words
The method of claim 8, wherein said method further includes determining if said method requires parse information for said individual grammar by looking for ancestor symbols.
Claim 15
Dependent Claim
26 words
The method of claim 8, wherein said method further includes specifying a plurality of regular grammars within said RGDAG as starting points for a search engine.
Claim 16
Dependent Claim
28 words
The method of claim 8, wherein said method further includes returning a parse through each of a plurality of regular grammars in said RGDAG for a recognized utterance.
Claim 17
Dependent Claim
83 words
A computer automated speech recognition system, said system comprising: a. an input device for receiving voice signals; b. a means for computing said voice signals into at least one stochastic RGDAG (Regular Grammars Directed Acyclic Graph) and individual grammars; c. a search engine that directly processes said stochastic RGDAG; d. a means for adding said individual grammars within said RGDAG; e. a means for replacing said individual grammars within said RGDAG; and f. a means for deleting said individual grammars within said RGDAG.
Claim 18
Dependent Claim
83 words
A computer automated speech recognition system, said system comprising: a. an input device for receiving voice signals; b. a means for computing said voice signals into at least one stochastic RGDAG (Regular Grammars Directed Acyclic Graph) and individual grammars; c. a search engine that directly processes said stochastic RGDAG; d. a means for adding said individual grammars within said RGDAG; e. a means for replacing said individual grammars within said RGDAG; and f. a means for deleting said individual grammars within said RGDAG.
Claim 19
Dependent Claim
18 words
The system of claim 15, wherein said system further includes a means for adding modified grammars within RGDAG.
Claim 20
Dependent Claim
29 words
The system of claim 15, wherein said system further includes a means for linking a terminal symbol from a first grammar to a start symbol in a second grammar.
Claim 21
Dependent Claim
23 words
The system of claim 15, wherein said system further includes a means for finding a maximum depth of each symbol in said RGDAG.
Claim 22
Dependent Claim
29 words
The system of claim 15, wherein said system further includes a means for determining if said system requires parse information for said individual grammars by looking for ancestor symbols.
Claim 23
Dependent Claim
29 words
The system of claim 15, wherein said system further includes a means for specifying a plurality of regular grammars within said RGDAG as starting points for said search engine.
References Cited (Backward Citations)
US4156868A
Cited
US5509104A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-06-29 | 2001-12-29 | 2002-06-30 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-06-29 | 2005-12-29 | 2006-06-30 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-06-29 | 2009-12-29 | 2010-06-30 | $7700.00 | Window Closed / Lapsed |