Abstract

An algorithm for recognition in continuous speech is presented. A continuous matching process is employed to bypass the segmentation problem. A large set of standard patterns is used to solve the allophonic variation problem. Also, a hierarchical recognition algorithm is proposed to realize feasible matching in a real time. In the first stage of the hierarchical recognition algorithm, vowels in speech are spotted. To optimize accuracy in vowel spotting, each standard pattern is carefully selected, constraints on the phoneme chain of continuous speech are utilized, and partial standard pattern matching is employed for detailed analysis. The second stage recognizes consonants between vowels. Experimental results show a 91% vowel recognition rate and 80% consonant recognition rate for a specified speaker.

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 call

Disclaimer: 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.