Context free grammar engine for speech recognition system

• US 7,206,742 B2
• Filed: 12/07/2005
• Issued: 04/17/2007
• Est. Priority Date: 07/20/2000
• Status: Expired due to Term

• 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/296,074
• Publication Number:
  US 20060085193A1
• Time in Patent Office: 496 Days
• Field of Search: 704/257, 704/275, 704/8, 704/9, 704/270, 704/10, 704/231, 704/232, 704/242, 704/270.1, 704/236, 704/256
• 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 parsing a speech recognition result from a speech recognition (SR) engine, comprising:

sending grammar rules from a context-free grammar (CFG) engine to the SR engine in response to a query from the SR engine through an SR interface, implemented by methods on an interface component used by the CFG engine, that supports multiple different SR engines;

receiving the result from the SR engine at the CFG engine wherein receiving the result comprises;

receiving a rule identifier identifying a rule in a CFG that spawned the result; and

receiving a plurality of transition identifiers identifying transitions through the rule that spawned the result;

parsing the result at the CFG engine to obtain a parsed result by constructing an indication of a parse tree based on the rule identifier and the plurality of transition identifiers;

providing the indication of the parse tree from the CFG engine to an application through the application interface; and

providing the parsed result to an application from the CFG engine through an application interface, implemented by methods on the interface component, that support multiple different applications.

2. The method of claim 1 wherein sending grammar rules comprises:

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

sending rule information to the SR engine, through the SR interface, the rule information enabling the SR engine to construct an internal representation of a first grammar.

3. The method of claim 2 wherein sending 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.

4. The method of claim 3 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.

5. The method of claim 4 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.

6. The method of claim 5 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.

7. The method of claim 6 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.

8. The method of claim 7 and further comprising:

receiving from the application, through the application interface, a change indication, indicating a change to the first grammar; and

determining, in the CFG engine, whether content of a rule in the first grammar is to be changed, based on the change indication; and

if so, providing an invalidation indication to the SR engine, through the SR interface, indicating the first grammar is to be invalidated.

9. The method of claim 8 and further comprising:

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

in response to the queries, providing word and rule information to the SR engine through the SR interface, the word and rule information enabling the SR engine to construct an internal representation of the first grammar with the change.

10. The method of claim 9 and further comprising:

if the content of a rule in the first grammar is not to be changed, but a word or rule is to be added, providing an indication to the SR engine through the SR interface to add the word or rule to the SR engine.

11. The method of claim 2 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.

12. The method of claim 11 and further comprising:

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

13. The method of claim 12 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.