Skip to content

Publications

Detail of publication

Citation

Kala, J and Matoušek, J. : Very Fast Unit Selection Using Viterbi Search with Zero-Concatenation-Cost Chains . Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing, p. 2569-2573, IEEE, Florence, Italy, 2014.

Additional information


IEEEXplore

Abstract

This paper introduces a very fast heuristic search algorithm for unit-selection speech synthesis. The algorithm modifies commonly used Viterbi search framework by introducing zero-concatenation-cost (ZCC) chains of unit candidates that immediately neighbored in a source speech corpus. ZCC chains are preferred as they represent perfect speech segment concatenations (so there is no need to compute concatenation costs inside the chains) unless a so-called target specification is violated. The number of ZCC chains is reduced based on statistics calculated upon the synthesis of a large number of utterances. ZCC chains are then combined with single unit candidates to fill possible gaps in the sequence of candidates. The proposed method reduces the computational load of a unit selection system up to hundreds of times. According to listening tests, the quality of synthetic speech was not deteriorated.

Detail of publication

Title: Very Fast Unit Selection Using Viterbi Search with Zero-Concatenation-Cost Chains
Author: Kala, J ; Matoušek, J.
Language: Czech
Date of publication: 4 May 2014
Year: 2014
Type of publication: Papers in proceedings of reviewed conferences
Book title: Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing
Page: 2569 - 2573
DOI: 10.1109/ICASSP.2014.6854064
ISBN: 978-1-4799-2893-4
ISSN: 1520-6149
Publisher: IEEE
Address: Florence, Italy
Date: 4 May 2014 - 9 May 2014
/ 2019-09-05 16:05:49 /

Keywords

speech synthesis, unit selection, Viterbi algorithm, non-uniform units, zero cost concatenation

BibTeX

@INPROCEEDINGS{KalaJ_2014_VeryFastUnit,
 author = {Kala, J and Matou\v{s}ek, J.},
 title = {Very Fast Unit Selection Using Viterbi Search with Zero-Concatenation-Cost Chains},
 year = {2014},
 publisher = {IEEE},
 address = {Florence, Italy},
 pages = {2569-2573},
 booktitle = {Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing},
 ISBN = {978-1-4799-2893-4},
 ISSN = {1520-6149},
 doi = {10.1109/ICASSP.2014.6854064},
 url = {http://www.kky.zcu.cz/en/publications/KalaJ_2014_VeryFastUnit},
}