A comparative study of two search strategies for connected word recognition: dynamic programming and heuristic search
Hermann Ney · IEEE Transactions on Pattern Analysis and Machine Intelligence · 1992
A most successful approach to recognizing continuous speech is to model the recognition problem as one of finding an optimal path through a finite state network. A comparison of two search strategies for finding the optimal path, dynamic programming and heuristic search, is presented. The comparison is based on theoretical considerations and experimental tests on a digit string task.>