A Comparative Study of Two Search Strategies for Connected Word Recognition: Dynamic Programming and Heuristic Search
Issue No. 05 - May (1992 vol. 14)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.134063
<p>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.</p>
connected word recognition; dynamic programming; heuristic search; continuous speech; optimal path; finite state network; dynamic programming; graph theory; heuristic programming; search problems; speech recognition
H. Ney, "A Comparative Study of Two Search Strategies for Connected Word Recognition: Dynamic Programming and Heuristic Search," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 14, no. , pp. 586-595, 1992.