Key points are not available for this paper at this time.
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.>
Hermann Ney (Fri,) studied this question.