Advertisement
Published in:
2006 | OriginalPaper | Chapter
Phonetic Sequence to Graphemes Conversion Based on DTW and One-Stage Algorithms
Authors : Rafael Teruszkin, Fernando Gil Vianna Resende Jr.
Published in: Computational Processing of the Portuguese Language
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
This work proposes an algorithm for converting phonetic sequences into graphemes using DTW on the recognition of isolated words or closed sentences, and using One-Stage on a continuous speech recognition task. Most speech recognition systems resolve the task of recognition on a single stage without having an intermediate phonetic sequence result. The proposed solution is hybrid in the sense that it uses HMMs and Viterbi Decoding for recognizing a phonetic sequence (actually, triphones) and then DTW or One-Stage to generate the corresponding graphemes. Experimental results showed an average accuracy rate of 100% on the recognition of closed sentences, and average word recognition rate of 84% for the continuous speech recognition task.