An approximate string matching algorithm for on-line Chinese character recognition

摘要

We model a Chinese character by a linear sequence of straight line segments. The 2-dimensional structure of the character is captured by the use of pseudo strokes and stroke length attributes. An effective string match algorithm has been developed which can tolerate common types of distortions, e.g. connected strokes, missing/extra strokes, and variations in writing sequence. A prototype system with 5401 commonly used Chinese characters has been built, and good recognition performance has been achieved.