Bottom-up Algorithm for syntactic Pattern Recognition of Handwritten Katakana Characters

Recently, several methods for pattern recognition by context-free grammar have been published. However, most of them use top-down algorithms based on three types of error-transformations, substitution, deletion and insertion, and these methods have rather time-consuming parser. In this paper, we propose a new error-correcting parser for the improvement of parsing time. This parser bases on Cocke-Younger-Kasami's bottom-up algorithm and uses only two types of error-trans-formations, substitution and deletion. From some experimental results for handwritten Katakana characters, the validity of our method is discussed.