This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Sensitivity of the Modified Viterbi Algorithm to the Source Statistics
February 1980 (vol. 2 no. 2)
pp. 181-185
Rajjan Shinghal, Department of Computer Science, Concordia University, Montreal, P.Q., Canada.
Godfried T. Toussaint, School of Computer Science, McGill University, Montreal, P.Q., Canada.
The modified Viterbi algorithm is a powerful, and increasingly used, tool for using contextual information in text recognition in its various forms. As yet, no known studies have been published concerning its robustness with respect to source statistics. This paper describes experiments performed to determine the sensitivity of the algorithm to variations in source statistics. The results of the experiments show that a character-recognition machine incorporating the modified Viterbi algorithm, using N-gram statistics estimated from source A does not deteriorate in performance when operating on a passage from source B even if A and B differ significantly in N-gram distributions or entropy.
Citation:
Rajjan Shinghal, Godfried T. Toussaint, "The Sensitivity of the Modified Viterbi Algorithm to the Source Statistics," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 2, no. 2, pp. 181-185, Feb. 1980, doi:10.1109/TPAMI.1980.4766998
Usage of this product signifies your acceptance of the Terms of Use.