General word recognition using approximate segment-string matching

Abstract

Focuses on the problem of isolated off-line general word recognition using an approximate stroke-segment/string matching algorithm. Several recently proposed word recognition algorithms use the strategy of directly matching the stroke segments (with OCR estimates) to the sequence of characters in each lexicon word. This idea works very well under ideal conditions; however, many applications require the recognition of text in the presence of document noise, poor handwriting and lexicon errors. These factors require careful design of the matching strategy such that a moderate amount of any form of degradation does not cause a recognition failure. A segment-to-string matching algorithm is proposed which robustly recovers from moderate levels of noise and system errors. This algorithm is developed in the context of a complete word recognition system and serves as its final post-processing module.