A Comparative Study of Two Search Strategies for Connected Word Recognition: Dynamic Programming and Heuristic Search

Authors:
Hermann Ney
Affiliations:
-
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1992

Citing 4
Cited 5

Artificial intelligence (2nd ed.)

Artificial intelligence (2nd ed.)
Principles of artificial intelligence

Principles of artificial intelligence
Algorithms

Algorithms
The Harpy speech understanding system

Readings in speech recognition

A Lexicon Driven Approach to Handwritten Word Recognition for Real-Time Applications

IEEE Transactions on Pattern Analysis and Machine Intelligence
Augmenting the Discrimination Power of HMM by NN for On-Line Cursive Script Recognition

Applied Intelligence
Lexicon-Driven Segmentation and Recognition of Handwritten Character Strings for Japanese Address Reading

IEEE Transactions on Pattern Analysis and Machine Intelligence
Beam search and partial traceback in the frame-synchronous two-level algorithm (TLBS)

ICASSP'93 Proceedings of the 1993 IEEE international conference on Acoustics, speech, and signal processing: speech processing - Volume II
Two-Level dynamic programming hardware implementation for real time processing

KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I

Quantified Score

Hi-index	0.14

Visualization

Abstract

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.