SPTRANSITIONTYPE
Other versions of this page are also available for the following:
.gif "A hyphen indicates that the information in this topic is not relevant for this platform, or that the platform does not support the API that is listed.")
.gif "A checkmark indicates that the information in this topic is relevant for this platform, and that any API listed is also supported on this platform.")
8/28/2008
This enumeration defines grammar rule transitions from a CFG state. An SR engine uses the transitions to find out the full contents of a rule. A transition is represented by an SPTRANSITIONENTRY structure.
Syntax
typedef enum SPTRANSITIONTYPE{
SPTRANSEPSILON,
SPTRANSWORD,
SPTRANSRULE,
SPTRANSTEXTBUF,
SPTRANSWILDCARD,
SPTRANSDICTATION
} SPTRANSITIONTYPE;
Elements
- SPTRANSEPSILON
Epsilon transition. This is a null transition that can occur without recognizing anything.
- SPTRANSWORD
Word transition. This transition represents single words that the recognizer will recognize before advancing to the next state. To produce recognition results, the engine needs to keep track of the transition identifiers for word transitions.
- SPTRANSRULE
Rule transition, representing a transition into sub-rules. This transition type is only used when a path through the sub-rule is recognized. Note that rules can be recursive (not left-recursive). The end of a rule is indicated by a state having a transition to a null state handle. There can also be void states, which are blocking and indicate that there is no recognition path from the state. Void states are indicated by a state having zero transitions out of it.
- SPTRANSTEXTBUF
Text buffer transition.
- SPTRANSWILDCARD
Wildcard transition.
- SPTRANSDICTATION
Dictation transition.
Requirements
| Header | sapiddk.h, sapiddk.idl |
| Windows Embedded CE | Windows CE .NET 4.1 and later |