Experiments in Text Recognition with the Modified Viterbi Algorithm

In this paper a modification of the Viterbi algorithm is formally described, and a measure of its complexity is derived. The modified algorithm uses aheuristic to limit the search through a directed graph or trellis. The effectiveness of the algorithm is investigated via exhaustive experimentation on an input of machine-printed text. The algorithm assumes language to be a Markov chain and uses transition probabilities between characters. The results empirically answer the long-standing question of what is the benefit, if any, of using transition probabilities that depend on the length of a word and their position in it.

[1]  Godfried T. Toussaint,et al.  Use of Contextual Constraints in Recognition of Contour-Traced Handprinted Characters , 1970, IEEE Transactions on Computers.

[2]  David L. Neuhoff,et al.  The Viterbi algorithm as an aid in text recognition (Corresp.) , 1975, IEEE Trans. Inf. Theory.

[3]  R. L. Kashyap,et al.  A new method for error correction in strings with applications to spoken word recognition , 1977 .

[4]  W. R. Garner.  Uncertainty and structure as psychological concepts , 1975 .

[5]  Allen R. Hanson,et al.  Context in word recognition , 1976, Pattern Recognition.

[6]  W. W. Bledsoe,et al.  Pattern recognition and reading by machine , 1959, IRE-AIEE-ACM '59 (Eastern).

[7]  Ronald W. Cornew,et al.  A Statistical Method of Spelling Correction , 1968, Inf. Control..

[8]  R. Shinghal,et al.  SIMPLIFIED HEURISTIC VERSION OF A RECURSIVE BAYES ALGORITHM FOR USING CONTEXT IN TEXT RECOGNITION. , 1978 .

[9]  Charles M. Vossler,et al.  The use of context for correcting garbled English text , 1964, ACM National Conference.

[10]  Richard O. Duda,et al.  Experiments in the recognition of hand-printed text, part II: context analysis , 1968, AFIPS '68 (Fall, part II).

[11]  Josef Raviv,et al.  Decision making in Markov chains applied to the problem of pattern recognition , 1967, IEEE Trans. Inf. Theory.

[12]  Rajjan Shinghal.  Using contextual information to improve performance of character recognition machines. , 1977 .

[13]  F. Jelinek,et al.  Continuous speech recognition by statistical methods , 1976, Proceedings of the IEEE.

[14]  Gary Carlson,et al.  Techniques for replacing characters that are garbled on input , 1899, AFIPS '66 (Spring).

[15]  Godfried T. Toussaint,et al.  The use of context in pattern recognition , 1978, Pattern Recognit..