Evaluating the pronunciation component of text-to-speech systems for English: a performance comparison of different approaches

The automatic derivation of word pronunciations from input text is a central task for any text-to-speech system. For general English text at least, this is often thought to be a solved problem, with manually-derived linguistic rules assumed capable of handling “novel” words missing from the system dictionary. Data-driven methods, based on machine learning of the regularities implicit in a large pronouncing dictionary, have received considerable attention recently but are generally thought to perform less well. However, these tentative beliefs are at best uncertain without powerful methods for comparing text-to-phoneme subsystems. This paper contributes to the development of such methods by comparing the performance of four representative approaches to automatic phonemization on the same test dictionary. As well as rule-based approaches, three data-driven techniques are evaluated: pronunciation by analogy (PbA), NETspeak and IB1-IG (a modified k-nearest neighbour method). Issues involved in comparative evaluation are detailed and elucidated. The data-driven techniques outperform rules in accuracy of letter-to-phoneme translation by a very significant margin but require aligned text-phoneme training data and are slower. Best translation results are obtained with PbA at approximately 72% words correct on a resonably large pronouncing dictionary, compared with something like 26% words correct for the rules, indicating that automatic pronunciation of text is not a solved problem. c © 1999 Academic Press ∗Based on a paper presented at UK Speech and Language Technology (SALT) Club Workshop on Evaluation in Speech and Language Technology, Sheffield, July 1997. ‖E-mails: {rid|ym|mja95r}@ecs.soton.ac.uk and [email protected] 0885–2308/99/020155 + 22 $30.00/0 c © 1999 Academic Press 156 R. I. Damper et al.