System, method and computer program product for damage control during large-scale address speech recognition

• US 20020099544A1
• Filed: 06/26/2001
• Published: 07/25/2002
• Est. Priority Date: 01/24/2001
• Status: Abandoned Application

• Current Assignee: Bevocal Incorporated (Microsoft Corporation)
• Original Assignee: Bevocal Incorporated (Microsoft Corporation)
• Inventors: Damiba, Bertrand A., Levitt, Benjamin J.
• Application Number:
  US09/894,164
• Publication Number:
  US 20020099544A1
• Time in Patent Office: Days
• US Class Current: 704/247
• CPC Class Codes: G10L 15/1815 Semantic context, e.g. disambiguation of the recognition hypotheses based on word meaning

Abstract

A system, method and computer program product are provided for recognizing utterances. Initially, an utterance is received including at least two components. Matches are identified between each of the components of the utterance and grammars. Each instance of a match of a first one of the components is then combined with each instance of a match of a second one of the components to generate a plurality of grammar expressions. In operation, the received utterance is recognized utilizing the grammar expressions.

Claims

1. A method for recognizing utterances, comprising:

(a) receiving an utterance including at least two components;

(b) identifying matches between each of the components of the utterance and grammars;

(c) combining each instance of a match of a first one of the components with each instance of a match of a second one of the components to generate a plurality of grammar expressions; and

(d) recognizing the received utterance utilizing the grammar expressions.

2. The method as recited in claim 1, and further comprising discarding duplicate grammar expressions.

3. The method as recited in claim 1, and further comprising assigning a score to each of the grammar expressions.

4. The method as recited in claim 3, and further comprising playing back the grammar expressions in a priority based on the score.

5. The method as recited in claim 3, wherein a score-based priority of the grammar expressions is stored in a list.

6. The method as recited in claim 1, and further comprising playing back the grammar expressions.

7. The method as recited in claim 6, wherein a user is capable of rejecting the played back grammar expressions.

8. The method as recited in claim 7, wherein the previously rejected grammar expressions are discarded.

9. The method as recited in claim 7, wherein the rejected grammar expressions are stored in a list.

10. The method as recited in claim 1, wherein the utterance is representative of at least a portion of an address.

11. The method as recited in claim 10, and further comprising comparing the grammar expressions with a database of addresses.

12. The method as recited in claim 11, wherein the grammar expressions are filtered based on the comparison using the database of addresses.

13. The method as recited in claim 12, and further comprising outputting the grammar expressions based on the comparison.

14. The method as recited in claim 10, wherein the components of the utterance include a city and a state of the address.

15. The method as recited in claim 10, wherein the components of the utterance include a street name and an address number of the address.

16. The method as recited in claim 10, wherein the components of the utterance include two street names describing an intersection.

17. The method as recited in claim 11, and further comprising caching results of the comparison.

18. The method as recited in claim 17, wherein the cached results are used for recognizing subsequent utterances.

19. A computer program product for recognizing utterances, comprising:

(a) computer code for receiving an utterance including at least two components;

(b) computer code for identifying matches between each of the components of the utterance and grammars;

(c) computer code for combining each instance of a match of a first one of the components with each instance of a match of a second one of the components to generate a plurality of grammar expressions; and

(d) computer code for recognizing the received utterance utilizing the grammar expressions.

20. A system for recognizing utterances, comprising:

(a) logic for receiving an utterance including at least two components;

(b) logic for identifying matches between each of the components of the utterance and grammars;

(c) logic for combining each instance of a match of a first one of the components with each instance of a match of a second one of the components to generate a plurality of grammar expressions; and

(d) logic for recognizing the received utterance utilizing the grammar expressions.

21. A method for recognizing utterances, comprising:

(a) receiving an utterance indicative of an address;

(b) recognizing the received utterance;

(c) comparing results of the recognition with a database of addresses; and

(d) discarding the results if the comparison fails.

22. A computer program product for recognizing utterances, comprising:

(a) computer code for receiving an utterance indicative of an address;

(b) computer code for recognizing the received utterance;

(c) computer code for comparing results of the recognition with a database of addresses; and

(d) computer code for discarding the results if the comparison fails.

23. A method for recognizing utterances, comprising:

(a) receiving an utterance including at least two components, wherein the utterance is indicative of content;

(b) identifying matches between each of the components of the utterance and grammars;

(c) combining each instance of a match of a first one of the components with each instance of a match of a second one of the components to generate a plurality of grammar expressions;

(d) scoring the grammar expressions;

(e) recognizing the received utterance utilizing the grammar expressions;

(f) comparing results of operation (e) with a database of the content; and

(g) discarding the results based on the score and the comparison.