EP1777697B1 - Method for speech synthesis without prosody modification - Google Patents
Method for speech synthesis without prosody modification Download PDFInfo
- Publication number
- EP1777697B1 EP1777697B1 EP07002565A EP07002565A EP1777697B1 EP 1777697 B1 EP1777697 B1 EP 1777697B1 EP 07002565 A EP07002565 A EP 07002565A EP 07002565 A EP07002565 A EP 07002565A EP 1777697 B1 EP1777697 B1 EP 1777697B1
- Authority
- EP
- European Patent Office
- Prior art keywords
- speech
- context
- training
- input
- unit
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Lifetime
Links
- 238000000034 method Methods 0.000 title claims description 34
- 230000015572 biosynthetic process Effects 0.000 title claims description 16
- 238000003786 synthesis reaction Methods 0.000 title claims description 16
- 230000004048 modification Effects 0.000 title description 7
- 238000012986 modification Methods 0.000 title description 7
- 239000013598 vector Substances 0.000 claims description 63
- 238000012549 training Methods 0.000 claims description 39
- 238000003066 decision tree Methods 0.000 claims description 17
- 230000002194 synthesizing effect Effects 0.000 claims 1
- 238000003860 storage Methods 0.000 description 17
- 239000000523 sample Substances 0.000 description 14
- 238000004891 communication Methods 0.000 description 12
- 238000010586 diagram Methods 0.000 description 12
- 238000012545 processing Methods 0.000 description 11
- 230000008569 process Effects 0.000 description 7
- 230000009467 reduction Effects 0.000 description 7
- 230000001419 dependent effect Effects 0.000 description 5
- 230000003287 optical effect Effects 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 4
- 230000002093 peripheral effect Effects 0.000 description 4
- 238000013459 approach Methods 0.000 description 3
- 230000007246 mechanism Effects 0.000 description 3
- 230000006855 networking Effects 0.000 description 3
- 230000004044 response Effects 0.000 description 3
- 239000000654 additive Substances 0.000 description 2
- 230000000996 additive effect Effects 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 230000005055 memory storage Effects 0.000 description 2
- 239000007787 solid Substances 0.000 description 2
- CDFKCKUONRRKJD-UHFFFAOYSA-N 1-(3-chlorophenoxy)-3-[2-[[3-(3-chlorophenoxy)-2-hydroxypropyl]amino]ethylamino]propan-2-ol;methanesulfonic acid Chemical compound CS(O)(=O)=O.CS(O)(=O)=O.C=1C=CC(Cl)=CC=1OCC(O)CNCCNCC(O)COC1=CC=CC(Cl)=C1 CDFKCKUONRRKJD-UHFFFAOYSA-N 0.000 description 1
- 241001364096 Pachycephalidae Species 0.000 description 1
- 238000010420 art technique Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000005520 cutting process Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000009499 grossing Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000013138 pruning Methods 0.000 description 1
- 230000000717 retained effect Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
- 230000007704 transition Effects 0.000 description 1
- 230000007723 transport mechanism Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G10—MUSICAL INSTRUMENTS; ACOUSTICS
- G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
- G10L13/00—Speech synthesis; Text to speech systems
- G10L13/06—Elementary speech units used in speech synthesisers; Concatenation rules
- G10L13/07—Concatenation rules
-
- G—PHYSICS
- G10—MUSICAL INSTRUMENTS; ACOUSTICS
- G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
- G10L13/00—Speech synthesis; Text to speech systems
- G10L13/02—Methods for producing synthetic speech; Speech synthesisers
- G10L13/04—Details of speech synthesis systems, e.g. synthesiser structure or memory management
Definitions
- the present invention relates to speech synthesis.
- the present- invention relates to prosody in speech synthesis.
- Text-to-speech technology allows computerized systems to communicate with users through synthesized speech.
- the quality of these systems is typically measured by how natural or human-like the synthesized speech sounds.
- Very natural sounding speech can be produced by simply replaying a recording of an entire sentence or paragraph of speech.
- the complexities of human languages and the limitations of computer storage make it impossible to store every conceivable sentence that may occur in a text.
- This concatenative approach combines stored speech samples representing small speech units such as phonemes, diphones, triphones, or syllables to form a larger speech signal.
- a stored speech sample has a pitch and duration that is set by the context in which the sample was spoken. For example, in the sentence “Joe went to the store” the speech units associated with the word “store” have a lower pitch than in the question "Joe went to the store?" Because of this, if stored samples are simply retrieved without reference to their pitch or duration, some of the samples will have the wrong pitch and/or duration for the sentence resulting in unnatural sounding speech.
- One technique for overcoming this is to identify the proper pitch and duration for each sample. Based on this prosody information, a particular sample may be selected and/or modified to match the target pitch and duration.
- Identifying the proper pitch and duration is known as prosody prediction. Typically, it involves generating a model that describes the most likely pitch and duration for each speech unit given some text. The result of this prediction is a set of numerical targets for the pitch and duration -of each speech segment.
- targets can then be used to select and/or modify a stored speech segment.
- the targets can be used to first select the speech segment that has the closest pitch and duration to the target pitch and duration. This segment can then be used directly or can be further modified to better match the target values.
- TD-PSOLA Time-Domain Pitch-Synchronous Overlap-and-Add
- the prior art copies a segment of the complex waveform that is as long as the pitch period. This copied segment is then shifted by some portion of the pitch period and reinserted into the waveform. For example, to double the pitch, the copied segment would be shifted by one-half the pitch period, thereby inserting a new peak half-way between two existing peaks and cutting the pitch period in half.
- the prior art copies a section of the speech segment and inserts the copy into the complex waveform.
- the entire portion of the speech segment after the copied segment is time-shifted by the length of the copied section so that the duration of the speech unit increases.
- US 6,064,960 describes a method and an apparatus for duration modeling of phonemes in a speech synthesis system.
- the phoneme duration model which is used along with a phoneme pitch model, is produced by developing a non-exponential functional transformation form for use with a generalized additive model.
- the received text is processed by specifying at least one of a number of contextual factors for the generalized additive model.
- FIG. 1 illustrates an example of a suitable computing system environment 100 on which the invention may be implemented.
- the computing system environment 100 is only one example of a suitable computing environment and is not intended to suggest any limitation as to the scope of use or functionality of the invention. Neither should the computing environment 100 be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the exemplary operating environment 100.
- the invention is operational with numerous other general purpose or special purpose computing system environments or configurations.
- Examples of well known computing systems, environments, and/or configurations that may be suitable for use with the invention include, but are not limited to, personal computers, server computers, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.
- the invention may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer.
- program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types.
- the invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network.
- program modules may be located in both local and remote computer storage media including memory storage devices.
- an exemplary system for implementing the invention includes a general-purpose computing device in the form of a computer 110.
- Components of computer 110 may include, but are not limited to, a processing unit 120, a system memory 130, and a system bus 121 that couples various system components including the system memory to the processing unit 120.
- the system bus 121 may be any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of bus architectures.
- such architectures include Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus also known as Mezzanine bus.
- ISA Industry Standard Architecture
- MCA Micro Channel Architecture
- EISA Enhanced ISA
- VESA Video Electronics Standards Association
- PCI Peripheral Component Interconnect
- Computer 110 typically includes a variety of computer readable media.
- Computer readable media can be any available media that can be accessed by computer 110 and includes both volatile and nonvolatile media, removable and non-removable media.
- Computer readable media may comprise computer storage media and communication media.
- Computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data.
- Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by computer 100.
- Communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media.
- modulated data signal means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal.
- communication media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, FR, infrared and other wireless media. Combinations of any of the above should also be included within the scope of computer readable media.
- the system memory 130 includes computer storage media in the form' of volatile and/or nonvolatile memory such as read only memory (ROM) 131 and random access memory (RAM) 132.
- ROM read only memory
- RAM random access memory
- BIOS basic input/output system
- RAM 132 typically contains data and/or program modules that are immediately accessible to and/or presently being operated on by processing unit 120.
- FIG. 1 illustrates operating system 134, application programs 135, other program modules 136, and program data 137.
- the computer 110 may also include other removable/non-removable volatile/nonvolatile computer storage media.
- FIG. 1 illustrates a hard disk drive 141 that reads from or writes to non-removable, nonvolatile magnetic media, a magnetic disk drive 151 that reads from or writes to a removable, nonvolatile magnetic disk 152, and an optical disk drive 155 that reads from or writes to a removable, nonvolatile optical disk 156 such as a CD RCM or other optical media.
- removable/non-removable, volatile/nonvolatile computer storage media that can be used in the exemplary operating environment include, but are not limited to, magnetic tape cassettes, flash memory cards, digital versatile disks, digital video tape, solid state RAM, solid state ROM, and the like.
- the hard disk drive 141 is typically connected to the system bus 121 through a non-removable memory interface such as interface 140, and magnetic disk drive 151 and optical disk drive 155 are typically connected to the system bus 121 by a removable memory interface, such as interface 150.
- hard disk drive 141 is illustrated as storing operating system 144, application programs 145, other program modules 146, and program data 147. Note that these components can either be the same as or different from operating system 134, application programs 135, other program modules 136, and program data 137. Operating system 144, application programs 145, other program modules 146, and program data 147 are given different numbers here to illustrate that, at a minimum, they are different copies.
- a user may enter commands and information into the computer 110 through input devices such as a keyboard 162, a microphone 163, and a pointing device 161, such as a mouse, trackball or touch pad.
- Other input devices may include a joystick, game pad, satellite dish, scanner, or the like.
- a monitor 191 or other type of display device is also connected to the system bus 121 via an interface, such as a video interface 190.
- computers may also include other peripheral output devices such as speakers 197 and printer 196, which may be connected through an output peripheral interface 190.
- the computer 110 may operate in a networked environment using logical connections to one or more remote computers, such as a remote computer 180.
- the remote computer 180 may be a personal computer, a hand-held device, a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above relative to the computer 110.
- the logical connections depicted in FIG. 1 include a local area network (LAN) 171 and a wide area network (WAN) 173, but may also include other networks.
- LAN local area network
- WAN wide area network
- Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets and the Internet.
- the computer 110 When used in a LAN networking environment, the computer 110 is connected to the LAN 171 through a network interface or adapter 170. When used in a WAN networking environment, the computer 110 typically includes a modem 172 or other means for establishing communications over the WAN 173, such as the Internet.
- the modem 172 which may be internal or external, may be connected to the system bus 121 via the user input interface 160, or other appropriate mechanism.
- program modules depicted relative to the computer 110, or portions thereof may be stored in the remote memory storage device.
- FIG. 1 illustrates remote application programs 185 as residing on remote computer 180. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers may be used.
- FIG. 2 is a block diagram of a mobile device 200, which is an exemplary computing environment.
- Mobile device 200 includes a microprocessor 202, memory 204, input/output (I/O) components 206, and a communication interface 208 for communicating with remote computers or other mobile devices.
- I/O input/output
- the afore-mentioned components are coupled for communication with one another over a suitable bus 210.
- Memory 204 is implemented as non-volatile electronic memory such as random access memory (RAM) with a battery back-up module (not shown) such that information stored in memory 204 is not lost when the general power to mobile device 200 is shut down.
- RAM random access memory
- a portion of memory 204 is preferably allocated as addressable memory for program execution, while another portion of memory 204 is preferably used for storage, such as to simulate storage on a disk drive.
- Memory 204 includes an operating system 212, application programs 214 as well as an object store 216.
- operating system 212 is preferably executed by processor 202 from memory 204.
- Operating system 212 in one preferred embodiment, is a WINDOWS® CE brand operating system commercially available from Microsoft Corporation.
- Operating system 212 is preferably designed for mobile devices, and implements database features that can be utilized by applications 214 through a set of exposed application programming interfaces and methods.
- the objects in object store 216 are maintained by applications 214 and operating system 212, at least partially in response to calls to the exposed application programming interfaces and methods.
- Communication interface 208 represents numerous devices and technologies that allow mobile device 200 to send and receive information.
- the devices include wired and wireless modems, satellite receivers and broadcast tuners to name a few.
- Mobile device 200 can also be directly connected to a computer to exchange data therewith.
- communication interface 208 can be an infrared transceiver or a serial or parallel communication connection, all of which are capable of transmitting streaming information.
- Input/output components 206 include a variety of input devices such as a touch-sensitive screen, buttons, rollers, and a microphone as well as a variety of output devices including an audio generator, a vibrating device, and a display.
- input devices such as a touch-sensitive screen, buttons, rollers, and a microphone
- output devices including an audio generator, a vibrating device, and a display.
- the devices listed above are by way of example and need not all be present on mobile device 200.
- other input/output devices may be attached to or found with mobile device 200 within the scope of the present invention.
- a speech synthesizer that concatenates stored samples of speech units without modifying the prosody of the samples.
- the present invention is able to achieve a high level of naturalness in synthesized speech with a carefully designed speech corpus by storing samples based on the prosodic and phonetic context in which they occur.
- the present invention limits the training text to those sentences that will produce the most frequent sets of prosodic contexts for each speech unit.
- the present invention also provides a multi-tier selection mechanism for selecting a set of samples that will produce the most natural sounding speech.
- FIG. 3 is a block diagram of a speech synthesizer 300 that is capable of constructing synthesized speech 302 from an input text 304 under embodiments of the present invention.
- speech synthesizer 300 Before speech synthesizer 300 can be utilized to construct speech 302, it must be initialized with samples of speech units taken from a training text 306 that is read into speech synthesizer 300 as training speech 308.
- speech synthesizers are constrained by a limited size memory. Because of this, training text 306 must be limited in size to fit within the memory. However, if the training text is too small, there will not be enough samples of the training speech to allow for concatenative synthesis without prosody modifications.
- One aspect of the present invention overcomes this problem by trying to identify a set of speech units in a very large text corpus that must be included in the training text to allow for concatenative synthesis without prosody modifications.
- FIG. 4 provides a block diagram of components used to identify smaller training text 306 of FIG. 3 from a very large corpus 400.
- very large corpus 400 is a corpus of five years worth of the People's Daily, a Chinese newspaper, and contains about 97 million Chinese Characters.
- large corpus 400 is parsed by a parser/semantic identifier 402 into strings of individual speech units.
- the speech units are tonal syllables.
- other speech units such as phonemes, diphones, or triphones may be used within the scope of the present invention.
- Parser/semantic identifier 402 also identifies high-level prosodic information about each sentence provided to the parser. This high-level prosodic information includes the predicted tonal levels for each speech unit as well as the grouping of speech units into prosodic words and phrases. In embodiments where tonal syllable speech units are used, parser/semantic identifier 402 also identifies the first and last phoneme in each speech unit.
- the strings of speech units produced from the training text are provided to a context vector generator 404, which generates a Speech unit-Dependent Descriptive Contextual Variation Vector (SDDCVV, hereinafter referred to as a context vector).
- SDDCVV Speech unit-Dependent Descriptive Contextual Variation Vector
- the context vector describes several context variables that can affect the prosody of the speech unit. Under one embodiment, the context vector describes six variables or coordinates. They are:
- the position-in-phrase coordinate and the position-in-word coordinate can each have one of four values
- the left phonetic context can have one of eleven values
- the right phonetic context can have one of twenty-six values
- the left and right tonal contexts can each have one of two values.
- there are 4 * 4 * 11 * 26 * 2 * 2 18304 possible context vectors for each speech unit.
- the context vectors produced by generator 404 are grouped based on their speech unit. For each speech unit, a frequency-based sorter 406 identifies the most frequent context vectors for each speech unit. The most frequently occurring context vectors for each speech unit are then stored in a list of necessary context vectors 408. In one embodiment, the top context vectors, whose accumulated frequency of occurrence is not less than half of the total frequency of occurrence of all units, are stored in the list.
- the sorting and pruning performed by sorter 406 is based on a discovery made by the present inventors.
- the present inventors have found that certain context vectors occur repeatedly in the corpus. By making sure that these context vectors are found in the training corpus, the present invention increases the chances of having an exact context match for an input text without greatly increasing the size of the training corpus. For example, the present inventors have found that by ensuring that the top two percent of the context vectors are represented in the training corpus, an exact context match will be found for an input text speech unit over fifty percent of the time.
- a text selection unit 410 selects sentences from very large corpus 400 to produce training text subset 306.
- text selection unit 410 uses a greedy algorithm to select sentences from corpus 400. Under this greedy algorithm, selection unit 410 scans all sentences in the corpus and picks out one at a time to add to the selected group.
- selection unit 410 determines how many context vectors in list 408 are found in each sentence. The sentence that contains the maximum number of needed context vectors is then added to training text 306. The context vectors that the sentence contains are removed from list 408 and the sentence is removed from the large text corpus 400. The scanning is repeated until all of the context vectors have been removed from list 408.
- training text subset 306 After training text subset 306 has been formed, it is read by a person and digitized into a training speech corpus. Both the training text and training speech can be used to initialize speech synthesizer 300 of FIG. 3 . This initialization begins by parsing the sentences of text 306 into individual speech units that are annotated with high-level prosodic information. In FIG. 3 , this is accomplished by a parser/semantic identifier 310, which is similar to parser/semantic identifier 402 of FIG. 4 . The parsed speech units and their high-level prosodic description are then provided to a context vector generator 312, which is similar to context vector generator 404 of FIG. 4 .
- the context vectors produced by context vector generator 312 are provided to a component storing unit 314 along with speech samples produced by a sampler 316 from training speech signal 308. Each sample provided by sampler 316 corresponds to a speech unit identified by parser 310. Component storing unit 314 indexes each speech sample by its context vector to form an indexed set of stored speech components 318.
- the samples are indexed by a prosody-dependent decision tree (PDDT), which is formed automatically using a classification and regression tree (CART).
- PDDT prosody-dependent decision tree
- CART provides a mechanism for selecting questions that can be used to divide the stored speech components into small groups of similar speech samples. Typically, each question is used to divide a group of speech components into two smaller groups. With each question, the components in the smaller groups become more homogenous. The process for using CART to form the decision tree is shown in FIG. 5 .
- a list of candidate questions is generated for the decision tree.
- each question is directed toward some coordinate or combination of coordinates in the context vector.
- an expected square error is determined for all of the training samples from sampler 316.
- the expected square error gives a measure of the distances among a set of features of each sample in a group.
- the features are prosodic features of average fundamental frequency (F a ), average duration (F b ), and range of the fundamental frequency (F c ) for a unit.
- ESE(t) is the expected square error for all samples X on node t in the decision tree
- E a , E b , and E c are the square error for F a , F b , and F c , respectively
- W a , W b , and W e are weights
- the operation of determining the expected value of the sum of square errors is indicated by the outer E().
- 2 , j a , b , c
- R(F j ) is a regression value calculated from samples X on node t.
- the first question in the question list is selected at step 504.
- the selected question is applied to the context vectors at step 506 to group the samples into candidate sub-nodes for the tree.
- the expected square error of each sub-node is then determined at step 508 using equations 1 and 2 above.
- a reduction in expected square error created by generating the two sub-nodes is determined.
- ⁇ WESE(t) is the reduction in expected square error
- ESE(t) is the expected square error of node t, against which the question was applied
- P(t) is the percentage of samples in node t
- ESE(1) and ESE(r) are the expected square error of the left and right sub-nodes formed by the question, respectively
- P(1) and P(r) are the percentage of samples in the left and right node, respectively.
- the reduction in expected square error provided by the current question is stored and the CART process determines if the current question is the last question in the list at step 512. If there are more questions in the list, the next question is selected at step 514 and the process returns to step 506 to divide the current node into sub-nodes based on the new question.
- each leaf node when the decision tree is in its final form, each leaf node will contain a number of samples for a speech unit. These samples have slightly different prosody from each other. For example, they may have different phonetic contexts or different tonal contexts from each other. By maintaining these minor differences within a leaf node, this embodiment of the invention introduces slender diversity in prosody, which is helpful in removing monotonous prosody.
- step 516 If the current leaf nodes are to be further divided at step 516, a leaf node is selected at step 518 and the process returns to step 504 to find a question to associate with the selected node. If the decision tree is complete at step 516, the process of FIG. 5 ends at step 520.
- FIG. 5 results in a prosody-dependent decision tree 320 of FIG. 3 and a set of stored speech samples 318, indexed by decision tree 320.
- decision tree 320 and speech samples 318 can be used under further aspects of the present invention to generate concatenative speech without requiring prosody modification.
- the process for forming concatenative speech begins by parsing a sentence in input text 304 using parser/semantic identifier 310 and identifying high-level prosodic information for each speech unit produced by the parse. This prosodic information is then provided to context vector generator 312, which generates a context vector for each speech unit identified in the parse. The parsing and the production of the context vectors are performed in the same manner as was done during the training of prosody decision tree 320.
- the context vectors are provided to a component locator 322, which uses the vectors to identify a set of samples for the sentence.
- component locator 322 uses a multi-tier non-uniform unit selection algorithm to identify the samples from the context vectors.
- FIGS. 6 and 7 provide a block diagram and a flow diagram for the multi-tier non-uniform selection algorithm.
- each vector in the set of input context vectors is applied to prosody-dependent decision tree 320 to identify a leaf node array 600 that contains a leaf node for each context vector.
- a set of distances is determined by a distance calculator 602 for each input context vector. In particular, a separate distance is calculated between the input context vector and each context vector found in its respective leaf node.
- D c the context distance
- D i the distance for coordinate i of the context vector
- W ci is a weight associated with coordinate i
- I the number of coordinates in each context vector.
- the N samples with the closest context vectors are retained while the remaining samples are pruned from node array 600 to form pruned leaf node array 604.
- the number of samples, N, to leave in the pruned nodes is determined by balancing improvements in prosody with improved processing time. In general, more samples left in the pruned nodes means better prosody at the cost of longer processing time.
- the pruned array is provided to a Viterbi decoder 606, which identifies a lowest cost path through the pruned array.
- the lowest cost path is identified simply by selecting the sample with the closest context vector in each node.
- C c is the concatenation cost for the entire sentence
- W c is a weight associated with the distance measure of the concatenated cost
- D cj is the distance calculated in equation 4 for the j th speech unit in the sentence
- W s is a weight associated with a smoothness measure of the concatenated cost
- C sj is a smoothness cost for the j th speech unit
- J is the number of speech units in the sentence.
- the smoothness cost in Equation 5 is defined to provide a measure of the prosodic mismatch between sample j and the samples proposed as the neighbors to sample j by the Viterbi decoder.
- the smoothness cost is determined based on whether a sample and its neighbors were found as neighbors in an utterance in the training corpus. If a sample occurred next to its neighbors in the training corpus, the smoothness cost is zero since the samples contain the proper prosody to be combined together. If a sample did not occur next to its neighbors in the training corpus, the smoothness cost is set to one.
- the identified samples 608 are provided to speech constructor 303.
- speech constructor 303 simply concatenates the speech units to form synthesized speech 302. Thus, the speech units are combined without having to change their prosody.
Landscapes
- Engineering & Computer Science (AREA)
- Computational Linguistics (AREA)
- Health & Medical Sciences (AREA)
- Audiology, Speech & Language Pathology (AREA)
- Human Computer Interaction (AREA)
- Physics & Mathematics (AREA)
- Acoustics & Sound (AREA)
- Multimedia (AREA)
- Machine Translation (AREA)
- Document Processing Apparatus (AREA)
Description
- The present invention relates to speech synthesis. In particular, the present- invention relates to prosody in speech synthesis.
- Text-to-speech technology allows computerized systems to communicate with users through synthesized speech. The quality of these systems is typically measured by how natural or human-like the synthesized speech sounds.
- Very natural sounding speech can be produced by simply replaying a recording of an entire sentence or paragraph of speech. However, the complexities of human languages and the limitations of computer storage make it impossible to store every conceivable sentence that may occur in a text. Because of this, the art has adopted a concatenative approach to speech synthesis that can be used to generate speech from any text. This concatenative approach combines stored speech samples representing small speech units such as phonemes, diphones, triphones, or syllables to form a larger speech signal.
- One problem with such concatenative systems is that a stored speech sample has a pitch and duration that is set by the context in which the sample was spoken. For example, in the sentence "Joe went to the store" the speech units associated with the word "store" have a lower pitch than in the question "Joe went to the store?" Because of this, if stored samples are simply retrieved without reference to their pitch or duration, some of the samples will have the wrong pitch and/or duration for the sentence resulting in unnatural sounding speech.
- One technique for overcoming this is to identify the proper pitch and duration for each sample. Based on this prosody information, a particular sample may be selected and/or modified to match the target pitch and duration.
- Identifying the proper pitch and duration is known as prosody prediction. Typically, it involves generating a model that describes the most likely pitch and duration for each speech unit given some text. The result of this prediction is a set of numerical targets for the pitch and duration -of each speech segment.
- These targets can then be used to select and/or modify a stored speech segment. For example, the targets can be used to first select the speech segment that has the closest pitch and duration to the target pitch and duration. This segment can then be used directly or can be further modified to better match the target values.
- For example, one prior art technique for modifying the prosody of speech segments is the so-called Time-Domain Pitch-Synchronous Overlap-and-Add (TD-PSOLA) technique, which is described in "Pitch-Synchronous Waveform Processing Techniques for Text-to-Speech Synthesis using Diphones", E. Moulines and F. Charpentier, Speech Communication, vol. 9, no. 5, pp. 453-467, 1990. Using this technique, the prior art increases the pitch of a speech segment by identifying a section of the speech - segment responsible for the pitch. This section is a complex waveform that is a sum of sinusoids at multiples of a fundamental frequency F0. The pitch period is defined by the distance between two pitch peaks in the waveform.
- To increase the pitch, the prior art copies a segment of the complex waveform that is as long as the pitch period. This copied segment is then shifted by some portion of the pitch period and reinserted into the waveform. For example, to double the pitch, the copied segment would be shifted by one-half the pitch period, thereby inserting a new peak half-way between two existing peaks and cutting the pitch period in half.
- To lengthen a speech segment, the prior art copies a section of the speech segment and inserts the copy into the complex waveform. In other words, the entire portion of the speech segment after the copied segment is time-shifted by the length of the copied section so that the duration of the speech unit increases.
- Unfortunately, these techniques for modifying the prosody of a speech unit have not produced completely satisfactory results. In particular, these modification techniques tend to produce mechanical or "buzzy" sounding speech.
- Thus, it would be desirable to be able to select a stored unit that provides good prosody without modification. However, because of memory limitations, samples cannot be stored for all of the possible prosodic contexts in which a speech-unit may be used. Instead, a limited set of samples must be selected for storage. Because of this, the performance of a system that uses stored samples without prosody modification is dependent on what samples are stored.
- Thus, there is an ongoing need for improving the selection of these stored samples in systems that do not modify the prosody of the stored samples. There is also an ongoing need to reduce the computational complexity associated with identifying the proper prosody for the speech units.
- From "Recent Improvements on Microsoft's Trainable Text-to-Speech System - Whistler" by X. Huang et al., IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP-97, Munich, Germany 21-24 April 1997, p. 959 - 962, a trainable text-to-speech system is known. The prosodic patterns of speech can be modeled by predicting several accentual classes of syllables. The units for the concatenative synthesizer are generated from a database recorded by target speaker. As synthesis units, decision tree based senones are used.
-
US 6,064,960 describes a method and an apparatus for duration modeling of phonemes in a speech synthesis system. The phoneme duration model, which is used along with a phoneme pitch model, is produced by developing a non-exponential functional transformation form for use with a generalized additive model. The received text is processed by specifying at least one of a number of contextual factors for the generalized additive model. - From "Concatenating Syllables for Response Generation in Spoken Language Applications" by Tien Ying Fung and Helen M. Meng, IEEE International Conference on Acoustics, Speech, and Signal Processing, 2000, Istanbul, Turkey, 5-9 June 2000, p. 933 - 936, a speech synthesis technique for response generation is known. The syllable is selected to be the basic unit for concatenation. Each unit label includes a two digit appendix to encode the distinctive features of the left and right coaritculatory context.
- In "Unit Selection in a Concatenative Speech Synthesis System using a Large Speech Database" by Hunt et al., 1996 IEEE International Conference on Acoustics, Speech, and Signal Processing - Proceedings (ICASSP), Atlanta, USA, May 7 - 10, 1996, Vol. 1 Conf. 21, pages 373 - 376, a concatenative speech synthesis system in which speech units are selected from a large speech database is described. The units in the synthesis database are considered as a state transition network in which the state occupancy cost is the distance between a database unit and a target and a precision cost is an estimate of the quality of concatenation of two consecutive units. A pruned Viterbi search is used to select the best units for synthesis from the database.
- The objective of the present invention is solved by the independent claim 1. Further embodiments are defmed in the dependent claims.
-
-
FIG. 1 is a block diagram of a general computing environment in which the present invention may be practiced. -
FIG. 2 is a block diagram of a mobile device in which the present invention may be practiced. - -
FIG. 3 is a block diagram of a speech synthesis system. -
FIG. 4 is a block diagram of a system for selecting a training text subset from a very large training corpus. -
FIG. 5 is a flow diagram for constructing a decision tree under one embodiment of the present invention. -
FIG. 6 is a block diagram of a multi-tier selection system for selecting speech segments under embodiments of the present invention. -
FIG. 7 is a flow diagram of a multi-tier selection system for selecting speech segments under embodiments of the present invention. -
FIG. 1 illustrates an example of a suitablecomputing system environment 100 on which the invention may be implemented. Thecomputing system environment 100 is only one example of a suitable computing environment and is not intended to suggest any limitation as to the scope of use or functionality of the invention. Neither should thecomputing environment 100 be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in theexemplary operating environment 100. - The invention is operational with numerous other general purpose or special purpose computing system environments or configurations. Examples of well known computing systems, environments, and/or configurations that may be suitable for use with the invention include, but are not limited to, personal computers, server computers, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.
- The invention may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.
- With reference to
FIG. 1 , an exemplary system for implementing the invention includes a general-purpose computing device in the form of acomputer 110. Components ofcomputer 110 may include, but are not limited to, aprocessing unit 120, asystem memory 130, and asystem bus 121 that couples various system components including the system memory to theprocessing unit 120. Thesystem bus 121 may be any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of bus architectures. By way of example, and not limitation, such architectures include Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus also known as Mezzanine bus. -
Computer 110 typically includes a variety of computer readable media. Computer readable media can be any available media that can be accessed bycomputer 110 and includes both volatile and nonvolatile media, removable and non-removable media. By way of example, and not limitation, computer readable media may comprise computer storage media and communication media. Computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed bycomputer 100. - Communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media. The term "modulated data signal" means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, communication media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, FR, infrared and other wireless media. Combinations of any of the above should also be included within the scope of computer readable media.
- The
system memory 130 includes computer storage media in the form' of volatile and/or nonvolatile memory such as read only memory (ROM) 131 and random access memory (RAM) 132. A basic input/output system 133 (BIOS), containing the basic routines that help to transfer information between elements withincomputer 110, such as during start-up, is typically stored inROM 131.RAM 132 typically contains data and/or program modules that are immediately accessible to and/or presently being operated on by processingunit 120. By way of example, and not limitation,FIG. 1 illustratesoperating system 134,application programs 135,other program modules 136, andprogram data 137. - The
computer 110 may also include other removable/non-removable volatile/nonvolatile computer storage media. By way of example only,FIG. 1 illustrates ahard disk drive 141 that reads from or writes to non-removable, nonvolatile magnetic media, amagnetic disk drive 151 that reads from or writes to a removable, nonvolatilemagnetic disk 152, and anoptical disk drive 155 that reads from or writes to a removable, nonvolatileoptical disk 156 such as a CD RCM or other optical media. Other removable/non-removable, volatile/nonvolatile computer storage media that can be used in the exemplary operating environment include, but are not limited to, magnetic tape cassettes, flash memory cards, digital versatile disks, digital video tape, solid state RAM, solid state ROM, and the like. Thehard disk drive 141 is typically connected to thesystem bus 121 through a non-removable memory interface such asinterface 140, andmagnetic disk drive 151 andoptical disk drive 155 are typically connected to thesystem bus 121 by a removable memory interface, such asinterface 150. - The drives and their associated computer storage media discussed above and illustrated in
FIG. 1 , provide storage of computer readable instructions, data structures, program modules and other data for thecomputer 110. InFIG. 1 , for example,hard disk drive 141 is illustrated as storingoperating system 144,application programs 145,other program modules 146, andprogram data 147. Note that these components can either be the same as or different fromoperating system 134,application programs 135,other program modules 136, andprogram data 137.Operating system 144,application programs 145,other program modules 146, andprogram data 147 are given different numbers here to illustrate that, at a minimum, they are different copies. - A user may enter commands and information into the
computer 110 through input devices such as akeyboard 162, amicrophone 163, and apointing device 161, such as a mouse, trackball or touch pad. Other input devices (not shown) may include a joystick, game pad, satellite dish, scanner, or the like. These and other input devices are often connected to theprocessing unit 120 through auser input interface 160 that is coupled to the system-bus, but may be connected by other interface and bus structures, such as a parallel port, game port or a universal serial bus (USB). Amonitor 191 or other type of display device is also connected to thesystem bus 121 via an interface, such as avideo interface 190. In addition to the monitor, computers may also include other peripheral output devices such asspeakers 197 andprinter 196, which may be connected through an outputperipheral interface 190. - The
computer 110 may operate in a networked environment using logical connections to one or more remote computers, such as aremote computer 180. Theremote computer 180 may be a personal computer, a hand-held device, a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above relative to thecomputer 110. The logical connections depicted inFIG. 1 include a local area network (LAN) 171 and a wide area network (WAN) 173, but may also include other networks. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets and the Internet. - When used in a LAN networking environment, the
computer 110 is connected to theLAN 171 through a network interface oradapter 170. When used in a WAN networking environment, thecomputer 110 typically includes amodem 172 or other means for establishing communications over theWAN 173, such as the Internet. Themodem 172, which may be internal or external, may be connected to thesystem bus 121 via theuser input interface 160, or other appropriate mechanism. In a networked environment, program modules depicted relative to thecomputer 110, or portions thereof, may be stored in the remote memory storage device. By way of example, and not limitation,FIG. 1 illustratesremote application programs 185 as residing onremote computer 180. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers may be used. -
FIG. 2 is a block diagram of amobile device 200, which is an exemplary computing environment.Mobile device 200 includes amicroprocessor 202,memory 204, input/output (I/O)components 206, and acommunication interface 208 for communicating with remote computers or other mobile devices. In one embodiment, the afore-mentioned components are coupled for communication with one another over asuitable bus 210. -
Memory 204 is implemented as non-volatile electronic memory such as random access memory (RAM) with a battery back-up module (not shown) such that information stored inmemory 204 is not lost when the general power tomobile device 200 is shut down. A portion ofmemory 204 is preferably allocated as addressable memory for program execution, while another portion ofmemory 204 is preferably used for storage, such as to simulate storage on a disk drive. -
Memory 204 includes anoperating system 212,application programs 214 as well as anobject store 216. During operation,operating system 212 is preferably executed byprocessor 202 frommemory 204.Operating system 212, in one preferred embodiment, is a WINDOWS® CE brand operating system commercially available from Microsoft Corporation.Operating system 212 is preferably designed for mobile devices, and implements database features that can be utilized byapplications 214 through a set of exposed application programming interfaces and methods. The objects inobject store 216 are maintained byapplications 214 andoperating system 212, at least partially in response to calls to the exposed application programming interfaces and methods. -
Communication interface 208 represents numerous devices and technologies that allowmobile device 200 to send and receive information. The devices include wired and wireless modems, satellite receivers and broadcast tuners to name a few.Mobile device 200 can also be directly connected to a computer to exchange data therewith. In such cases,communication interface 208 can be an infrared transceiver or a serial or parallel communication connection, all of which are capable of transmitting streaming information. - Input/
output components 206 include a variety of input devices such as a touch-sensitive screen, buttons, rollers, and a microphone as well as a variety of output devices including an audio generator, a vibrating device, and a display. The devices listed above are by way of example and need not all be present onmobile device 200. In addition, other input/output devices may be attached to or found withmobile device 200 within the scope of the present invention. - Under the present invention, a speech synthesizer is provided that concatenates stored samples of speech units without modifying the prosody of the samples. The present invention is able to achieve a high level of naturalness in synthesized speech with a carefully designed speech corpus by storing samples based on the prosodic and phonetic context in which they occur. In particular, the present invention limits the training text to those sentences that will produce the most frequent sets of prosodic contexts for each speech unit. The present invention also provides a multi-tier selection mechanism for selecting a set of samples that will produce the most natural sounding speech.
-
FIG. 3 is a block diagram of aspeech synthesizer 300 that is capable of constructing synthesizedspeech 302 from aninput text 304 under embodiments of the present invention. - Before
speech synthesizer 300 can be utilized to constructspeech 302, it must be initialized with samples of speech units taken from atraining text 306 that is read intospeech synthesizer 300 astraining speech 308. - As noted above, speech synthesizers are constrained by a limited size memory. Because of this,
training text 306 must be limited in size to fit within the memory. However, if the training text is too small, there will not be enough samples of the training speech to allow for concatenative synthesis without prosody modifications. One aspect of the present invention overcomes this problem by trying to identify a set of speech units in a very large text corpus that must be included in the training text to allow for concatenative synthesis without prosody modifications. -
FIG. 4 provides a block diagram of components used to identifysmaller training text 306 ofFIG. 3 from a verylarge corpus 400. Under one embodiment, verylarge corpus 400 is a corpus of five years worth of the People's Daily, a Chinese newspaper, and contains about 97 million Chinese Characters. - Initially,
large corpus 400 is parsed by a parser/semantic identifier 402 into strings of individual speech units. Under most embodiments of the invention, especially those used to form Chinese speech, the speech units are tonal syllables. However, other speech units such as phonemes, diphones, or triphones may be used within the scope of the present invention. - Parser/
semantic identifier 402 also identifies high-level prosodic information about each sentence provided to the parser. This high-level prosodic information includes the predicted tonal levels for each speech unit as well as the grouping of speech units into prosodic words and phrases. In embodiments where tonal syllable speech units are used, parser/semantic identifier 402 also identifies the first and last phoneme in each speech unit. - The strings of speech units produced from the training text are provided to a
context vector generator 404, which generates a Speech unit-Dependent Descriptive Contextual Variation Vector (SDDCVV, hereinafter referred to as a context vector). The context vector describes several context variables that can affect the prosody of the speech unit. Under one embodiment, the context vector describes six variables or coordinates. They are: - Position in phrase: the position of the current speech unit in its carrying prosodic phrase.
- Position in word: the position of the current speech unit in its carrying prosodic word.
- Left phonetic context: category of the last phoneme in the speech unit to -the left of the current speech unit.
- Right phonetic context: category of the first phoneme in the speech unit to the right of the current speech unit.
- Left tone context: the tone category of the speech unit to the left of the current speech unit.
- Right tone context: the tone category of the speech unit to the right of the current speech unit.
- Under one embodiment, the position-in-phrase coordinate and the position-in-word coordinate can each have one of four values, the left phonetic context can have one of eleven values, the right phonetic context can have one of twenty-six values and the left and right tonal contexts can each have one of two values. Under this embodiment, there are 4*4*11*26*2*2= 18304 possible context vectors for each speech unit.
- The context vectors produced by
generator 404 are grouped based on their speech unit. For each speech unit, a frequency-basedsorter 406 identifies the most frequent context vectors for each speech unit. The most frequently occurring context vectors for each speech unit are then stored in a list ofnecessary context vectors 408. In one embodiment, the top context vectors, whose accumulated frequency of occurrence is not less than half of the total frequency of occurrence of all units, are stored in the list. - The sorting and pruning performed by
sorter 406 is based on a discovery made by the present inventors. In particular, the present inventors have found that certain context vectors occur repeatedly in the corpus. By making sure that these context vectors are found in the training corpus, the present invention increases the chances of having an exact context match for an input text without greatly increasing the size of the training corpus. For example, the present inventors have found that by ensuring that the top two percent of the context vectors are represented in the training corpus, an exact context match will be found for an input text speech unit over fifty percent of the time. - Using the list of
necessary context vectors 408, atext selection unit 410 selects sentences from verylarge corpus 400 to producetraining text subset 306. In a particular embodiment,text selection unit 410 uses a greedy algorithm to select sentences fromcorpus 400. Under this greedy algorithm,selection unit 410 scans all sentences in the corpus and picks out one at a time to add to the selected group. - During the scan,
selection unit 410 determines how many context vectors inlist 408 are found in each sentence. The sentence that contains the maximum number of needed context vectors is then added totraining text 306. The context vectors that the sentence contains are removed fromlist 408 and the sentence is removed from thelarge text corpus 400. The scanning is repeated until all of the context vectors have been removed fromlist 408. - After training
text subset 306 has been formed, it is read by a person and digitized into a training speech corpus. Both the training text and training speech can be used to initializespeech synthesizer 300 ofFIG. 3 . This initialization begins by parsing the sentences oftext 306 into individual speech units that are annotated with high-level prosodic information. InFIG. 3 , this is accomplished by a parser/semantic identifier 310, which is similar to parser/semantic identifier 402 ofFIG. 4 . The parsed speech units and their high-level prosodic description are then provided to acontext vector generator 312, which is similar tocontext vector generator 404 ofFIG. 4 . - The context vectors produced by
context vector generator 312 are provided to acomponent storing unit 314 along with speech samples produced by asampler 316 fromtraining speech signal 308. Each sample provided bysampler 316 corresponds to a speech unit identified byparser 310.Component storing unit 314 indexes each speech sample by its context vector to form an indexed set of storedspeech components 318. - Under one embodiment, the samples are indexed by a prosody-dependent decision tree (PDDT), which is formed automatically using a classification and regression tree (CART). CART provides a mechanism for selecting questions that can be used to divide the stored speech components into small groups of similar speech samples. Typically, each question is used to divide a group of speech components into two smaller groups. With each question, the components in the smaller groups become more homogenous. The process for using CART to form the decision tree is shown in
FIG. 5 . - At
step 500 ofFIG. 5 , a list of candidate questions is generated for the decision tree. Under one embodiment, each question is directed toward some coordinate or combination of coordinates in the context vector. - At
step 502, an expected square error is determined for all of the training samples fromsampler 316. The expected square error gives a measure of the distances among a set of features of each sample in a group. In one particular embodiment, the features are prosodic features of average fundamental frequency (Fa), average duration (Fb), and range of the fundamental frequency (Fc) for a unit. For this embodiment, the expected square error is defined as:
where ESE(t) is the expected square error for all samples X on node t in the decision tree, Ea, Eb, and Ec are the square error for Fa, Fb, and Fc, respectively, Wa, Wb, and We are weights, and the operation of determining the expected value of the sum of square errors is indicated by the outer E(). -
- Once the expected square error has been determined at
step 502, the first question in the question list is selected atstep 504. The selected question is applied to the context vectors atstep 506 to group the samples into candidate sub-nodes for the tree. The expected square error of each sub-node is then determined atstep 508 using equations 1 and 2 above. - At
step 510, a reduction in expected square error created by generating the two sub-nodes is determined. Under one embodiment, this reduction is calculated as:
where ΔWESE(t) is the reduction in expected square error, ESE(t) is the expected square error of node t, against which the question was applied, P(t) is the percentage of samples in node t, ESE(1) and ESE(r) are the expected square error of the left and right sub-nodes formed by the question, respectively, and P(1) and P(r) are the percentage of samples in the left and right node, respectively. - The reduction in expected square error provided by the current question is stored and the CART process determines if the current question is the last question in the list at
step 512. If there are more questions in the list, the next question is selected atstep 514 and the process returns to step 506 to divide the current node into sub-nodes based on the new question. - After every question has been applied to the current node at
step 512, the reductions in expected square error provided by each question are compared and the question that provides the greatest reduction is set as the question for the current node of the decision tree atstep 515. - At
step 516, a decision is made as to whether or not the current set of leaf nodes should be further divided. This determination can be made based on the number of samples in each leaf node or the size of the reduction in square error possible with further division. - Under one embodiment, when the decision tree is in its final form, each leaf node will contain a number of samples for a speech unit. These samples have slightly different prosody from each other. For example, they may have different phonetic contexts or different tonal contexts from each other. By maintaining these minor differences within a leaf node, this embodiment of the invention introduces slender diversity in prosody, which is helpful in removing monotonous prosody.
- If the current leaf nodes are to be further divided at
step 516, a leaf node is selected atstep 518 and the process returns to step 504 to find a question to associate with the selected node. If the decision tree is complete atstep 516, the process ofFIG. 5 ends atstep 520. - The process of
FIG. 5 results in a prosody-dependent decision tree 320 ofFIG. 3 and a set of storedspeech samples 318, indexed bydecision tree 320. Once created,decision tree 320 andspeech samples 318 can be used under further aspects of the present invention to generate concatenative speech without requiring prosody modification. - The process for forming concatenative speech begins by parsing a sentence in
input text 304 using parser/semantic identifier 310 and identifying high-level prosodic information for each speech unit produced by the parse. This prosodic information is then provided tocontext vector generator 312, which generates a context vector for each speech unit identified in the parse. The parsing and the production of the context vectors are performed in the same manner as was done during the training ofprosody decision tree 320. - The context vectors are provided to a
component locator 322, which uses the vectors to identify a set of samples for the sentence. Under one embodiment,component locator 322 uses a multi-tier non-uniform unit selection algorithm to identify the samples from the context vectors. -
FIGS. 6 and7 provide a block diagram and a flow diagram for the multi-tier non-uniform selection algorithm. Instep 700, each vector in the set of input context vectors is applied to prosody-dependent decision tree 320 to identify aleaf node array 600 that contains a leaf node for each context vector. Atstep 702, a set of distances is determined by adistance calculator 602 for each input context vector. In particular, a separate distance is calculated between the input context vector and each context vector found in its respective leaf node. Under one embodiment, each distance is calculated as:
where Dc is the context distance, Di is the distance for coordinate i of the context vector, Wci is a weight associated with coordinate i, and I is the number of coordinates in each context vector. - At
step 704, the N samples with the closest context vectors are retained while the remaining samples are pruned fromnode array 600 to form prunedleaf node array 604. The number of samples, N, to leave in the pruned nodes is determined by balancing improvements in prosody with improved processing time. In general, more samples left in the pruned nodes means better prosody at the cost of longer processing time. - At
step 706, the pruned array is provided to aViterbi decoder 606, which identifies a lowest cost path through the pruned array. Under a single-tier embodiment of the present invention, the lowest cost path is identified simply by selecting the sample with the closest context vector in each node. Under a multi-tier embodiment, the cost function is modified to be:
where Cc is the concatenation cost for the entire sentence, Wc is a weight associated with the distance measure of the concatenated cost, Dcj is the distance calculated in equation 4 for the jth speech unit in the sentence, Ws is a weight associated with a smoothness measure of the concatenated cost, Csj is a smoothness cost for the jth speech unit, and J is the number of speech units in the sentence. - The smoothness cost in Equation 5 is defined to provide a measure of the prosodic mismatch between sample j and the samples proposed as the neighbors to sample j by the Viterbi decoder. Under one embodiment, the smoothness cost is determined based on whether a sample and its neighbors were found as neighbors in an utterance in the training corpus. If a sample occurred next to its neighbors in the training corpus, the smoothness cost is zero since the samples contain the proper prosody to be combined together. If a sample did not occur next to its neighbors in the training corpus, the smoothness cost is set to one.
- Using the multi-tier non-uniform approach, if a large block of speech units, such as a word or a phrase, in the input text exists in the training corpus, preference will be given to selecting all of the samples associated with that block of speech units. Note, however, that if the block of speech units occurred within a different prosodic context, the distance between the context vectors will likely cause different samples to be selected than those associated with the block. -
- Once the lowest cost path has been identified by
Viterbi decoder 606, the identifiedsamples 608 are provided tospeech constructor 303. With the exception of small amounts of smoothing at the boundaries between the speech units,speech constructor 303 simply concatenates the speech units to form synthesizedspeech 302. Thus, the speech units are combined without having to change their prosody. - Although the present invention has been described with reference to particular embodiments, workers skilled in the art will recognize that changes may be made in form and detail without departing from the scope of the invention. In particular, although context vectors are discussed above, other representations of the context information sets may be used within the scope of the present invention.
Claims (14)
- A method for synthesizing speech, the method comprising:generating a training context vector for each of a set of training speech units in a training speech corpus, each training context vector indicating the prosodic context of a training speech unit in the training speech corpus, wherein each context vector comprises a left tonal coordinate indicating a category for the tone of a speech unit to the left of the training speech unit;indexing a set of speech segments associated with a set of training speech units based on the context vectors for the training speech units;generating an input context vector for each of a set of input speech units in an input text (304), each input context vector indicating the prosodic context of an input speech unit in the input text;using the input context vectors to find a speech segment for each input speech unit; andconcatenating the found speech segments to form a synthesized speech signal.
- The method of claim 1 wherein the each context vector comprises a position-in-phrase coordinate indicating the position of the speech unit in a phrase.
- The method of claim 1 wherein the each context vector comprises a position-in-word coordinate indicating the position of the speech unit in a word.
- The method of claim 1 wherein the each context vector comprises a left phonetic coordinate indicating a category for the phoneme to the left of the speech unit.
- The method of claim 1 wherein the each context vector comprises a right phonetic coordinate indicating a category for the phoneme to the right of the speech unit.
- The method of claim 1 wherein the each context vector comprises a right tonal coordinate indicating a category for the tone of the speech unit to the right of the speech unit.
- The method of claim 1 wherein indexing a set of speech segments comprises generating a decision tree (320) based on the training context vectors.
- The method of claim 7 wherein using the input context vectors to find a speech segment comprises searching the decision tree using the input context vector.
- The method of claim 8 wherein searching the decision tree comprises:identifying a leaf in the tree for each input context vector, each leaf comprising at least one candidate speech segments; andselecting one candidate speech segment in each leaf node, wherein if there is more than one candidate speech segment on the node the selection is based on a cost function.
- The method of claim 9 wherein the cost function comprises a distance between the input context vector and a training context vector associated with a speech segment.
- The method of claim 10 wherein the cost function further comprises a smoothness cost that is based on a candidate speech segment of at least one neighboring speech unit.
- The method of claim 11 wherein the smoothness cost gives preference to selecting a series of speech segments for a series of input context vectors if the series of speech segments occurred in series in the training speech corpus.
- The method according to claim 1, wherein selecting speech segments for concatenative speech synthesis comprises:parsing an input text into speech units;identifying context information for each speech unit based on its location in the input text and at least one neighboring speech unit;identifying a set of candidate speech segments for each speech unit based on the context information; andidentifying a sequence of speech segments from the candidate speech segments based in part on a smoothness cost between the speech segments.
- A computer-readable medium having computer executable instructions adapted to perform the method of one of the preceding claims when run on a computer (110).
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US25116700P | 2000-12-04 | 2000-12-04 | |
US09/850,527 US6978239B2 (en) | 2000-12-04 | 2001-05-07 | Method and apparatus for speech synthesis without prosody modification |
EP01128765A EP1213705B1 (en) | 2000-12-04 | 2001-12-03 | Method and apparatus for speech synthesis |
Related Parent Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP01128765.3 Division | 2001-12-03 | ||
EP01128765A Division EP1213705B1 (en) | 2000-12-04 | 2001-12-03 | Method and apparatus for speech synthesis |
Publications (3)
Publication Number | Publication Date |
---|---|
EP1777697A2 EP1777697A2 (en) | 2007-04-25 |
EP1777697A3 EP1777697A3 (en) | 2008-06-18 |
EP1777697B1 true EP1777697B1 (en) | 2013-03-20 |
Family
ID=37831625
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP07002565A Expired - Lifetime EP1777697B1 (en) | 2000-12-04 | 2001-12-03 | Method for speech synthesis without prosody modification |
Country Status (1)
Country | Link |
---|---|
EP (1) | EP1777697B1 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2020118643A1 (en) * | 2018-12-13 | 2020-06-18 | Microsoft Technology Licensing, Llc | Neural text-to-speech synthesis with multi-level text information |
Families Citing this family (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB2559766A (en) * | 2017-02-17 | 2018-08-22 | Pastel Dreams | Method and system for defining text content for speech segmentation |
GB2559767A (en) * | 2017-02-17 | 2018-08-22 | Pastel Dreams | Method and system for personalised voice synthesis |
Family Cites Families (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6064960A (en) * | 1997-12-18 | 2000-05-16 | Apple Computer, Inc. | Method and apparatus for improved duration modeling of phonemes |
JP2000075878A (en) * | 1998-08-31 | 2000-03-14 | Canon Inc | Device and method for voice synthesis and storage medium |
-
2001
- 2001-12-03 EP EP07002565A patent/EP1777697B1/en not_active Expired - Lifetime
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2020118643A1 (en) * | 2018-12-13 | 2020-06-18 | Microsoft Technology Licensing, Llc | Neural text-to-speech synthesis with multi-level text information |
Also Published As
Publication number | Publication date |
---|---|
EP1777697A2 (en) | 2007-04-25 |
EP1777697A3 (en) | 2008-06-18 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP1213705B1 (en) | Method and apparatus for speech synthesis | |
US7124083B2 (en) | Method and system for preselection of suitable units for concatenative speech | |
US7024362B2 (en) | Objective measure for estimating mean opinion score of synthesized speech | |
US7263488B2 (en) | Method and apparatus for identifying prosodic word boundaries | |
EP1138038B1 (en) | Speech synthesis using concatenation of speech waveforms | |
US5905972A (en) | Prosodic databases holding fundamental frequency templates for use in speech synthesis | |
US7386451B2 (en) | Optimization of an objective measure for estimating mean opinion score of synthesized speech | |
Taylor | Concept-to-speech synthesis by phonological structure matching | |
US6778962B1 (en) | Speech synthesis with prosodic model data and accent type | |
US6173263B1 (en) | Method and system for performing concatenative speech synthesis using half-phonemes | |
EP1221693B1 (en) | Prosody template matching for text-to-speech systems | |
US9666179B2 (en) | Speech synthesis apparatus and method utilizing acquisition of at least two speech unit waveforms acquired from a continuous memory region by one access | |
US7328157B1 (en) | Domain adaptation for TTS systems | |
Chu et al. | A concatenative Mandarin TTS system without prosody model and prosody modification. | |
EP1777697B1 (en) | Method for speech synthesis without prosody modification | |
Chen et al. | A Mandarin Text-to-Speech System | |
Dong et al. | A Unit Selection-based Speech Synthesis Approach for Mandarin Chinese. | |
Narupiyakul et al. | A stochastic knowledge-based Thai text-to-speech system | |
EP1501075B1 (en) | Speech synthesis using concatenation of speech waveforms | |
Narupiyakul et al. | Thai syllable analysis for rule-based text to speech system | |
JPH09198074A (en) | Speech synthesizing device |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
17P | Request for examination filed |
Effective date: 20070206 |
|
AC | Divisional application: reference to earlier application |
Ref document number: 1213705 Country of ref document: EP Kind code of ref document: P |
|
AK | Designated contracting states |
Kind code of ref document: A2 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR |
|
PUAL | Search report despatched |
Free format text: ORIGINAL CODE: 0009013 |
|
AK | Designated contracting states |
Kind code of ref document: A3 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR |
|
RIC1 | Information provided on ipc code assigned before grant |
Ipc: G10L 13/06 20060101ALI20080515BHEP Ipc: G10L 13/08 20060101AFI20080515BHEP |
|
17Q | First examination report despatched |
Effective date: 20080724 |
|
AKX | Designation fees paid |
Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR |
|
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
GRAS | Grant fee paid |
Free format text: ORIGINAL CODE: EPIDOSNIGR3 |
|
GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
AC | Divisional application: reference to earlier application |
Ref document number: 1213705 Country of ref document: EP Kind code of ref document: P |
|
AK | Designated contracting states |
Kind code of ref document: B1 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: FG4D |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: EP |
|
REG | Reference to a national code |
Ref country code: IE Ref legal event code: FG4D |
|
REG | Reference to a national code |
Ref country code: AT Ref legal event code: REF Ref document number: 602496 Country of ref document: AT Kind code of ref document: T Effective date: 20130415 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R096 Ref document number: 60147799 Country of ref document: DE Effective date: 20130516 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: ES Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130701 Ref country code: SE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130320 |
|
REG | Reference to a national code |
Ref country code: AT Ref legal event code: MK05 Ref document number: 602496 Country of ref document: AT Kind code of ref document: T Effective date: 20130320 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: GR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130621 Ref country code: FI Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130320 |
|
REG | Reference to a national code |
Ref country code: NL Ref legal event code: VDEP Effective date: 20130320 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: BE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130320 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: NL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130320 Ref country code: PT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130722 Ref country code: AT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130320 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: CY Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130320 |
|
PLBE | No opposition filed within time limit |
Free format text: ORIGINAL CODE: 0009261 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: DK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130320 |
|
26N | No opposition filed |
Effective date: 20140102 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130320 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R097 Ref document number: 60147799 Country of ref document: DE Effective date: 20140102 |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: PL |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: LU Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20131203 Ref country code: MC Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130320 |
|
REG | Reference to a national code |
Ref country code: IE Ref legal event code: MM4A |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: LI Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20131231 Ref country code: IE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20131203 Ref country code: CH Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20131231 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R082 Ref document number: 60147799 Country of ref document: DE Representative=s name: GRUENECKER, KINKELDEY, STOCKMAIR & SCHWANHAEUS, DE |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: 732E Free format text: REGISTERED BETWEEN 20150108 AND 20150114 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R082 Ref document number: 60147799 Country of ref document: DE Representative=s name: GRUENECKER PATENT- UND RECHTSANWAELTE PARTG MB, DE Effective date: 20150126 Ref country code: DE Ref legal event code: R081 Ref document number: 60147799 Country of ref document: DE Owner name: MICROSOFT TECHNOLOGY LICENSING, LLC, REDMOND, US Free format text: FORMER OWNER: MICROSOFT CORP., REDMOND, WASH., US Effective date: 20150126 Ref country code: DE Ref legal event code: R081 Ref document number: 60147799 Country of ref document: DE Owner name: MICROSOFT TECHNOLOGY LICENSING, LLC, REDMOND, US Free format text: FORMER OWNER: MICROSOFT CORP., REDMOND, WASH., US Effective date: 20130320 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: TR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130320 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: TP Owner name: MICROSOFT TECHNOLOGY LICENSING, LLC, US Effective date: 20150724 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 15 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 16 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 17 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: FR Payment date: 20171113 Year of fee payment: 17 Ref country code: DE Payment date: 20171129 Year of fee payment: 17 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: GB Payment date: 20171129 Year of fee payment: 17 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R119 Ref document number: 60147799 Country of ref document: DE |
|
GBPC | Gb: european patent ceased through non-payment of renewal fee |
Effective date: 20181203 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: FR Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20181231 Ref country code: DE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20190702 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: GB Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20181203 |