New DP matching algorithms for connected word recognition

In this paper, two new algorithms are proposed to overcome demerits in previous algorithms, such as the CWDP algorithm or the One-Pass algorithm. In the first one, called ´Blockwise DP matching (BWDP) algorithm´, the calculation is carried out in step with the block having BL input pattern frames, instead of one frame used in the CWDP algorithm. This reduces the number of memory access times to 1/BL. However, it cannot handle the finite state automaton control with loop transition rules. In the other algorithm, called ´Slant-blockwise DP matching (SBDP) algorithm´, the calculation block is inclined to the reference pattern time axis. Calculation is carried out in each slant block with BL frame width. This makes it possible to handle the finite state automaton control with loop transition rules. However, the program for this algorithm is rather complex. Further, improvement concerning variable block width is proposed. It can extend the effective block width. Namely, it can further reduce the number of memory access times.