Word syllabification in speech synthesis system

• US 5,949,961 A
• Filed: 07/19/1995
• Issued: 09/07/1999
• Est. Priority Date: 07/19/1995
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Sharman, Richard A.
• Primary Examiner(s): MacDonald, Allen R.
• Assistant Examiner(s): Collins, Alphonso A.
• Application Number:
  US08/503,960
• Time in Patent Office: 1,511 Days
• Field of Search: 395/2.6-2.66, 395/2.51, 395/759, 395/760, 395/2.69, 395/2.67, 395/2.72
• US Class Current: 704/260
• CPC Class Codes: G10L 13/08 Text analysis or generation of parameters for speech synthesis out of text, e.g. grapheme to phoneme translation, prosody generation or stress or intonation determination

Abstract

The present invention relates to a system and method of word syllabification. The present invention receives a word to be syllabified and determines therefrom all possible substrings capable of forming part of the word. Sequences matching at least part of or the whole of the word are determined from the substrings together with respective probabilities of occurrence and the sequence having the greatest probability of occurrence is selected as being the most probable syllabification of the word. The most probable sequence can be determined in many different ways. For example, the sequence can be determined by commencing with the substring having the greatest probability of forming the beginning of a given word and subsequently traversing in a step-by-step manner a table comprising all possible substrings of the word and at each step selecting the next substring of the sequence according to which of the possible next substrings has the highest probability of occurrence. A further method of determining the most probable sequence would be to adopt the above step-by-step approach for all possible substrings capable of forming the beginning of the given word. Alternatively, all possible sequences of substring capable of constituting the word can be determined together respective probabilities of occurrence thereof and the sequence having the highest respective probability of occurrence is selected as being the most probable syllabification of the given word.

Claims

1. A method for automatic word syllabification in a speech synthesis system, comprising the steps of:

generating all possible substrings constituting part of an input text word;

assigning to each said possible substring a respective probability of being a correct syllable, based on predetermined substring frequency information; and

,

determining from all said possible substrings a sequence of said substrings which represents a most probable syllabification of said input text word, based on said respective assigned probabilities.

2. A method as recited in claim 1, wherein said determining step comprises the steps of:

establishing all possible sequences of said substrings constituting said input text word;

calculating for each said possible sequence a probability value indicative of a probability of occurrence of that sequence from said respective probabilities of the substrings constituting that sequence; and

,

selecting as said most probable sequence that one of said sequences having the highest probability value.

3. A method as recited in claim 2, wherein said calculating step comprises calculating said probability value of each said sequence as a product of said respective probabilities of said substrings constituting each said sequence.

4. A method as recited in claim 3, comprising the step of defining said respective probabilities as a probability of occurrence of said respective substrings.

5. A method as recited in claim 3, comprising the step of defining said respective probabilities as a probability of occurrence of said respective substrings given an occurrence of at least one preceding substring.

6. A method as recited in claim 3, comprising the steps of:

storing said respective probabilities in a look-up table; and

,

using said substrings as indices for said look-up table.

7. A method as recited in claim 1, wherein said determining step comprises:

selecting one of said substrings capable of forming a beginning of said input text word as a first substring in said sequence;

determining from all said possible contiguous substrings a contiguous substring having a highest probability value;

adding said determined contiguous substring to said sequence; and

,

repeating said determining and adding steps until said sequence matches said input text word.

8. A method as claimed in claim 7, wherein said selecting step comprises selecting said substring having a greatest probability of forming said beginning of said input text word.

9. A method as claimed in claim 1, further comprising the steps of:

selecting each said possible substring capable of forming a beginning of said input text word;

determining from all said possible contiguous substrings a contiguous substring having a highest respective probability value;

adding said determined contiguous substring to said sequence;

repeating said determining and adding steps until said sequence matches said input text word;

calculating for each said sequence an overall probability value; and

,

selecting that one of said sequences having a highest overall probability value.

10. A method as recited in claim 9, comprising the step of defining said respective probabilities as a probability of occurrence of said respective substrings.

11. A method as recited in claim 9, comprising the step of defining said respective probabilities as a probability of occurrence of said respective substrings given an occurrence of at least one preceding substring.

12. A method as recited in claim 6, comprising the steps of:

storing said respective probabilities in a look-up table; and

,

using said substrings as indices for said look-up table.

13. A method as recited in claim 1, comprising the step of defining said respective probabilities as a probability of occurrence of said respective substrings.

14. A method as recited in claim 1, comprising the step of defining said respective probabilities as a probability of occurrence of said respective substrings given an occurrence of at least one preceding substring.

15. A method as recited in claim 1, comprising the steps of:

storing said respective probabilities in a look-up table; and

,

using said substrings as indices for said look-up table.