Issue No. 06 - June (1982 vol. 4)
Radmilo Bozinovic , 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.
This paper deals with a method of estimating a correct string X from its noisy version Y produced by a cursive script recognition system. An accurate channel model that allows for splitting, merging, and substitution of symbols is introduced. The best estimate X is obtained by using a dynamic programming search which combines a known search strategy (stack decoding) with a trie structure representation of a dictionary. The computational complexity of the algorithm is derived and compared with that of a method based on the generalized Levenshtein metric. Experimental results with the algorithm on English text based on a dictionary of the 1027 most commonly occurring words are described.
S. N. Srihari and R. Bozinovic, "A String Correction Algorithm for Cursive Script Recognition," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 4, no. , pp. 655-663, 1982.