• DocumentCode
    1648462
  • Title

    Extended Decision Tree with or Relationship for HMM-Based Speech Synthesis

  • Author

    Yang Wang ; Jianhua Tao ; Minghao Yang ; Ya Li

  • Author_Institution
    Nat. Lab. of Pattern Recognition, Inst. of Autom., Beijing, China
  • fYear
    2013
  • Firstpage
    225
  • Lastpage
    229
  • Abstract
    This paper proposes a variant of decision tree (DT) for HMM-based speech synthesis. We call it Extended Decision Tree with OR Relationship (EDTOR). A leaf node in conventional DT is uniquely reached by answering a series of yes/no questions starting from its root node until the leaf node. Thus the decision condition for deciding whether the acoustic parameters of a context label belong to a certain leaf node is subject to AND logical expressions. However, some linguistic knowledge cannot be represented by AND logical expressions compactly and efficiently. We introduce OR relationship to DT at leaf node level to loosen the restriction on DT. Preliminary experimental results show that EDTOR can, 1) greatly reduce the leaf node number of DT (i.e., model size) without affecting speech synthesis performance, which is appealing to embedded applications, or, 2) slightly improve the performance if DT has the same leaf node number as that of EDTOR.
  • Keywords
    decision trees; hidden Markov models; speech synthesis; AND logical expressions; EDTOR; HMM-based speech synthesis; decision condition; extended decision tree with OR relationship; leaf node number reduction; linguistic knowledge; Context; Decision trees; Hidden Markov models; Merging; Speech; Speech synthesis; Training; HMM-based speech synthesis; decision tree; or relationship;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Pattern Recognition (ACPR), 2013 2nd IAPR Asian Conference on
  • Conference_Location
    Naha
  • Type

    conf

  • DOI
    10.1109/ACPR.2013.94
  • Filename
    6778315