Abstract
In this study we present the models of computation of several search algorithms for isolated word recognition. These search techniques considered include variants of the classical dynamic programming, variants of branch‐and‐bound search technique and variants of the beam search technique (as implemented in the Harpy system). We show that depending on the choice of the technique and related parameters, one can achieve more than an order of magnitude improvement in speed without any loss of accuracy.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
