6. The method of claim 5 comprising the further steps of: (h) repeating steps (c) through (g) for each word in a predefined script; and (j) recomputing the values of the probability items based on the most recent adjusted values of the counts after step (h).
6. The method of claim 5 comprising the further steps of: (h) repeating steps (c) through (g) for each word in a predefined script; and (j) recomputing the values of the probability items based on the most recent adjusted values of the counts after step (h). 7. The method of claim 6 wherein each transition probability item Pr(.tau..sub.i .vertline.S.sub.j) is defined as: ##EQU3## divided by ##EQU4## where Y is a string of labels; and wherein each label output probability item Pr(f.sub.h .vertline..tau..sub.i,S.sub.j) is defined as: EQU .SIGMA..sub.t:y.sbsb.t.sub.=f.sbsb.h Pr'(S.sub.j,.tau..sub.i .vertline.Y,t) divided by ##EQU5## where f.sub.h corresponds to a specific label selected from the alphabet of labels and y.sub.t corresponds to the label generated at a time interval t.