Method for processing initially recognized speech in a speech recognition session

• US 20020133346A1
• Filed: 03/16/2001
• Published: 09/19/2002
• Est. Priority Date: 03/16/2001
• Status: Active Grant

• Current Assignee: Nuance Communications, Inc. (Microsoft Corporation)
• Original Assignee: International Business Machines Corporation
• Inventors: Lewis, James R., Michelini, Vanessa V., Zabolotskaya, Margarita, Kemble, Kimberlee A.
• Granted Patent: US 7,072,837 B2
• Time in Patent Office: Days
• US Class Current: 704/257
• CPC Class Codes: G10L 15/19 Grammatical context, e.g. disambiguation of the recognition hypotheses based on word sequence rules
• CPC Class Codes: G10L 15/32 Multiple recognisers used in sequence or in parallel; Score combination systems therefor, e.g. voting systems

Abstract

In a speech recognition session, a method of speech processing utilizing a plurality of grammars can include a series of steps. The method can include spawning a separate thread of execution corresponding to each one of a plurality grammars and allocating a post-processing recognition task to each separate thread of execution. Each post-processing recognition task can produce a possible recognition result using the corresponding grammar. A possible recognition result produced by one of the post-processing recognition tasks can be identified.

Claims

1. In a speech recognition session, a method of speech processing utilizing a plurality of grammars, said method comprising:

spawning a separate thread of execution corresponding to each one of said plurality grammars;

allocating a post-processing recognition task to each said separate thread of execution, each said post-processing recognition task producing a possible recognition result using said corresponding grammar; and

identifying a possible recognition result produced by one of said post-processing recognition tasks.

2. The method of claim 1, further comprising determining a confidence score for each said possible recognition result.

3. The method of claim 2, wherein said identifying step identifies a possible recognition result having the highest confidence score.

4. The method of claim 1, further comprising assigning a unique priority code to each one of said plurality of grammars.

5. The method of claim 4, wherein said identifying step identifies a possible recognition result produced using one of said plurality of grammars having a particular unique priority code.

6. The method of claim 1, wherein said grammar is a grammar subset.

7. The method of claim 1, wherein said grammar is a group of grammar subsets.

8. A machine readable storage, having stored thereon a computer program having a plurality of code sections executable by a machine for causing the machine to perform the steps of:

spawning a separate thread of execution corresponding to each one of a plurality grammars;

allocating a post-processing recognition task to each said separate thread of execution, each said post-processing recognition task producing a possible recognition result using said corresponding grammar; and

identifying a possible recognition result produced by one of said post-processing recognition tasks.

9. The machine readable storage of claim 8, further comprising determining a confidence score for each said possible recognition result.

10. The machine readable storage of claim 9, wherein said identifying step identifies a possible recognition result having the highest confidence score.

11. The machine readable storage of claim 8, further comprising assigning a unique priority code to each one of said plurality of grammars.

12. The machine readable storage of claim 11, wherein said identifying step identifies a possible recognition result produced using one of said plurality of grammars having a particular unique priority code.

13. The machine readable storage of claim 8, wherein said grammar is a grammar subset.

14. The machine readable storage of claim 8, wherein said grammar is a group of grammar subsets.