Shipeng Xu, Hongzhi Yu, Guanyu Li, Hanbing Zhang, Jun Ma
{"title":"基于DAEM算法的拉萨藏语语音合成声学建模","authors":"Shipeng Xu, Hongzhi Yu, Guanyu Li, Hanbing Zhang, Jun Ma","doi":"10.1145/3033288.3033329","DOIUrl":null,"url":null,"abstract":"This paper applies the deterministic annealing expectation maximum (DAEM) algorithm into HMM-based Lhasa Tibetan speech synthesis. In this way, we can synthesize Lhasa Tibetan speech with non-time labeled training speech corpus. EM algorithm has the problem of initialization dependence, which can cause the problem of local maximum values. The DAEM algorithm has been introduced to solve this problem. In the process embedded re-evaluation during the model training, this method can make the computer obtain the optimal parameters to determine the best time boundary of each speech synthesis unit. Objective and subjective evaluation show that the synthesized Lhasa Tibetan speech has similar quality with the synthesized speech with time labeled speech corpus. Especially, the MOS of the synthesized Tibetan speech by the DAEM algorithm is higher when the number of training sentences is 700. Therefore, proposed method can be used for training acoustic models of Lhasa Tibetan speech synthesis with non-time labeled training speech corpus.","PeriodicalId":253625,"journal":{"name":"International Conference on Network, Communication and Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Acoustic Modeling for Lhasa Tibetan Speech Synthesis Based on DAEM Algorithm\",\"authors\":\"Shipeng Xu, Hongzhi Yu, Guanyu Li, Hanbing Zhang, Jun Ma\",\"doi\":\"10.1145/3033288.3033329\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper applies the deterministic annealing expectation maximum (DAEM) algorithm into HMM-based Lhasa Tibetan speech synthesis. In this way, we can synthesize Lhasa Tibetan speech with non-time labeled training speech corpus. EM algorithm has the problem of initialization dependence, which can cause the problem of local maximum values. The DAEM algorithm has been introduced to solve this problem. In the process embedded re-evaluation during the model training, this method can make the computer obtain the optimal parameters to determine the best time boundary of each speech synthesis unit. Objective and subjective evaluation show that the synthesized Lhasa Tibetan speech has similar quality with the synthesized speech with time labeled speech corpus. Especially, the MOS of the synthesized Tibetan speech by the DAEM algorithm is higher when the number of training sentences is 700. Therefore, proposed method can be used for training acoustic models of Lhasa Tibetan speech synthesis with non-time labeled training speech corpus.\",\"PeriodicalId\":253625,\"journal\":{\"name\":\"International Conference on Network, Communication and Computing\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Network, Communication and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3033288.3033329\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Network, Communication and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3033288.3033329","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Acoustic Modeling for Lhasa Tibetan Speech Synthesis Based on DAEM Algorithm
This paper applies the deterministic annealing expectation maximum (DAEM) algorithm into HMM-based Lhasa Tibetan speech synthesis. In this way, we can synthesize Lhasa Tibetan speech with non-time labeled training speech corpus. EM algorithm has the problem of initialization dependence, which can cause the problem of local maximum values. The DAEM algorithm has been introduced to solve this problem. In the process embedded re-evaluation during the model training, this method can make the computer obtain the optimal parameters to determine the best time boundary of each speech synthesis unit. Objective and subjective evaluation show that the synthesized Lhasa Tibetan speech has similar quality with the synthesized speech with time labeled speech corpus. Especially, the MOS of the synthesized Tibetan speech by the DAEM algorithm is higher when the number of training sentences is 700. Therefore, proposed method can be used for training acoustic models of Lhasa Tibetan speech synthesis with non-time labeled training speech corpus.