Skip to main content

Efficient Unit-Selection in Text-to-Speech Synthesis

  • Conference paper
  • 956 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5246))

Abstract

This paper presents a method for selecting speech units for polyphone concatenative speech synthesis, in which the simplification of procedures for search paths in a graph accelerated the speed of the unit-selection procedure with minimum effects on the speech quality. The speech units selected are still optimal; only the costs of merging the units on which the selection is based are less accurately determined. Due to its low processing power and memory footprint requirements, the method is applicable in embedded speech synthesizers.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Vesnicer, B., Mihelič, F.: Evaluation of the Slovenian HMM-Based Speech Synthesis System. LNCS, pp. 513–520. Springer, Heidelberg (2006)

    Google Scholar 

  2. Campbell, W.N.: Processing a speech corpus for CHATR synthesis. In: Proceedings of the ICSP, Seul, Korea, pp. 183–186 (1997)

    Google Scholar 

  3. Toda, T., Kawa, H., Tsuzak, M.: Optimizing Sub-Cost Functions For Segment Selection Based On Perceptual Evaluations In Concatenative Speech Synthesis. In: Proceedings of the ICASSP 2004, pp. 657–660 (2004)

    Google Scholar 

  4. Vepa, J., King, S.: Subjective Evaluation Of Joint Cost Functions Used In Unit Selection Speech Synthesis. In: Proceedings of the InterSpeech 2004, pp. 1181–1184 (2004)

    Google Scholar 

  5. Breuer, S., Abresch, J., Phoxsy, X.: Multi-phone Segments for Unit Selection Speech Synthesis. In: Proceedings of the InterSpeech 2004, Institute for Communication Research and Phonetics (IKP) University of Bonn (2004)

    Google Scholar 

  6. Allauzen, C., Mohri, M., Riley, M.: DCD Library – Decoder Library, software collection for decoding and related functions. In: AT&T Labs – Research (2003)

    Google Scholar 

  7. Allauzen, C., Mohri, M., Roark, B.: A General Weighted Grammar Library. In: Proceedings of the Ninth International Conference on Automata (CIAA 2004), Kingston, Canada (2004)

    Google Scholar 

  8. Yi, J.R.W.: Corpus-Based Unit Selection for Natural-Sounding Speech Synthesis. Ph.D. Thesis, Massachusetts Institute of Technology (2003)

    Google Scholar 

  9. Mihelič, A., Žganec Gros, J., Pavešič, N., Žganec, M.: Efficient Subset Selection from Phonetically Transcribed Text Corpora for Concatenation-based Embedded Text-to-speech Synthesis. Inf. MIDEM 36(1), 19–24 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Petr Sojka Aleš Horák Ivan Kopeček Karel Pala

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mihelič, A., Gros, J.Ž. (2008). Efficient Unit-Selection in Text-to-Speech Synthesis. In: Sojka, P., Horák, A., Kopeček, I., Pala, K. (eds) Text, Speech and Dialogue. TSD 2008. Lecture Notes in Computer Science(), vol 5246. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87391-4_53

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87391-4_53

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87390-7

  • Online ISBN: 978-3-540-87391-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics