TY - GEN
T1 - Pronunciation similarity estimation for spoken language learning
AU - Kim, Donghyun
AU - Yook, Dongsuk
PY - 2006
Y1 - 2006
N2 - This paper presents an approach for estimating pronunciation similarity between two speakers using the cepstral distance. General speech recognition systems have been used to find the matched words of a speaker, using the acoustical score of a speech signal and the grammatical score of a word sequence. In the case of learning a language, for a speaker with impaired hearing, it is not easy to estimate the pronunciation similarity using automatic speech recognition systems, as this requires more information of pronouncing characteristics, than information on word matching. This is a new challenge for computer aided pronunciation learning. The dynamic time warping algorithm is used for cepstral distance computation between two speech data with codebook distance subtracted to consider the characteristics of each speaker. The experiments evaluated on the Korean fundamental vowel set show that the similarity of two speaker's pronunciation can be efficiently computed using computers.
AB - This paper presents an approach for estimating pronunciation similarity between two speakers using the cepstral distance. General speech recognition systems have been used to find the matched words of a speaker, using the acoustical score of a speech signal and the grammatical score of a word sequence. In the case of learning a language, for a speaker with impaired hearing, it is not easy to estimate the pronunciation similarity using automatic speech recognition systems, as this requires more information of pronouncing characteristics, than information on word matching. This is a new challenge for computer aided pronunciation learning. The dynamic time warping algorithm is used for cepstral distance computation between two speech data with codebook distance subtracted to consider the characteristics of each speaker. The experiments evaluated on the Korean fundamental vowel set show that the similarity of two speaker's pronunciation can be efficiently computed using computers.
UR - http://www.scopus.com/inward/record.url?scp=77049118749&partnerID=8YFLogxK
U2 - 10.1007/11940098_46
DO - 10.1007/11940098_46
M3 - Conference contribution
AN - SCOPUS:77049118749
SN - 354049667X
SN - 9783540496670
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 442
EP - 449
BT - Computer Processing of Oriental Languages - Beyond the Orient
T2 - 21st International Conference on Computer Processing of Oriental Languages: Beyond the Orient: The Research Challenges Ahead, ICCPOL 2006
Y2 - 17 December 2006 through 19 December 2006
ER -