DocumentCode :
1115928
Title :
The Sensitivity of the Modified Viterbi Algorithm to the Source Statistics
Author :
Shinghal, Rajjan ; Toussaint, Godfried T.
Author_Institution :
Department of Computer Science, Concordia University, Montreal, P.Q., Canada.
Issue :
2
fYear :
1980
fDate :
3/1/1980 12:00:00 AM
Firstpage :
181
Lastpage :
185
Abstract :
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.
Keywords :
Computer science; Entropy; Markov processes; Natural languages; Pattern recognition; Robustness; Statistical distributions; Statistics; Text recognition; Viterbi algorithm; Character recognition; Markov process; Viterbi algorithm; contextural information; entropy; natural language statistics; robustness tests; text processing;
fLanguage :
English
Journal_Title :
Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publisher :
ieee
ISSN :
0162-8828
Type :
jour
DOI :
10.1109/TPAMI.1980.4766998
Filename :
4766998
Link To Document :
بازگشت