10. The method as defined in claim 9 wherein the co-articulation problem exists, and wherein the method further comprises: scanning the plurality of possible numeric sequences included in the N-best list for the at least two potentially co-articulated tokens, the scanning being accomplished in order starting from a second highest ranked possible numeric sequence to a lowest ranked possible numeric sequence; and selecting one of the scanned possible numeric sequences when a difference between the confidence score of the selected possible numeric sequence and that of the highest ranked numeric sequence falls within a predetermined threshold.
10. The method as defined in claim 9 wherein the co-articulation problem exists, and wherein the method further comprises: scanning the plurality of possible numeric sequences included in the N-best list for the at least two potentially co-articulated tokens, the scanning being accomplished in order starting from a second highest ranked possible numeric sequence to a lowest ranked possible numeric sequence; and selecting one of the scanned possible numeric sequences when a difference between the confidence score of the selected possible numeric sequence and that of the highest ranked numeric sequence falls within a predetermined threshold. 13. The method as defined in claim 10 wherein when the selected possible numeric sequence is determined to be incorrect, the method further comprises: selecting an other of the scanned possible numeric sequences, the other possible numeric sequence ranked lower in the N-best list than a previously selected possible numeric sequence; and reciting the other selected possible numeric sequence to the source of the utterance.