Abstract
DTW distance-based Nearest-Neighbour (NN) searching has traditionally been one of the most popular approaches for isolated word recognition. The interest in this approach increases by introducing fast NN searching algorithms like the “Approximating and Eliminating Search Algorithm” (AESA) that dramatically reduces the required number of distance computations. In order to apply these techniques to more challenging Speech problems like phoneme recognition, the basic NN technique has to be extended to k-NN search. Here we present extensions of this kind to the AESA and report on phoneme recognition experiments showing both the effectiveness of k-NN techniques in this task and the efficiency of the here proposed algorithms.
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.
