# Patent

## Title
Method and system for preselection of suitable units for concatenative speech

## Abstract

A system and method for improving the response time of text-to-speech synthesis utilizes “triphone contexts” (i.e., triplets comprising a central phoneme and its immediate context) as the basic unit, instead of performing phoneme-by-phoneme synthesis. The method comprises a method of generating a triphone preselection cost database for use in speech synthesis, the method comprising 1) selecting a triphone sequence u1-u2-u3, 2) calculating a preselection cost for each 5-phoneme sequence ua-u1-u2-u3-ub, where u2 is allowed to match any identically labeled phoneme in a database and the units ua and ub vary over the entire phoneme universe and 3) storing a group of the selected triphone sequences exhibiting the lowest costs in a triphone preselection cost database.

## Background
PRIORITY CLAIM
The present application is a continuation of U.S. patent application Ser. No. 10/702,154, filed Nov. 5, 2003, which is a continuation of U.S. patent application Ser. No. 09/607,615, filed Jun. 30, 2000, the contents of which are incorporated herein by reference.


TECHNICAL FIELD
The present invention relates to a system and method for increasing the speed of a unit selection synthesis system for concatenative speech synthesis and, more particularly, to predetermining a universe of phonemes—selected on the basis of their triphone context—that are potentially used in speech. Real-time selection is then performed from the created phoneme universe.
BACKGROUND OF THE INVENTION
A current approach to concatenative speech synthesis is to use a very large database for recorded speech that has been segmented and labeled with prosodic and spectral characteristics, such as the fundamental frequency (F0) for voiced speech, the energy or gain of the signal, and the spectral distribution of the signal (i.e., how much of the signal is present at any given frequency). The database contains multiple instances of speech sounds. This multiplicity permits the possibility of having units in the database that are much less stylized than would occur in a diphone database (a “diphone” being defined as the second half of one phoneme followed by the initial half of the following phoneme, a diphone database generally containing only one instance of any given diphone). Therefore, the possibility of achieving natural speech is enhanced with the “large database” approach.
For good quality synthesis, this database technique relies on being able to select the “best” units from the database—that is, the units that are closest in character to the prosodic specification provided by the speech synthesis system, and that have a low spectral mismatch at the concatenation points between phonemes. The “best” sequence of units may be determined by associating a numerical cost in two different ways. First, a “target cost” is associated with the individual units in isolation, where a lower cost is associated with a unit that has characteristics (e.g., F0, gain, spectral distribution) relatively close to the unit being synthesized, and a higher cost is associated with units having a higher discrepancy with the unit being synthesized. A second cost, referred to as the “concatenation cost”, is associated with how smoothly two contiguous units are joined together. For example, if the spectral mismatch between units is poor, perhaps even corresponding to an audible “click”, there will be a higher concatenation cost.
Thus, a set of candidate units for each position in the desired sequence can be formulated, with associated target costs and concatenative costs. Estimating the best (lowest-cost) path through the network is then performed using a Viterbi search. The chosen units may then be concatenated to form one continuous signal, using a variety of different techniques.
While such database-driven systems may produce a more natural sounding voice quality, to do so they require a great deal of computational resources during the synthesis process. Accordingly, there remains a need for new methods and systems that provide natural voice quality in speech synthesis while reducing the computational requirements.
SUMMARY OF THE INVENTION
The need remaining in the prior art is addressed by the present invention, which relates to a system and method for increasing the speed of a unit selection synthesis system for concatenative speech and, more particularly, to predetermining a universe of phonemes in the speech database, selected on the basis of their triphone context, that are potentially used in speech, and performing real-time selection from this precalculated phoneme universe.
In accordance with the present invention, a triphone database is created where for any given triphone context required for synthesis, there is a complete list, precalculated, of all the units (phonemes) in the database that can possibly be used in that triphone context. Advantageously, this list is (in most cases) a significantly smaller set of candidates units than the complete set of units of that phoneme type. By ignoring units that are guaranteed not to be used in the given triphone context, the selection process speed is significantly increased. It has also been found that speech quality is not compromised with the unit selection process of the present invention.
Depending upon the unit required for synthesis, as well as the surrounding phoneme context, the number of phonemes in the preselection list will vary and may, at one extreme, include all possible phonemes of a particular type. There may also arise a situation where the unit to be synthesized (plus context) does not match any of the precalculated triphones. In this case, the conventional single phoneme approach of the prior art may be employed, using the complete set of phonemes of a given type. It is presumed that these instances will be relatively infrequent.
Other and further aspects of the present invention will become apparent during the course of the following discussion and by reference to the accompanying drawings.



BRIEF DESCRIPTION OF THE DRAWINGS
Referring now to the drawings,
FIG. 1 illustrates an exemplary speech synthesis system for utilizing the unit (e.g., phoneme) selection arrangement of the present invention;
FIG. 2 illustrates, in more detail, an exemplary text-to-speech synthesizer that may be used in the system of FIG. 1;
FIG. 3 illustrates an exemplary “phoneme” sequence and the various costs associated with this sequence;
FIG. 4 contains an illustration of an exemplary unit (phoneme) database useful as the unit selection database in the system of FIG. 1;
FIG. 5 is a flowchart illustrating the triphone cost precalculation process of the present invention, where the top N units are selected on the basis of cost (the top 50 units for any 5-phone sequence containing a given triphone being guaranteed to be present); and
FIG. 6 is a flowchart illustrating the unit (phoneme) selection process of the present invention, utilizing the precalculated triphone-indexed list of units (phonemes).



DETAILED DESCRIPTION
An exemplary speech synthesis system 100 is illustrated in FIG. 1. System 100 includes a text-to-speech synthesizer 104 that is connected to a data source 102 through an input link 108, and is likewise connected to a data sink 106 through an output link 110. Text-to-speech synthesizer 104, as discussed in detail below in association with FIG. 2, functions to convert the text data either to speech data or physical speech. In operation, synthesizer 104 converts the text data by first converting the text into a stream of phonemes representing the speech equivalent of the text, then processes the phoneme stream to produce an acoustic unit stream representing a clearer and more understandable speech representation. Synthesizer 104 then converts the acoustic unit stream to speech data or physical speech. In accordance with the teachings of the present invention, as discussed in detail below, database units (phonemes) accessed according to their triphone context, are processed to speed up the unit selection process.
Data source 102 provides text-to-speech synthesizer 104, via input link 108, the data that represents the text to be synthesized. The data representing the text of the speech can be in any format, such as binary, ASCII, or a word processing file. Data source 102 can be any one of a number of different types of data sources, such as a computer, a storage device, or any combination of software and hardware capable of generating, relaying, or recalling from storage, a textual message or any information capable of being translated into speech. Data sink 106 receives the synthesized speech from text-to-speech synthesizer 104 via output link 110. Data sink 106 can be any device capable of audibly outputting speech, such as a speaker system for transmitting mechanical sound waves, or a digital computer, or any combination of hardware and software capable of receiving, relaying, storing, sensing or perceiving speech sound or information representing speech sounds.
Links 108 and 110 can be any suitable device or system for connecting data source 102/data sink 106 to synthesizer 104. Such devices include a direct serial/parallel cable connection, a connection over a wide area network (WAN) or a local area network (LAN), a connection over an intranet, the Internet, or any other distributed processing network or system. Additionally, input link 108 or output link 110 may be software devices linking various software systems.
FIG. 2 contains a more detailed block diagram of text-to-speech synthesizer 104 of FIG. 1. Synthesizer 104 comprises, in this exemplary embodiment, a text normalization device 202, syntactic parser device 204, word pronunciation module 206, prosody generation device 208, an acoustic unit selection device 210, and a speech synthesis back-end device 212. In operation, textual data is received on input link 108 and first applied as an input to text normalization device 202. Text normalization device 202 parses the text data into known words and further converts abbreviations and numbers into words to produce a corresponding set of normalized textual data. For example, if “St.” is input, text normalization device 202 is used to pronounce the abbreviation as either “saint” or “street”, but not the /st/ sound. Once the text has been normalized, it is input to syntactic parser 204. Syntactic processor 204 performs grammatical analysis of a sentence to identify the syntactic structure of each constituent phrase and word. For example, syntactic parser 204 will identify a particular phrase as a “noun phrase” or a “verb phrase” and a word as a noun, verb, adjective, etc. Syntactic parsing is important because whether the word or phrase is being used as a noun or a verb may affect how it is articulated. For example, in the sentence “the cat ran away”, if “cat” is identified as a noun and “ran” is identified as a verb, speech synthesizer 104 may assign the word “cat” a different sound duration and intonation pattern than “ran” because of its position and function in the sentence structure.
Once the syntactic structure of the text has been determined, the text is input to word pronunciation module 206. In word pronunciation module 206, orthographic characters used in the normal text are mapped into the appropriate strings of phonetic segments representing units of sound and speech. This is important since the same orthographic strings may have different pronunciations depending on the word in which the string is used. For example, the orthographic string “gh” is translated to the phoneme /f/ in “tough”, to the phoneme /g/ in “ghost”, and is not directly realized as any phoneme in “though”. Lexical stress is also marked. For example, “record” has a primary stress on the first syllable if it is a noun, but has the primary stress on the second syllable if it is a verb. The output from word pronunciation module 206, in the form of phonetic segments, is then applied as an input to prosody determination device 208. Prosody determination device 208 assigns patterns of timing and intonation to the phonetic segment strings. The timing pattern includes the duration of sound for each of the phonemes. For example, the “re” in the verb “record” has a longer duration of sound than the “re” in the noun “record”. Furthermore, the intonation pattern concerning pitch changes during the course of an utterance. These pitch changes express accentuation of certain words or syllables as they are positioned in a sentence and help convey the meaning of the sentence. Thus, the patterns of timing and intonation are important for the intelligibility and naturalness of synthesized speech. Prosody may be generated in various ways including assigning an artificial accent or providing for sentence context. For example, the phrase “This is a test! ” will be spoken differently from “This is a test? ”. Prosody generating devices are well-known to those of ordinary skill in the art and any combination of hardware, software, firmware, heuristic techniques, databases, or any other apparatus or method that performs prosody generation may be used. In accordance with the present invention, the phonetic output and accompanying prosodic specification from prosody determination device 208 is then converted, using any suitable, well-known technique, into unit (phoneme) specifications.
The phoneme data, along with the corresponding characteristic parameters, is then sent to acoustic unit selection device 210 where the phonemes and characteristic parameters are transformed into a stream of acoustic units that represent speech. An “acoustic unit” can be defined as a particular utterance of a given phoneme. Large numbers of acoustic units, as discussed below in association with FIG. 3, may all correspond to a single phoneme, each acoustic unit differing from one another in terms of pitch, duration, and stress (as well as other phonetic or prosodic qualities). In accordance with the present invention, a triphone preselection cost database 214 is accessed by unit selection device 210 to provide a candidate list of units, based on a triphone context, that are most likely to be used in the synthesis process. Unit selection device 210 then performs a search on this candidate list (using a Viterbi search, for example), to find the “least cost” unit that best matches the phoneme to be synthesized. The acoustic unit stream output from unit selection device 210 is then sent to speech synthesis back-end device 212 which converts the acoustic unit stream into speech data and transmits (referring to FIG. 1) the speech data to data sink 106 over output link 110.
FIG. 3 contains an example of a phoneme string 302-310 for the word “cat” with an associated set of characteristic parameters 312-320 (for example, F0, duration, etc.) assigned, respectively, to each phoneme and a separate list of acoustic unit groups 322, 324 and 326 for each utterance. Each acoustic unit group includes at least one acoustic unit 328 and each acoustic unit 328 includes an associated target cost 330, as defined above. A concatenation cost 332, as represented by the arrow in FIG. 3, is assigned between each acoustic unit 328 in a given group and an acoustic units 332 of the immediately subsequent group.
In the prior art, the unit selection process was performed on a phoneme-by-phoneme basis (or, in more robust systems, on half-phoneme—by—half-phoneme basis) for every instance of each unit contained in the speech database. Thus, when considering the /æ/ phoneme 306, each of its acoustic unit realizations 328 in speech database 324 would be processed to determine the individual target costs 330, compared to the text to be synthesized. Similarly, phoneme-by-phoneme processing (during run time) would also be required for /k/ phoneme 304 and /t/ phoneme 308. Since there are many occasions of the phoneme /æ/ that would not be preceded by /k/ and/or followed by /t/, there were many target costs in the prior art systems that were likely to be unnecessarily calculated.
In accordance with the present invention, it has been recognized that run-time calculation time can be significantly reduced by pre-computing the list of phoneme candidates from the speech database that can possibly be used in the final synthesis before beginning to work out target costs. To this end, a “triphone” database (illustrated as database 214 in FIG. 2) is created where lists of units (phonemes) that might be used in any given triphone context are stored (and indexed using a triphone-based key) and can be accessed during the process of unit selection. For the English language, there are approximately 10,000 common triphones, so the creation of such a database is not an insurmountable task. In particular, for the triphone /k/-/æ/-/t/, each possible /æ/ in the database is examined to determine how well it (and the surrounding phonemes that occur in the speech from which it was extracted) matches the synthesis specifications, as shown in FIG. 4. By then allowing the phonemes on either side of /k/ and /t/ to vary over the complete universe of phonemes, all possible costs can be examined that may be calculated at run-time for a particular phoneme in a triphone context. In particular, when synthesis is complete, only the N “best” units are retained for any 5-phoneme context (in terms of lowest concatenation cost; in one example N may be equal to 50). It is possible to “combine” (i.e., take the union of) the relevant units that have a particular triphone in common. Because of the way this calculation is arranged, the combination is guaranteed to be the list of all units that are relevant for this specific part of the synthesis.
In most cases, there will be number of units (i.e., specific instances of the phonemes) that will not occur in the union of possible all units, and therefore need never be considered in calculating the costs at run time. The preselection process of the present invention, therefore, results in increasing the speed of the selection process. In one instance, an increase of 100% has been achieved. It is to be presumed that if a particular triphone does not appear to have an associated list of units, the conventional unit cost selection process will be used.
In general, therefore, for any unit u2 that is to be synthesized as part of the triphone sequence u1-u2-u3, the preselection cost for every possible 5-phone combination ua-u1-u2-u3-ub that contains this triphone is calculated. It is to be noted that this process is also useful in systems that utilize half-phonemes, as long as “phoneme” spacing is maintained in creating each triphone cost that is calculated. Using the above example, one sequence would be k1-æ1-t1 and another would be k2-æ2-t2. This unit spacing is used to avoid including redundant information in the cost functions (since the identity of one of the adjacent half-phones is already a known quantity). In accordance with the present invention, the costs for all sequences ua-k1-æ1-t1-ub are calculated, where ua and ub are allowed to vary over the entire phoneme set. Similarly, the costs for all sequences ua-k2-æ2-t2-ub are calculated, and so on for each possible triphone sequence. The purpose of calculating the costs offline is solely to determine which units can potentially play a role in the subsequent synthesis, and which can be safely ignored. It is to be noted that the specific relevant costs are re-calculated at synthesis time. This re-calculation is necessary, since a component of the cost is dependent on knowledge of the particular synthesis specification, available only at run time.
Formally, for each individual phoneme to be synthesized, a determination is first made to find a particular triphone context that is of interest. Following that, a determination is made with respect to which acoustic units are either within or outside of the acceptable cost limit for that triphone context. The union of all chosen 5-phone sequences is then performed and associated with the triphone to be synthesized. That is:




  
    PreslectSet
    ⁡
    
      (
      
        
          u
          1
        
        ,
        
          u
          2
        
        ,
        
          u
          3
        
      
      )
    
  
  =
  
    
      ⋃
      
        a
        ∈
        PH
      
    
    ⁢
    
      
        ⋃
        
          b
          ∈
          PH
        
      
      ⁢
      
        
          CC
          n
        
        ⁡
        
          (
          
            
              u
              a
            
            ,
            
              u
              1
            
            ,
            
              u
              2
            
            ,
            
              u
              3
            
            ,
            
              u
              b
            
          
          )
        
      
    
  




where CCn is a function for calculating the set of units with the lowest n context costs and CCn is a function which calculated the n-best matching units in the database for the given context. PH is defined as the set of unit types. The value of “n” refers to the minimum number of candidates that are needed for any given sequence of the form ua-u1-u2-u3-ub.

FIG. 5 shows, in simplified form, a flowchart illustrating the process used to populate the triphone cost database used in the system of the present invention. The process is initiated at block 500 and selects a first triphone u1-u2-u3 (block 502) for which preselection costs will be calculated. The process then proceeds to block 504 which selects a first pair of phonemes to be to the “left” ua and “right” ub phonemes of the previously selected triphone. The concatenation costs associated with this 5-phone grouping are calculated (block 506) and stored in a database with this particular triphone identity (block 508). The preselection costs for this particular triphone are calculated by varying phonemes ua and ub over the complete set of phonemes (block 510). Thus, a preselection cost will be calculated for the selected triphone in a 5-phoneme context. Once all possible 5-phoneme combinations of a selected triphone have been evaluated and a cost determined, the “best” are retained, with the proviso that for any arbitrary 5-phoneme context, the set is guaranteed to contain the top N units. The “best” units are defined as exhibiting the lowest target cost (block 512). In an exemplary embodiment, N=50. Once the “top 50” choices for a selected triphone have been stored in the triphone database, a check is made (block 514) to see if all possible triphone combinations have been evaluated. If so, the process stops and the triphone database is defined as completed. Otherwise, the process returns to step 502 and selects another triphone for evaluation, using the same method. The process will continue until all possible triphone combinations have been reviewed and the costs calculated. It is an advantage of the present invention that this process is performed only once, prior to “run time”, so that during the actual synthesis process (as illustrated in FIG. 6), the unit selection process uses this created triphone database.
FIG. 6 is a flowchart of an exemplary speech synthesis system. At its initiation (block 600), a first step is to receive the input text (block 610) and apply it (block 620) as an input to text normalization device 202 (as shown in FIG. 2). The normalized text is then syntactically parsed (block 630) so that the syntactic structure of each constituent phrase or word is identified as, for example, a noun, verb, adjective, etc. The syntactically parsed text is then converted to a phoneme-based representation (block 640), where these phonemes are then applied as inputs to a unit (phoneme) selection module, such as unit selection device 210 discussed in detail above in association with FIG. 2. A preselection triphone database 214, such as that generated by following the steps as outlined in FIG. 5 is added to the configuration. Where a match is found with a triphone key in the database, the prior art process of assessing every possible candidate of a particular unit (phoneme) type is replaced by the inventive process of assessing the shorter, precalculated list related to the triphone key. A candidate list of each requested unit is generated and a Viterbi search is performed (block 650) to find the lowest cost path through the selected phonemes. The selected phonemes may then be further processed (block 660) to form the actual speech output.
Although the above description may contain specific details, they should not be construed as limiting the claims in any way. Other configurations of the described embodiments of the invention are part of the scope of this invention. Accordingly, the appended claims and their legal equivalents should only define the invention, rather than any specific examples given.

## Claims

1. A computing device that generates a database for use in speech synthesis, the computing device generating the database according to a method comprising:
selecting a triphone sequence;
calculating a preselection cost for each 5-phoneme sequence where a unit of the 5-phoneme sequence is allowed to match any identically labeled phoneme in a database and at least two units of the 5-phoneme sequence vary over the entire phoneme universe; and
storing a group of the selected triphone sequences exhibiting the lowest costs in a triphone preselection cost database by:
determining a plurality of N least cost database units for the particular 5-phoneme context;
performing the union of the N least cost units for all combinations of the at least two units;
storing the union created in the step of performing the union in the triphone preselection cost database; and
repeating steps of selecting, calculating and storing a group of the selected triphone sequences for each possible triphone sequence.

2. The computing device of claim 1, wherein the triphone sequence comprises u1-u2-u3 and the 5-phoneme sequence comprises ua-u1-u2-u3-ub, where u2 is allowed to match any identically labeled phoneme in a database and the at least two units comprise ua and ub vary over the entire phoneme universe.

3. The computing device of claim 1, wherein the method for generating the database further comprises generating a key to index each triphone in the database.

4. The computing device of claim 1, wherein a plurality of fifty least costs sequences for any possible 5-phone context are stored.

5. The computing device of claim 1 wherein the preselection cost is the target cost or an element of the target cost.

6. A method for generating a triphone preselection cost database for use in speech synthesis, the method comprising, for each of plurality of triphone sequences:
calculating a preselection cost for each 5-phoneme sequence, wherein a triphone sequence of the plurality of triphone sequences is included in each 5-phoneme sequence;
storing a group of triphone sequences exhibiting the lowest costs in a triphone preselection cost database by:
a) determining a plurality of N least cost database units for the particular 5-phoneme context:
b) performing the union of the N least cost units for all combinations of two selected units from the 5-phoneme sequence; and
c) storing the union created in step b) in the triphone preselection cost database.

7. The method of claim 6, wherein the selected triphone sequence comprises u1-u2-u3 and the 5-phoneme sequence comprises ua-u1-u2-u3-ub, where u2 is allowed to match any identically labeled phoneme in a database and the units ua and ub vary over the entire phoneme universe, and wherein the two selected units from the 5-phoneme sequence for which the union is performed are ua and ub.

8. The method of claim 6, further comprising generating a key to index each triphone in the triphone cost selection database.

9. The method of claim 6, wherein a plurality of fifty least costs sequences for any possible 5-phoneme context are stored.

10. The method of claim 6, wherein the preselection cost is a target cost or an element of the target cost.

11. A computer-readable medium storing instructions for controlling a computing device to generate a triphone preselection cost database for use in speech synthesis, the instructions comprising, for each of plurality of triphone sequences:
calculating a preselection cost for each 5-phoneme sequence, wherein a triphone sequence of the plurality of triphone sequences is included in each 5-phoneme sequence;
storing a group of triphone sequences exhibiting the lowest costs in a triphone preselection cost database by:
a) determining a plurality of N least cost database units for the particular 5-phoneme context;
b) performing the union of the N least cost units for all combinations of two selected units from the 5-phoneme sequence; and
c) storing the union created in step b) in the triphone preselection cost database.

12. The computer-readable medium of claim 11, wherein the selected triphone sequence comprises u1-u2-u3 and the 5-phoneme sequence comprises ua-u1-u2-u3-ub, where u2 is allowed to match any identically labeled phoneme in a database and the units ua and ub vary over the entire phoneme universe, and wherein the two selected units from the 5-phoneme sequence for which the union is performed are ua and ub.

13. The computer-readable medium of claim 11, further comprising generating a key to index each triphone in the triphone cost selection database.

14. The computer-readable medium of claim 11, wherein a plurality of fifty least costs sequences for any possible 5-phoneme context are stored.

15. The computer-readable medium of claim 11, wherein the preselection cost is a target cost or an element of the target cost.