All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Quality Improvements of Zero-Concatenation-Cost Chain Based Unit Selection

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F14%3A43923340" target="_blank" >RIV/49777513:23520/14:43923340 - isvavai.cz</a>

  • Result on the web

    <a href="http://link.springer.com/chapter/10.1007%2F978-3-319-11581-8_47" target="_blank" >http://link.springer.com/chapter/10.1007%2F978-3-319-11581-8_47</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-11581-8_47" target="_blank" >10.1007/978-3-319-11581-8_47</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Quality Improvements of Zero-Concatenation-Cost Chain Based Unit Selection

  • Original language description

    In our previous work, we introduced a zero-concatenation-cost (ZCC) chain based framework of unit-selection speech synthesis. This framework proved to be very fast as it reduced the computational load of a unit-selection system up to hundreds of time. Since the ZCC chain based algorithm principally prefers to select longer segments of speech, an increased number of audible artifacts were expected to occur at concatenation points of longer ZCC chains. Indeed, listening tests revealed a number of artifacts present in synthetic speech; however, the artifacts occurred in a similar extent in synthetic speech produced by both ZCC chain based and standard Viterbi search algorithms. In this paper, we focus on the sources of the artifacts and we propose improvements of the synthetic speech quality within the ZCC algorithm. The quality and computational demands of the improved ZCC algorithm are compared to the unit-selection algorithm based on the standard Viterbi search.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    JD - Use of computers, robotics and its application

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/TA01030476" target="_blank" >TA01030476: Intelligent technologies for improving air traffic security</a><br>

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2014

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Speech and Computer, 16th International Conference, SPECOM 2014, Novi Sad, Serbia, October 5-9, 2014, Proceedings

  • ISBN

    978-3-319-11580-1

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    10

  • Pages from-to

    376-385

  • Publisher name

    Springer

  • Place of publication

    Heidelberg

  • Event location

    Novi Sad, Serbia

  • Event date

    Oct 5, 2014

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article