Speech recognition using a state-and-transition based binary speech grammar with a last transition value
First Claim
Patent Images
1. A computer-readable storage medium having encoded thereon computer-executable instructions that cause a processor to perform steps comprising:
- receiving a speech signal;
accessing a data structure stored in memory to identify possible transitions from a state, the data structure representing a state-and-transition-based description of a speech grammar, the data structure comprising;
a first transition entry representing a transition from a first state;
a second transition entry representing a second transition from the first state, the second transition entry being contiguous with the first transition entry and having a last-transition value set to indicate that the second transition is the last transition from the first state;
using the possible transitions from a state stored in the data structure to identify sequences of phonetic units represented by the speech signal.
1 Assignment
0 Petitions
Accused Products
Abstract
A computer-loadable data structure is provided that represents a state-and-transition-based description of a speech grammar. The data structure includes first and second transition entries that both represent transitions from a first state. The second transition entry is contiguous with the first transition entry in the data structure and includes a last-transition value. The last-transition value indicates that the second transition is the last transition from the first state in the data structure.
19 Citations
11 Claims
-
1. A computer-readable storage medium having encoded thereon computer-executable instructions that cause a processor to perform steps comprising:
-
receiving a speech signal; accessing a data structure stored in memory to identify possible transitions from a state, the data structure representing a state-and-transition-based description of a speech grammar, the data structure comprising; a first transition entry representing a transition from a first state; a second transition entry representing a second transition from the first state, the second transition entry being contiguous with the first transition entry and having a last-transition value set to indicate that the second transition is the last transition from the first state; using the possible transitions from a state stored in the data structure to identify sequences of phonetic units represented by the speech signal. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A method comprising:
-
providing a speech signal to a speech recognition engine executed by a processor; reading a next transition index from a transition entry in a state-and-transition-based binary grammar stored in a system memory accessible by the processor; reading information from each transition entry from the transition entry indexed by the next transition index to a transition entry that includes a last field flag that indicates that it is the last transition entry for a state, to obtain information for each transition that extends from the state; and using the information read from the transition entries to decode the speech signal into text. - View Dependent Claims (7, 8, 9, 10, 11)
-
Specification