INTERSPEECH 2015
16th Annual Conference of the International Speech Communication Association

Dresden, Germany
September 6-10, 2015

Universal Grapheme-Based Speech Synthesis

Sunayana Sitaram (1), Alok Parlikar (1), Gopala Krishna Anumanchipalli (2), Alan W. Black (1)

(1) Carnegie Mellon University, USA
(2) University of California at San Francisco, USA

Grapheme-to-phoneme conversion follows the text processing step in speech synthesis. Typically, lexicons or Letter-to-Sound rules are used to map graphemes to phonemes. However, in some languages, such resources may not be readily available. In this paper, we describe a universal front end that supports using grapheme information alone to build usable speech synthesis systems. This work takes advantage of an explicit mapping of Unicode characters from a wide range of scripts to a single phoneset to create support for building speech synthesizers for most languages in the world. We compare the efficacy of this front end to the baseline approach of treating every single grapheme as a separate phoneme for synthesis by building voices for twelve languages across several language families and to front ends with linguistic knowledge in languages with higher resources. In addition, we improve our models by using Random Forests as opposed to using single Classification and Regression Trees. We find that the common universal front end performs better than the raw graphemes in general. We also find that using Random Forests lead to a significant improvement in synthesis quality, which is better than the quality of the knowledge based front end in many cases.

Full Paper

Bibliographic reference.  Sitaram, Sunayana / Parlikar, Alok / Anumanchipalli, Gopala Krishna / Black, Alan W. (2015): "Universal grapheme-based speech synthesis", In INTERSPEECH-2015, 3360-3364.