Unifying Unit Selection and Hidden Markov Model Speech Synthesis

被引:0
作者
Taylor, Paul [1 ]
机构
[1] Univ Cambridge, Dept Engn, Cambridge CB2 1PZ, England
来源
INTERSPEECH 2006 AND 9TH INTERNATIONAL CONFERENCE ON SPOKEN LANGUAGE PROCESSING, VOLS 1-5 | 2006年
关键词
speech synthesis; unit selection; hidden markov models;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents a framework which can accommodate the two most widely used contemporary speech synthesis techniques, namely unit selection and hidden Markov models (HMMs). This is achieved by building a very general HMM where we have a network of states, each representing a single frame for a single unit. This network exactly mimics the behaviour of a unit selection system and is effectively memorising the data as an HMM. From this, we can merge states in the network so as to produce a synthesis system of any desired size. The paper discusses this technique as well as a statistical formulation of the join cost and a number of ways to represent the acoustic observations of the states.
引用
收藏
页码:1758 / 1761
页数:4
相关论文
共 4 条
[1]  
HUNT A, 1996, P ICASSP, P373
[2]  
IMAI S, 1983, ICASSP
[3]  
TAYLOR P, 2006, INTERSPEECH 20 UNPUB
[4]  
Tokuda Keiichi, 1995, ICASSP