Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
HTK - Hidden Markov Model Toolkit, http://htk.eng.cam.ac.uk
Rabiner, L.R., Juang, B.: Fundamentals on Speech Recognition. New Jersey, Prentice Hall (1996)
Ney, H.: The Use of a One-Stage Dynamic Programming Algorithm for Connected Word Recognition. In: Proceedings of ICASSP (1984)
Alcaim, A., Solewicz e, J.A., Moraes, J.A.: Freqüência de ocorrência dos fones e listas de frases foneticamente balanceadas no português falado no Rio de Janeiro. Revista da Sociedade Brasileira de Telecomunicações, Rio de Janeiro, 7(1), 23–41 (1992)
Barbosa, F.L.F., et al.: Grapheme-phone transcription algorithm for a Brazilian Portuguese TTS. In: Mamede, N.J., Baptista, J., Trancoso, I., Nunes, M.d.G.V. (eds.) PROPOR 2003. LNCS, vol. 2721, pp. 23–30. Springer, Heidelberg (2003)
Huang, X., Acero, A., Hon, H.: Spoken Language Processing: A Guide to Theory, Algorithm and System Development, ch. 11. Prentice Hall, Englewood Cliffs (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Teruszkin, R., Gil Vianna Resende, F. (2006). Phonetic Sequence to Graphemes Conversion Based on DTW and One-Stage Algorithms. In: Vieira, R., Quaresma, P., Nunes, M.d.G.V., Mamede, N.J., Oliveira, C., Dias, M.C. (eds) Computational Processing of the Portuguese Language. PROPOR 2006. Lecture Notes in Computer Science(), vol 3960. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751984_26
Download citation
DOI: https://doi.org/10.1007/11751984_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34045-4
Online ISBN: 978-3-540-34046-1
eBook Packages: Computer ScienceComputer Science (R0)