Methods and apparatus for rapid acoustic unit selection from a large speech corpus

• US 8,086,456 B2
• Filed: 07/20/2010
• Issued: 12/27/2011
• Est. Priority Date: 04/30/1999
• Status: Expired due to Fees

• Current Assignee: Cerence Operating Company (Cerence Inc.)
• Original Assignee: AT&T Intellectual Property II LP (AT&T, Inc.)
• Inventors: Beutnagel, Mark Charles, Mohri, Mehryar, Riley, Michael Dennis
• Primary Examiner(s): Lerner, Martin
• Application Number:
  US12/839,937
• Publication Number:
  US 20100286986A1
• Time in Patent Office: 525 Days
• Field of Search: 704/258, 704/263, 704/266, 379/88.16
• US Class Current: 704/258
• CPC Class Codes: G10L 13/00 Speech synthesis; Text to speech systems
• CPC Class Codes: G10L 13/027 Concept to speech synthesisers; Generation of natural phrases from machine-based concepts generation of parameters for speech synthesis out of text G10L13/08
• CPC Class Codes: G10L 13/07 Concatenation rules
• CPC Class Codes: G10L 13/08 Text analysis or generation of parameters for speech synthesis out of text, e.g. grapheme to phoneme translation, prosody generation or stress or intonation determination

Abstract

A speech synthesis system can select recorded speech fragments, or acoustic units, from a very large database of acoustic units to produce artificial speech. The selected acoustic units are chosen to minimize a combination of target and concatenation costs for a given sentence. However, as concatenation costs, which are measures of the mismatch between sequential pairs of acoustic units, are expensive to compute, processing can be greatly reduced by pre-computing and caching the concatenation costs. Unfortunately, the number of possible sequential pairs of acoustic units makes such caching prohibitive. A method for constructing an efficient concatenation cost database is provided by synthesizing a large body of speech, identifying the acoustic unit sequential pairs generated and their respective concatenation costs. By constructing a concatenation cost database in this fashion, the processing power required at run-time is greatly reduced with negligible effect on speech quality.

Claims

1. A method comprising:

determining, via a processor, whether an acoustic unit sequential pair to be used for synthesizing speech has a concatenation cost in a concatenation cost database;

if the concatenation cost database does not contain the concatenation cost for the acoustic unit sequential pair, then assigning a default value as the concatenation cost; and

updating the concatenation cost database by synthesizing a body of speech and identifying acoustic unit sequential pairs generated in the body of speech and respective concatenation costs.

2. The method of claim 1, further comprising synthesizing the speech using the default value as assigned for the acoustic unit sequential pair.

3. The method of claim 1, wherein the concatenation cost database contains a portion of all possible concatenation costs.

4. The method of claim 1, wherein the concatenation cost database is derived using statistical techniques which predict which acoustic unit sequential pairs are most likely to occur in common speech.

5. The method of claim 1, wherein the concatenation cost comprises a weighted sum of subcosts across phones.

6. The method of claim 1, wherein the concatenation cost provides an estimate of an acoustic mismatch between units in the acoustic unit sequential pair.

7. A system comprising:

a processor;

a first module configured to control the processor to determine whether an acoustic sequential pair to be used for synthesizing speech has a concatenation cost and a concatenation database;

a second module configured to control the processor, if the concatenation cost database does not contain the concatenation cost for the acoustic unit sequential pair, to assign a default value as the concatenation cost; and

a third module configured to control the processor to update the concatenation cost database by synthesizing a body of speech and identifying acoustic unit sequential pairs generated in the body of speech and respective concatenation costs.

8. The system of claim 7, further comprising a third module configured to control the processor to synthesize the speech using the default value as assigned for the acoustic unit sequential pair.

9. The system of claim 7, wherein the concatenation cost database contains a portion of all possible concatenation costs.

10. The system of claim 7, wherein the concatenation cost database is derived using statistical techniques which predict which acoustic unit sequential pairs are most likely to occur in common speech.

11. The system of claim 7, wherein the concatenation cost comprises a weighted sum of subcosts across phones.

12. The system of claim 7, wherein the concatenation cost provides an estimate of an acoustic mismatch between units in the acoustic unit sequential pair.

13. A method comprising:

determining, via a processor, whether an acoustic unit sequential pair to be used for synthesizing speech has a concatenation cost and a concatenation cost database;

if the concatenation cost database does not contain the concatenation cost for the acoustic unit sequential pair, then deriving an actual concatenation cost for the acoustic unit sequential pair; and

updating the concatenation cost database by synthesizing a body of speech and identifying acoustic unit sequential pairs generated in the body of speech and respective concatenation costs.

14. The method of claim 13, further comprising synthesizing the speech using the actual concatenation cost for the acoustic unit sequential pair.

15. The method of claim 13, wherein the concatenation cost database contains a portion of all possible concatenation costs.

16. The method of claim 13, wherein the concatenation cost database is derived using statistical techniques which predict which acoustic unit sequential pairs are most likely to occur in common speech.

17. The method of claim 13, wherein the concatenation cost provides an estimate of an acoustic mismatch between units in the acoustic unit sequential pair.