Issue No. 05 - May (1982 vol. 4)
Jonathan J. Hull , Department of Computer Science, State University of New York at Buffalo, Amherst, NY 14226.
Sargur N. Srihari , Department of Computer Science, State University of New York at Buffalo, Amherst, NY 14226.
The binary n-gram and Viterbi algorithms have been suggested as alternative approaches to contextual postprocessing for text produced by a noisy channel such as an optical character recognizer. This correspondence describes the underlying theory of each approach in unified terminology, and presents new implementation algorithms for each approach. In particular, a storage efficient data structure is proposed for the binary n-gram algorithm and a recursive formulation is given for the Viterbi algorithm. Results of extensive experiments with each algorithm are described.
J. J. Hull and S. N. Srihari, "Experiments in Text Recognition with Binary n-Gram and Viterbi Algorithms," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 4, no. , pp. 520-530, 1982.