Phoneme Segmentation in Consideration of Speech feature in Korean Speech Recognition


, , , Journal of Information Processing Systems Vol. 2, No. 1, pp. 31-38, Feb. 2001  


Fulltext:

Abstract

Speech database built of phonemes is significant in the studies of speech recognition, speech synthesis and analysis, Phoneme, consist of voiced sounds and unvoiced ones, Though there are many feature differences in voiced and unvoiced sounds, the traditional algorithms for detecting the boundary between phonemes do not reflect on them and determine the boundary between phonemes by comparing parameters of current frame with those of previous frame in time domain, In this paper, we propose the assort algorithm, which is based on a block and reflecting upon the feature differences between voiced and unvoiced sounds for phoneme segmentation, The assort algorithm uses the distance measure based upon MFCC(Mel-Frequency Cepstrum Coefficient) as a comparing spectrum measure, and uses the energy, zero crossing rate, spectral energy ratio, the formant frequency to separate voiced sounds from unvoiced sounds, N, the result of out experiment, the proposed system showed about 79 percents precision subject to the 3 or 4 syllables isolated words, and improved about 8 percents in the precision over the existing phonemes segmentation system.


Statistics
Show / Hide Statistics

Statistics (Past 3 Years)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.




Cite this article
[APA Style]
서영완, 송점동, & 이정현 (2001). Phoneme Segmentation in Consideration of Speech feature in Korean Speech Recognition. Journal of Internet Computing and Services, 2(1), 31-38.

[IEEE Style]
서영완, 송점동, 이정현, "Phoneme Segmentation in Consideration of Speech feature in Korean Speech Recognition," Journal of Internet Computing and Services, vol. 2, no. 1, pp. 31-38, 2001.

[ACM Style]
서영완, 송점동, and 이정현. 2001. Phoneme Segmentation in Consideration of Speech feature in Korean Speech Recognition. Journal of Internet Computing and Services, 2, 1, (2001), 31-38.