• DocumentCode
    3425088
  • Title

    Admissible stopping in viterbi beam search for unit selection in concatenative speech synthesis

  • Author

    Sakai, Shinsuke ; Kawahara, Tatsuya ; Nakamura, Satoshi

  • Author_Institution
    Nat. Inst. of Inf. & Commun. Technol., Kyoto
  • fYear
    2008
  • fDate
    March 31 2008-April 4 2008
  • Firstpage
    4613
  • Lastpage
    4616
  • Abstract
    Corpus-based concatenative speech synthesis is very popular these days due to its highly natural speech quality. The amount of computation required in the run time, however, is often quite large and various approaches have been proposed for reducing this runtime computation. In this paper, we propose early stopping schemes for Viterbi beam search in the unit selection, with which we can stop early in the local Viterbi maximization for each unit as well as in the exploration of candidate units for a given target. It takes advantage of the fact that the space of the acoustic parameters of the database units is closed and certain upper bounds of the concatenation scores can be precomputed. The proposed method for early stopping is admissible in that it does not change the result of the Viterbi beam search if the upper bounds are properly computed. Experiments show that the proposed methods of admissible stopping effectively reduce the amount of computation required in the Viterbi beam search while keeping its result unchanged.
  • Keywords
    search problems; speech synthesis; Viterbi beam search; acoustic parameters; admissible stopping; concatenative speech synthesis; early stopping schemes; unit selection; Acoustic beams; Communications technology; Costs; Databases; Informatics; Natural languages; Runtime; Speech synthesis; Upper bound; Viterbi algorithm; Viterbi search; speech synthesis; unit selection;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Acoustics, Speech and Signal Processing, 2008. ICASSP 2008. IEEE International Conference on
  • Conference_Location
    Las Vegas, NV
  • ISSN
    1520-6149
  • Print_ISBN
    978-1-4244-1483-3
  • Electronic_ISBN
    1520-6149
  • Type

    conf

  • DOI
    10.1109/ICASSP.2008.4518684
  • Filename
    4518684