Compaq Computer Corporation, Inc.

Thomas Kopec

Ginger Chun-Che Lin

Anthony J Vitale

A computerized apparatus for reducing the size of a dictionary used in a text-to-speech synthesis system are provided. In an initial phase, the method and apparatus determine if entries in the dictionary, each containing a grapheme string and a corresponding phoneme string, can be fully matched by using at least one rule set used to synthesize words to phonemic data. If the entry can be fully matched using rule processing alone, the entry is indicated to be deleted from the dictionary. In a second phase, the method and apparatus determine if the entry, considered as a root word entry, is required in the dictionary in order to support phoneme synthesis of other entries containing the root word entry, and if so, the root word entry is indicated to be saved in the dictionary. If the other entries containing the root word entry can have correct phonemic data generated from a combination of the root word entries phonemic data and phonemes generated from rule set processing, then the other entries are indicated to be deleted from the dictionary. After all words have been processed by phase one and/or phase two, the entries indicated to be saved are aggregated to form a reduced dictionary.

Computer apparatus for text-to-speech synthesizer dictionary reduction

A computer method and apparatus provide automatic generation of grapheme-to-phoneme rules, used in text-to-speech synthesis systems. The invention method and apparatus are based on a statistical analysis of a subject dictionary. The dictionary preferably contains words and their corresponding phonemic data representations, and is analyzed for subgraph patterns. The phoneme strings for words containing the subgraph patterns are then analyzed for common phoneme substrings (subphones) associated with each subgraph. The subphones associated with each subgraph are then checked for conditions such as the highest occurrence count, the proper length, and for compatibility with both ends of the subgraph to which they are associated. A subphone matching these conditions becomes paired with the subgraph to create a rule for text-to-speech processing. Separate prefix, infix, and suffix rule sets may be generated from the invention dictionary analysis.

Computer method and apparatus for grapheme-to-phoneme rule-set-generation

A computerized method and apparatus for reducing the size of a dictionary used in a text-to-speech synthesis system are provided. In an initial phase, the method and apparatus determine if entries in the dictionary, each containing a grapheme string and a corresponding phoneme string, can be fully matched by using at least one rule set used to synthesize words to phonemic data. If the entry can be fully matched using rule processing alone, the entry is indicated to be deleted from the dictionary. In a second phase, the method and apparatus determine if the entry, considered as a root word entry, is required in the dictionary in order to support phoneme synthesis of other entries containing the root word entry, and if so, the root word entry is indicated to be saved in the dictionary. If the other entries containing the root word entry can have correct phonemic data generated from a combination of the root word entries phonemic data and phonemes generated from rule set processing, then the other entries are indicated to be deleted from the dictionary. After all words have been processed by phase one and/or phase two, the entries indicated to be saved are aggregated to form a reduced dictionary.

Computer method and apparatus for text-to-speech synthesizer dictionary reduction

A computer method and apparatus provide fast and efficient conversion (translation) of text to phonemes. The method and apparatus employ a plurality of rule sets, each formed of rules designed for specific portions of an input text string. A suffix rule set is used to match substrings from the end of an input text string to suffix rules. A prefix rule set is used to match substrings from the beginning of the input text to prefix rules. And an infix rule set is provided to match substrings taken from the middle of the input text or any remaining text not matched by either the suffix of prefix rules. Phonemic data is produced for any portion of the input text that matches a particular rule. The phonemic data may be used by a speech synthesizer to vocalize or read aloud the input text. Dictionary lookup of any portions of the input text string in conjunction with rule matching is also provided.

Growing community of inventors

Amherst, MA, United States of America

Thomas Kopec