US5651095A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Speech synthesis using word parser with knowledge base having dictionary of morphemes with binding properties and combining rules to identify input word class
Assignee: British Telecommunications PLC
•
Filing: 1994-02-08
•
Granted: 1997-07-22
•
Expires: 2014-02-08
Abstract
Abstract A speech synthesis system includes a phonological converter, a word parser, a syllable parser, temporal and parametric interpreters, a file and a synthesizer. The word parser and syllable parser receive an input text which includes words in a defined word class. The word parser parses each word to determine whether it belongs to the defined class of words. The parser includes a knowledge base containing the individual morphemes utilized in the defined word class, each morpheme being a root or an affix, the binding properties of each root and each affix, the binding properties for each affix also defining the binding properties of the combination of the affix and another affix or another root, and a set of rules defining the manner in which the roots and affixes may be combined to fore words. The syllable parser determines the phonological features of the constituents of each syllable of the input text. The metrical parser determines the stress pattern of the syllables of each word. The temporal and parametric interpreters interpret the phonological features together with the stress pattern to produce a series of sets of parametric values for driving the synthesizer. The synthesizer produces a speech waveform. If desired, the parameter values may be stored in the file for later use.
Inventors
- 👤 Richard Ogden
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 05:05
CPC Classifications
G; G10; G10L; G10L13/00; G10L13/08; G10L13/10
Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
231 words
A speech synthesis system for use in producing a speech waveform from an input text which includes words in a defined word class, said speech synthesis system including: means for determining the phonological features of said input text; means for parsing each word of said input text to determine if the word belongs to said defined word class, said parsing means including a knowledge base containing (1) the individual morphemes utilized in said defined word class, each morpheme being an affix or a root, (2) the binding properties of each root and each affix, the binding properties for each affix also defining the binding properties of the combination of each affix and one or more other morphemes, and (3) a set of rules for defining the manner in which roots and affixes may be combined to form words; said means for parsing each word including means to determine whether a word being parsed consists of morphemes present in the knowledge base combined in accordance with said binding properties and said set of rules; means responsive to the word parsing means for finding the stress pattern of each word of said input text; and means for interpreting said phonological features together with the output from said means for finding the stress pattern to produce a series of sets of parameters for use in driving a speech synthesizer to produce a speech waveform.
Claim 2
Dependent Claim
231 words
A speech synthesis system for use in producing a speech waveform from an input text which includes words in a defined word class, said speech synthesis system including: means for determining the phonological features of said input text; means for parsing each word of said input text to determine if the word belongs to said defined word class, said parsing means including a knowledge base containing (1) the individual morphemes utilized in said defined word class, each morpheme being an affix or a root, (2) the binding properties of each root and each affix, the binding properties for each affix also defining the binding properties of the combination of each affix and one or more other morphemes, and (3) a set of rules for defining the manner in which roots and affixes may be combined to form words; said means for parsing each word including means to determine whether a word being parsed consists of morphemes present in the knowledge base combined in accordance with said binding properties and said set of rules; means responsive to the word parsing means for finding the stress pattern of each word of said input text; and means for interpreting said phonological features together with the output from said means for finding the stress pattern to produce a series of sets of parameters for use in driving a speech synthesizer to produce a speech waveform.
Claim 3
Dependent Claim
55 words
A speech synthesis system as in claim 1, in which said means for determining the phonological features includes means to spread the phonological features for each syllable over a syllable tree for that syllable, the syllable tree dividing the syllable into an onset and a rime, and the rime into a nucleus and a coda.
Claim 4
Dependent Claim
23 words
A speech synthesis system as in claim 1, in which said input text is in the form of a string of input characters.
Claim 5
Dependent Claim
26 words
A speech synthesis system as in claim 1, including a memory for storing said series of sets of parameter values produced by the means for interpreting.
Claim 6
Dependent Claim
25 words
A speech synthesis system as in claim 1 including a speech synthesizer for converting said series of sets of parameter values into a speech waveform.
Claim 7
Dependent Claim
17 words
A speech synthesis system as in claim 5, in which said speech waveform is a digital waveform.
Claim 8
Dependent Claim
17 words
A speech synthesis system as in claim 5, in which said speech waveform is an analogue waveform.
Claim 9
Dependent Claim
123 words
A speech synthesis system as in claim 1 wherein: said parsing means includes means for determining whether a word being parsed meets a predetermined criterion and, according to whether the word does or does not meet the said criterion, outputting information indicating respectively that the word does or does not belong to said defined class, said criterion being met by a word consisting of a root wherein the root is present in the knowledge base and has binding properties requiring no binding and said criterion being met by a word consisting of a root and at least one affix wherein said root and said affix are all present in the knowledge base and are combined in accordance with said binding properties and rules.
Claim 10
Independent Claim
219 words
A method for use in producing a speech waveform from an input text which includes words in a defined word class, said method comprising the steps of: determining the phonological features of said input text; parsing each word of said input text to determine if the word belongs to said defined word class, said parsing step including using a knowledge base containing (1) the individual morphemes utilized in said defined word class, each morphemes being an affix or a root, (2) the binding properties of each root and each affix, the binding properties for each affix also defining the binding properties of the combination of each affix and one or more other morphemes, and (3) a set of rules for defining the manner in which roots and affixes may be combined to form words; said parsing step including determining whether a word being parsed consists of morphemes present in the knowledge base combined in accordance with said binding properties and set of rules; finding the stress pattern of each word of said input text, said finding step using the result of said parsing step; and interpreting said phonological features together with the stress pattern found in said finding step to produce a series of sets of parameters for use in driving a speech synthesizer to produce a speech waveform.
Claim 11
Independent Claim
219 words
A method for use in producing a speech waveform from an input text which includes words in a defined word class, said method comprising the steps of: determining the phonological features of said input text; parsing each word of said input text to determine if the word belongs to said defined word class, said parsing step including using a knowledge base containing (1) the individual morphemes utilized in said defined word class, each morphemes being an affix or a root, (2) the binding properties of each root and each affix, the binding properties for each affix also defining the binding properties of the combination of each affix and one or more other morphemes, and (3) a set of rules for defining the manner in which roots and affixes may be combined to form words; said parsing step including determining whether a word being parsed consists of morphemes present in the knowledge base combined in accordance with said binding properties and set of rules; finding the stress pattern of each word of said input text, said finding step using the result of said parsing step; and interpreting said phonological features together with the stress pattern found in said finding step to produce a series of sets of parameters for use in driving a speech synthesizer to produce a speech waveform.
Claim 12
Dependent Claim
50 words
A method as in claim 9, in which said step of determining the phonological features spreads the phonological features for each syllable over the syllable tree for that feature, the syllable tree dividing the syllable into an onset and as rime and the rime into a nucleus and a coda.
Claim 13
Dependent Claim
21 words
A method as in claim 9, in which said input text is in the form of a string of input characters.
Claim 14
Dependent Claim
19 words
A method as in claim 9, farther including the step of storing said series of sets of parameter values.
Claim 15
Dependent Claim
23 words
A method as in claim 9, further including the step of converting said series of sets of parameter values into a speech waveform.
Claim 16
Dependent Claim
121 words
A speech synthesis method as in claim 9 wherein: said parsing step includes determining whether a word being parsed meets a predetermined criterion and, according to whether the word does or does not meet the said criterion, outputting information indicating respectively that the word does or does not belong to said defined class, said criterion being met by a word consisting of a root wherein the root is present in the knowledge base and has binding properties requiring no binding and said criterion being met by a word consisting of a root and at least one affix wherein said root and said affix are all present in the knowledge base and are combined in accordance with said binding properties and rules.
References Cited (Backward Citations)
US4685135A
Cited
US4797930A
Cited
US4692941A
Cited
US4783811A
Cited
US5040218A
Cited
US5157759A
Cited
US5212731A
Cited
US5511213A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-07-21 | 2001-01-20 | 2001-07-22 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-07-21 | 2005-01-20 | 2005-07-22 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-07-21 | 2009-01-20 | 2009-07-22 | $7700.00 | Window Closed / Lapsed |