Open Access

Downloads

Download data is not yet available.

Abstract

This paper describes the method for creating neural networks based continuous Vietnamese speech recognizer. By Vietnamese phonetic analyzing, we can determine the context-dependent phonemes from a given vocabulary, which means that one phoneme is classified differently denpending on the phonemes that surround it. The feature extraction has used the current popular model as the mel-ceptrum, where the short-time spectrum is warped according to the mel scale, then direct transformation of the log power spectrum to the cepstral domain using an inverse discrete cosine transform. The neural netwoks has been applied to estimate context-dependent phoneme probabilities that outputs value in the range 0 to 1. The phoneme probabilities for the successive frames are arranged in a matrix. We then use the Viterbi algorithm to find the legal string of phonmes throught the matrix gives us highest score, that is also the target word. The experiments were programmed in Microsoft Visual C++ 6.0. The high accurate results confirmed applicable of the neural networks for Vietnamese speech recognition.



Author's Affiliation
Article Details

Issue: Vol 5 No 10 (2002)
Page No.: 13-21
Published: Oct 31, 2002
Section: Article
DOI: https://doi.org/10.32508/stdj.v5i10.3445

 Copyright Info

Creative Commons License

Copyright: The Authors. This is an open access article distributed under the terms of the Creative Commons Attribution License CC-BY 4.0., which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

 How to Cite
Tien Thuong, L., & Tien Duc, T. (2002). CONTINUOUS VIETNAMESE SPEECH RECOGNITION USING NEURAL NETWORKS. Science and Technology Development Journal, 5(10), 13-21. https://doi.org/https://doi.org/10.32508/stdj.v5i10.3445

 Cited by



Article level Metrics by Paperbuzz/Impactstory
Article level Metrics by Altmetrics

 Article Statistics
HTML = 993 times
Download PDF   = 318 times
Total   = 318 times