EP0618565A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Interactive dynamic grammar constraint in speech recognition
Assignee: International Business Machines Corp
•
Filing: 1994-01-14
•
Granted: —
•
Expires: 2014-01-14
Abstract
Abstract An interactive dynamic constraint speech recognition method and system. The method employs a speech pattern database (27) which is used to compile an updated grammar graph (32, 35). The grammar graph is constrained to the available word choices based on inputs from an external system application. The grammar graph used within the recognition processor (47) is dynamically recompiled to reflect the currently available vocabulary. <IMAGE>
Inventors
- 👤 Liam P. Corballis
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-31 05:41
CPC Classifications
G; G10; G10L; G10L15/00; G10L15/08; G10L15/18; G10L15/183; G10L15/19; G10L15/193; G10L15/06; G10L15/063; G10L2015/0638; G10L15/22; G10L2015/226; G10L2015/228
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
121 words
A speech recognition system employing interactive dynamic grammar constraints comprising: a speech pattern database (27) containing a speech recognition vocabulary; a controller (17) interfacing with an external speech recognition application running in a real-time environment (10); a compiler (22) for generating an available grammar graph (32, 35) based on inputs from said external application; storage means for storing said compiled grammar graph in a memory location; a recognition processor (47) for analyzing a speech pattern received by said external application by comparison with the contents of said grammar graph and outputting a recognition result to said external application; wherein said grammar graph is updated by periodic recompilation based on real-time environment conditions of said external application to constrain the available vocabulary.
Claim 2
Dependent Claim
21 words
The system of claim 1 wherein a single grammar graph (32 or 35) is used in conjunction with the recognition processor.
Claim 3
Dependent Claim
52 words
The system of claim 1 wherein two grammar graphs (32 and 35) are sequentially updated and having a switch (40) to connect one or the other said grammar graph to the recognition processor (47), the contents of each of said grammar graphs being updated only when not connected to said recognition processor.
Claim 4
Dependent Claim
20 words
The system of claim 1 wherein the compiler (22) expunges vocabulary no longer available for use by the external application.
Claim 5
Independent Claim
92 words
A method for dynamically constraining the vocabulary in a speech recognition system comprising the steps of: receiving input information regarding the available active vocabulary from an external application (10); compiling the input information with a speech pattern database (27) to obtain a grammar graph (32, 35) representing the active vocabulary; using said grammar graph in a recognition processor (47) to analyze speech; periodically updating said grammar graph based on the changing input information received from said external application to obtain a interactive dynamic constrained speech vocabulary for providing high accuracy speech recognition.
Claim 6
Dependent Claim
52 words
The method of claim 5 further comprising: sequentially updating one or two grammar graphs (32, 35), the updating occurring only when said grammar graph is not connected to the recognition processor (47); and switching the connection between one grammar graph (e. g. 32) and the other (e. g. 35) between recognition processing.
Claim 7
Dependent Claim
17 words
The method of claim 5 including expunging inactive vocabulary from the grammar graph (32, 35) during compilation.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.