[Subject Prev][Subject Next][Thread Prev][Thread Next][Date Index][Thread Index]

[hts-users:04094] Re: The recursion formula in HERest of HTS 2.2


Hi,

2014-08-08 10:35 GMT+01:00 YangWang84 <yangwang84@xxxxxxxxx>:                      

My problems are: 1) what is the definition of  as appeared in the source code? 2) Is there any material deriving the formula implemented in code?

You can find it in HFB.c:SetBeta()
        for (d = 1; d <= maxDur[i]; d++) {
          x = durprob[i][d] + ApplyDAEM(hmm->transP[i][Nq]) + bqt[Nq][1];
          if (q >= p->qLo[t + 1] && q <= p->qHi[t + 1]) {
            for (j = 2; j < Nq; j++) {
              a = ApplyDAEM(hmm->transP[i][j]);
              y = bqt1[j][1];
              if (a > LSMALL && y > LSMALL)
                x = LAdd(x, durprob[i][d] + a + outprob[j][0][0] + y);
            }
            if (d < maxDur[i] && bqt1[i][d + 1] > LSMALL)
              x = LAdd(x, outprob[i][0][0] + bqt1[i][d + 1]);
          }
          bqt[i][d] = x;
        }
 Regards,

Heiga


 

Thank you in advance!

 

Yang Wang

 

[1] Zen, H., Tokuda, K., Masuko, T. et al., “A Hidden Semi-Markov Model-Based Speech Synthesis System”, IEICE Transactions on Information and Systems E series D, vol. 90, no. 5, pp. 825-834, 2007.




--
Heiga ZEN (in Japanese)
Byung Ha CHUN (in Korean)
<heigazen@xxxxxxxxxx>

References
[hts-users:04093] The recursion formula in HERest of HTS 2.2, YangWang84