EP0481107A1
Expired / Lapsed
EP
⏱️ 0.0 years remaining
A phonetic Hidden Markov Model speech synthesizer
Assignee: IBM Semea SpA
•
Filing: 1990-10-16
•
Granted: —
•
Expires: 2010-10-16
Abstract
Abstract A method and a system for synthesizing speech from unrestricted text, based on the principle of associating to a written string of text the sequence of speech features vectors that most probably model the corresponding speech utterance. The synthesizer is based on the interaction between two different Ergodic Hidden Markov Models: an acoustic model reflecting the phonotactical constrains and a phonetic model interfacing phonemic transcription to the speech features representation.
Inventors
- 👤 Massimo Giustiniani
- 👤 Piero Pierucci
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-11-01 09:10
CPC Classifications
G; G10; G10L; G10L15/00; G10L15/08; G10L15/14
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
366 words
A method for generating synthesized speech wherein an acoustic ergodic hidden Markov model (AEHMM), reflecting phonotactical constrains is correlated to a phonetic ergodic hidden Markov model (PhEHMM), the method comprising the steps of a) Building an AEHMM, considering as observations sequence the speech features vectors extracted from the frames in which the speech uttered during the training of said AEHMM is divided and as hidden sequence the sequence of the sources that most probably have emitted the speech utterance frames, b) Initializing said AEHMM by a Vector Quantization clustering scheme, having the same size of said AEHMM, c) Training said AEHMM by the Forward-Backward algorithm and Baum-Welch re-estimation formulas, d) Associating to each frame the label of the most probable source, e) Building a PhEHMM of the same size of said AEHMM, considering as observations sequence a synthetic observations sequence obtained from a written text and as hidden sequence the sequence of the labels, f) Initializing said PhEHMM transition probability matrix by assigning to the state transition probabilities the same values of the transition probabilities of the corresponding states of said AEHMM, g) Initializing said PhEHMM observation probability functions by: i) using a phonetically aligned speech corpus ii) generating for said speech corpus the sequence of the most probable labels, using the acoustic labelling feature of said AEHMM, iii) computing the observations probability function for each phoneme, counting the number of occurrences of the phoneme in a state divided by the total number of phonemes emitted by said state, h) Training said PhEHMM by the Baum-Welch algorithm on a proper synthetic observations corpus, i) Determining for each word to be synthesized a synthetic observation and through said PhEHMM the corresponding sequence of labels by means of a proper optimality criterion, j) Determining from the input text a set of additional parameters, as energy, prosody contours and voicing, by a prosodic processor, k) Determining for said sequence of labels the corresponding set of speech features vectors through said AEHMM, I) Transforming said speech features vectors into a set of filter coefficients preserving the spectral information and m) Using said set of filter coefficients and said additional parameters in a synthesis filter to produce a synthetic speech output.
Claim 2
Independent Claim
366 words
A method for generating synthesized speech wherein an acoustic ergodic hidden Markov model (AEHMM), reflecting phonotactical constrains is correlated to a phonetic ergodic hidden Markov model (PhEHMM), the method comprising the steps of a) Building an AEHMM, considering as observations sequence the speech features vectors extracted from the frames in which the speech uttered during the training of said AEHMM is divided and as hidden sequence the sequence of the sources that most probably have emitted the speech utterance frames, b) Initializing said AEHMM by a Vector Quantization clustering scheme, having the same size of said AEHMM, c) Training said AEHMM by the Forward-Backward algorithm and Baum-Welch re-estimation formulas, d) Associating to each frame the label of the most probable source, e) Building a PhEHMM of the same size of said AEHMM, considering as observations sequence a synthetic observations sequence obtained from a written text and as hidden sequence the sequence of the labels, f) Initializing said PhEHMM transition probability matrix by assigning to the state transition probabilities the same values of the transition probabilities of the corresponding states of said AEHMM, g) Initializing said PhEHMM observation probability functions by: i) using a phonetically aligned speech corpus ii) generating for said speech corpus the sequence of the most probable labels, using the acoustic labelling feature of said AEHMM, iii) computing the observations probability function for each phoneme, counting the number of occurrences of the phoneme in a state divided by the total number of phonemes emitted by said state, h) Training said PhEHMM by the Baum-Welch algorithm on a proper synthetic observations corpus, i) Determining for each word to be synthesized a synthetic observation and through said PhEHMM the corresponding sequence of labels by means of a proper optimality criterion, j) Determining from the input text a set of additional parameters, as energy, prosody contours and voicing, by a prosodic processor, k) Determining for said sequence of labels the corresponding set of speech features vectors through said AEHMM, I) Transforming said speech features vectors into a set of filter coefficients preserving the spectral information and m) Using said set of filter coefficients and said additional parameters in a synthesis filter to produce a synthetic speech output.
Claim 3
Dependent Claim
53 words
A method for generating speech from unrestricted written text according to claim 1, wherein the proper optimality criterion of step i) is given by the Baum-Welch algorithm and wherein the determination of the speech features vectors of step k) is obtained by weighting each features vector by the probability of the corresponding labels.
Claim 4
Dependent Claim
54 words
A method for generating speech from unrestricted written text according to claim 1, wherein the proper optimality criterion of step i) is given by the Viterbi algorithm and wherein the determination of the speech features vectors of step k) is obtained by associating to each label the corresponding speech features vector of said AEHMM.
Claim 5
Dependent Claim
225 words
A text-to-speech synthesizer system including a text input device (31) for entering the text to be synthesized, a phonetic processor (32) for converting the grapheme input into a phonetic representation and for determining the phonetic duration parameters, a prosodic processor (34) for determining prosodic and energy contours for the speech utterance to be synthesized and a synthesis filter (36) which, using said prosodic and energy contours and filter coefficients, synthesizes the speech to be generated characterized in that it comprises said phonetic processor (32) including a Synthetic Observations Generator (45) which translates said phonetic representation of the input text into a string of phonetic symbols, each repeated to properly reflect the phoneme duration as computed by said prosodic processor (34) and generating a Phonetic Ergodic Hidden Markov Model (PhEHMM) observations sequence; a Labelling Unit (33) associating to each observation of said observations sequence the probability that said state has generated said observation by an optimality criterion and a Spectra Sequence Production Unit (35) computing for each speech frame to be synthesized the speech features vector by a correlation between labels and speech features vectors, computed by an Acoustic Ergodic Hidden Markov Model (AEHMM), built on previously uttered speech corpus, said Spectra Sequence Production Unit (35) converting by a back transformation the speech features vectors into filter coefficients to be used by said synthesis filter (36).
Claim 6
Dependent Claim
225 words
A text-to-speech synthesizer system including a text input device (31) for entering the text to be synthesized, a phonetic processor (32) for converting the grapheme input into a phonetic representation and for determining the phonetic duration parameters, a prosodic processor (34) for determining prosodic and energy contours for the speech utterance to be synthesized and a synthesis filter (36) which, using said prosodic and energy contours and filter coefficients, synthesizes the speech to be generated characterized in that it comprises said phonetic processor (32) including a Synthetic Observations Generator (45) which translates said phonetic representation of the input text into a string of phonetic symbols, each repeated to properly reflect the phoneme duration as computed by said prosodic processor (34) and generating a Phonetic Ergodic Hidden Markov Model (PhEHMM) observations sequence; a Labelling Unit (33) associating to each observation of said observations sequence the probability that said state has generated said observation by an optimality criterion and a Spectra Sequence Production Unit (35) computing for each speech frame to be synthesized the speech features vector by a correlation between labels and speech features vectors, computed by an Acoustic Ergodic Hidden Markov Model (AEHMM), built on previously uttered speech corpus, said Spectra Sequence Production Unit (35) converting by a back transformation the speech features vectors into filter coefficients to be used by said synthesis filter (36).
Claim 7
Dependent Claim
72 words
A text-to-speech synthesizer system of claim 4 in which the optimality criterion used in said Labelling Unit (33) consists of computing the probability that each state have generated a given observation by the Baum-Welch algorithm and in which each speech features vector is computed as a sum of the speech features vectors, associated to each label by said AEHMM, weighted by the probability of each label, computed by said Labelling Unit (33).
Claim 8
Dependent Claim
75 words
A text-to-speech synthesizer system of claim 4 wherein the optimality criterion used in said Labelling Unit (33) consists of computing the sequence of the states that most probably have generated the observed synthetic observations sequence as obtained by the Viterbi algorithm and wherein each speech features vector is obtained by associating to each label the corresponding source model of said AEHMM and assuming as speech features vector the mean vector associated to the source model.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.