An Example Script Algorithm Used With Generic Recognition
Note | This algorithm does not describe all the input and output parameters, only the ones relevant to demonstrate n-best recognition. |
Procedure
Step 1 | Use the Generic Recognition step. Input: UserGrammar (for example, An Example Grammar Used With Generic Recognition.) Output: resultData (a private variable that contains the recognition result) resultCount (the number of results in the resultData) | ||
Step 2 | Set integer i = 0. This variable is used to index into the resultData and varies from 0 to one less than the number of results obtained in step 1. | ||
Step 3 | While (i)
| ||
Step 4 | End. With the example grammar and example script logic as described in this section and the preceding one, if a customer says "cisco", the customer may get back a recognition result containing three results: "cisco", "tisco" and "misco" respectively. Each of these results represents a different utterance and can have a different confidence level.
|