A hybrid algorithm for contextual text recognition

摘要

A hybrid algorithm for text recognition is described. The algorithm combines a Markov method with a dictionary method. Experiments were conducted with the hybrid algorithm using as data texts of different nature comprising handprinted letters of varying quality. The performance and computational complexity of the algorithm are deliberated. The computational complexity of the hybrid algorithm is shown to be less than that for the Predictor-Corrector Algorithm,(1) for similar performance.