1. A rejection grammar process for use in speech recognition of an utterance comprising the steps of: selecting a digitized sub-list of phoneme models from a digitized list of phoneme models in a language, presenting a digitized sequential representation of the utterance to the rejection grammar process, and calculating a first set of probabilities indicating how well the digitized sequential representation of the utterance matches sequential combinations, or paths, of the digitized sub-list of phoneme models.
1. A rejection grammar process for use in speech recognition of an utterance comprising the steps of: selecting a digitized sub-list of phoneme models from a digitized list of phoneme models in a language, presenting a digitized sequential representation of the utterance to the rejection grammar process, and calculating a first set of probabilities indicating how well the digitized sequential representation of the utterance matches sequential combinations, or paths, of the digitized sub-list of phoneme models. 6. The rejection grammar process of claim 1, wherein generating the selected digitized list of phoneme models comprises the steps of: (a) compiling a list of all phoneme models in the language; (b) creating a test set test digitized sequential representations of utterances, with known acceptable and rejectable parts thereof; (c) determining and counting the phoneme models found in the accumulated false rejections list; (d) forming an ordered list, starting with the highest quantity, of said models of phonemes found in part (d) (e) deleting a selected number of phoneme models from the beginning of the ordered list leaving another, smaller, selected digitized list of phoneme models; and (f) repeating steps (c) thru (f) as long as the statistics of the rejection grammar process continue to improve over the prior determined statistics.