Abstract
An efficient search algorithm for generating syllable hypotheses in continuous Mandarin speech recognizer is proposed. The fast syllable hypothesizing algorithm consists of a forward, time-synchronous, modified Viterbi search and a parallel backtracking procedure. This algorithm can generate a lattice of syllable hypotheses with very low time delay. The superiority of the new algorithm to other direct sentence hypothesis algorithms is also experimentally demonstrated in terms of search efficiency and accuracy. >
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.
