Context free grammar engine for speech recognition system

• US 7,155,392 B2
• Filed: 02/07/2005
• Issued: 12/26/2006
• Est. Priority Date: 07/20/2000
• Status: Expired due to Fees

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Schmid, Philipp Heinz, Lipe, Ralph
• Primary Examiner(s): Dorvil, Richemond
• Assistant Examiner(s): Vo, Huyen X.
• Application Number:
  US11/052,449
• Publication Number:
  US 20050159960A1
• Time in Patent Office: 687 Days
• Field of Search: 704/4, 704/9, 704/10, 704231-232, 704/275, 704/257, 704/251, 704/255, 704/235, 704/246, 395/759
• US Class Current: 704/257
• CPC Class Codes: G10L 15/1822 Parsing for meaning understanding
• CPC Class Codes: G10L 15/193 Formal grammars, e.g. finite state automata, context free grammars or word networks
• CPC Class Codes: G10L 15/197 Probabilistic grammars, e.g. word n-grams
• CPC Class Codes: G10L 15/26 Speech to text systems G10L15/08 takes precedence
• CPC Class Codes: G10L 15/28 Constructional details of speech recognition systems
• CPC Class Codes: H04L 65/1101 Session protocols

Abstract

The present invention includes a context-free grammar (CFG) engine which communicates through an exposed interface with a speech recognition engine. The context-free grammar engine, in one illustrative embodiment, handles loading and unloading of grammars, as well as maintaining a desired activation state of the grammars which are loaded. Further, the CFG engine represents all loaded grammars, and their corresponding activation states, as a single grammar to the speech recognition engine.

Claims

1. A method of managing grammars used in a speech recognition system, comprising:

loading a first grammar in a context-free grammar(CFG) engine;

implementing an engine-independent SR interface between the CFG engine and a speech recognition (SR) engine;

communicating words in the first grammar to the SR engine through the SR interface;

notifying the SR engine, through the SR interface, of rules in the first grammar;

representing the rules in the first grammar to the SR engine through the SR interface;

receiving rule queries from the SR engine through the SR interface;

providing rule information to the SR engine, through the SR interface, the rule information enabling the SR engine to construct an internal representation of the first grammar; and

wherein providing the rule information includes providing a rule identifier, a rule level indicator indicating a level of a corresponding rule, state information representing states in the corresponding rule and transition information representing transitions in the corresponding rule.

2. The method of claim 1 and further comprising:

loading a second grammar in the CFG engine; and

representing the first and second grammars to the SR engine, through the SR interface, as a single grammar.

3. The method of claim 2 wherein representing the first and second grammars to the SR engine comprises:

communicating words in the second grammar to the SR engine through the SR interface;

notifying the SR engine, through the interface, of rules in the second grammar; and

representing the rules in the second grammar to the SR engine through the interface.

4. The method of claim 3 wherein communicating words in the second grammar to the SR engine comprises:

communicating only new words in the second grammar, not in the first grammar, to the SR engine through the SR interface.

5. The method of claim 1 and further comprising:

implementing an application-independent application interface between the CFG engine and an application.

6. The method of claim 5 and further comprising:

receiving an activation input from the application, through the application interface, indicating which of the rules are to be active; and

providing an activation indication from the CFG engine, through the interface, to the SR engine to indicate which of the rules are active, based on the activation input.

7. The method of claim 1 and further comprising:

determining in the CFG engine whether the first grammar refers to any additional grammars; and

if so, loading the additional grammars in the CFG engine.

8. The method of claim 7 and further comprising:

representing the first and additional grammars to the SR engine, through the SR interface, as a single grammar.

9. The method of claim 8 and further comprising:

communicating words in the additional grammars to the SR engine through the SR interface;

notifying the SR engine, through the SR interface, of rules in the additional grammars; and

representing the rules in the additional grammars to the SR engine through the SR interface.

10. The method of claim 1 wherein communicating words in the first grammar to the SR engine through the SR interface comprises:

providing a word handle to the SR engine identifying each word.

11. A computer readable medium including instructions which, when implemented by a computer, cause the computer to perform a method of managing grammars used in a speech recognition system, comprising:

loading a first grammar in a context-free grammar(CFG) engine;

implementing an engine-independent SR interface between the CFG engine and a speech recognition (SR) engine;

communicating words in the first grammar to the SR engine through the SR interface;

notifying the SR engine, through the SR interface, of rules in the first grammar; and

representing the rules in the first grammar to the SR engine through the SR interface;

receiving rule queries from the SR engine through the SR interface;

providing rule information to the SR engine, through the SR interface, the rule information enabling the SR engine to construct an internal representation of the first grammar; and

wherein providing the rule information includes providing a rule identifier, a rule level indicator indicating a level of a corresponding rule, state information representing states in the corresponding rule and transition information representing transitions in the corresponding rule.