Reduction of Computing Cost in Unit Selection TTS System with Large Corpus

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F09%3A00504521" target="_blank" >RIV/49777513:23520/09:00504521 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Reduction of Computing Cost in Unit Selection TTS System with Large Corpus

Original language description

Unit selection concatenative speech synthesis requires high amount of computing time, especially for very large corpus. The corpus for our Czech text-to-speech system ARTIC contains over 650 thousands of diphone tokens. Unit selection system with such alarge corpus is not well suitable for run-time speech generation when standard Viterbi search is used. In case of wide-range dialogue systems or other server applications, it is required to dispatch many requests at one moment and this could be problematic in relation to server resources. This paper describes various modifications of Viterbi search algorithm for massive reduction of computation cost in unit selection approach to speech synthesis.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

JD - Use of computers, robotics and its application

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2009

Confidentiality

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

Article name in the collection

Speech Processing

ISBN

978-80-86269-18-4

ISSN

—

e-ISSN

—

Number of pages

7

Pages from-to

—

Publisher name

Institute of Photonics and Electronics AS CR

Place of publication

Prague

Event location

Praha

Event date

Jan 1, 2009

Type of event by nationality

EUR - Evropská akce

UT code for WoS article

—