US5440663A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Computer system for speech recognition
Assignee: International Business Machines Corp
•
Filing: 1993-06-04
•
Granted: 1995-08-08
•
Expires: 2013-06-04
Abstract
Abstract The invention concerns a computer system for speech recognition with a word table and a triphone table in its memory. In response to a new word not contained in the word table and which is encountered by the computer system during recognition of an unknown spoken text, the fenemic baseform of this new word may be synthetically produced with the aid of a triphone table. For this purpose, the new word is decomposed into triphones, and the fenemic sequences associated with the individual triphones are read from the triphone table. The fenemic sequences are concatenated according to the phonetic baseform of the new word such that the fenemic baseform of the new word is obtained.
Inventors
- 👤 Gerald Moese
- 👤 Karlheinz Mohr
- 👤 Upali Bandara
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 18:00
CPC Classifications
G; G10; G10L; G10L15/00; G10L15/08; G10L15/18; G10L15/183; G10L15/187
Claims Analysis
Total Claims: 22
Claim 1
Independent Claim
78 words
A computer system for speech recognition, comprising: means for producing phonetic baseforms of words; means for deriving triphones from the phonetic baseforms of the words; means for producing all possible triphones of a language; means for producing associated fenemic sequences from said all possible triphones; a triphone table containing said all possible triphones and their associated fenemic sequences; means for producing fenemic baseforms from the associated fenemic sequences; a word table containing the words and the fenemic baseforms.
Claim 2
Dependent Claim
78 words
A computer system for speech recognition, comprising: means for producing phonetic baseforms of words; means for deriving triphones from the phonetic baseforms of the words; means for producing all possible triphones of a language; means for producing associated fenemic sequences from said all possible triphones; a triphone table containing said all possible triphones and their associated fenemic sequences; means for producing fenemic baseforms from the associated fenemic sequences; a word table containing the words and the fenemic baseforms.
Claim 3
Dependent Claim
105 words
A computer system for speech recognition, comprising: means for producing phonetic baseforms of words; means for deriving triphones and uniphones from the phonetic baseforms of the words; means for producing fenemic sequences associated with the triphones; a triphone table containing the triphones and their associated fenemic sequences; means for producing all possible uniphones of a language; means for producing fenemic sequences associated with said all possible uniphones; a uniphone table containing said all possible uniphones and their associated fenemic sequences; means for producing fenemic baseforms from the fenemic sequences associated with the triphones and uniphones; a word table containing the words and the fenemic baseforms.
Claim 4
Dependent Claim
105 words
A computer system for speech recognition, comprising: means for producing phonetic baseforms of words; means for deriving triphones and uniphones from the phonetic baseforms of the words; means for producing fenemic sequences associated with the triphones; a triphone table containing the triphones and their associated fenemic sequences; means for producing all possible uniphones of a language; means for producing fenemic sequences associated with said all possible uniphones; a uniphone table containing said all possible uniphones and their associated fenemic sequences; means for producing fenemic baseforms from the fenemic sequences associated with the triphones and uniphones; a word table containing the words and the fenemic baseforms.
Claim 5
Dependent Claim
70 words
The computer system of claim 2, further comprising: means for deriving 1.5 phones from the phonetic baseforms of words; means for producing all possible 1.5 phones of a language; means for producing fenemic sequences associated with said all possible 1.5 phones; a 1.5 phone table containing said all possible 1.5 phones and their associated fenemic sequences; means for producing fenemic baseforms from the fenemic sequences associated with the 1.5 phones.
Claim 6
Dependent Claim
70 words
The computer system of claim 2, further comprising: means for deriving classified triphones from the phonetic baseforms of words; means for producing all possible classified triphones of a language; means for producing fenemic sequences associated with said all possible classified triphones; a classified triphone table containing said all possible classified triphones and their associated fenemic sequences; means for producing fenemic baseforms from the fenemic sequences associated with the classified triphones.
Claim 7
Dependent Claim
110 words
A computer system for speech recognition, comprising: means for producing phonetic baseforms of words; means for deriving triphones and 1.5 phones from the phonetic baseforms of words; means for producing fenemic sequences associated with the triphones; a triphone table containing the triphones and their associated fenemic sequences; means for producing all possible 1.5 phones of a language; means for producing fenemic sequences associated with said all possible 1.5 phones; a 1.5 phone table containing said all possible 1.5 phones and their associated fenemic sequences; means for producing fenemic baseforms from the fenemic sequences associated with the triphones and 1.5 phones; a word table containing the words and the fenemic baseforms.
Claim 8
Dependent Claim
110 words
A computer system for speech recognition, comprising: means for producing phonetic baseforms of words; means for deriving triphones and 1.5 phones from the phonetic baseforms of words; means for producing fenemic sequences associated with the triphones; a triphone table containing the triphones and their associated fenemic sequences; means for producing all possible 1.5 phones of a language; means for producing fenemic sequences associated with said all possible 1.5 phones; a 1.5 phone table containing said all possible 1.5 phones and their associated fenemic sequences; means for producing fenemic baseforms from the fenemic sequences associated with the triphones and 1.5 phones; a word table containing the words and the fenemic baseforms.
Claim 9
Dependent Claim
110 words
A computer system for speech recognition comprising: means for producing phonetic baseforms of words; means for deriving triphones and classified triphones from the phonetic baseforms of words; means for producing fenemic sequences associated with the triphones; a triphone table containing the triphones and their associated fenemic sequences; means for producing all possible classified triphones of a language; means for producing fenemic sequences associated with said all possible classified triphones; a classified triphone table containing said all possible classified triphones and their associated fenemic sequences; means for producing fenemic baseforms from the fenemic sequences associated with the triphones and classified triphones; a word table containing the words and the fenemic baseforms.
Claim 10
Dependent Claim
110 words
A computer system for speech recognition comprising: means for producing phonetic baseforms of words; means for deriving triphones and classified triphones from the phonetic baseforms of words; means for producing fenemic sequences associated with the triphones; a triphone table containing the triphones and their associated fenemic sequences; means for producing all possible classified triphones of a language; means for producing fenemic sequences associated with said all possible classified triphones; a classified triphone table containing said all possible classified triphones and their associated fenemic sequences; means for producing fenemic baseforms from the fenemic sequences associated with the triphones and classified triphones; a word table containing the words and the fenemic baseforms.
Claim 11
Independent Claim
91 words
A method of producing fenemic sequences of a word, for use in a computer system for speech recognition, comprising the steps of: (a) deriving a phonetic baseform of the word; (b) decomposing the phonetic baseform of the word into triphones; (c) producing fenemic sequences associated with the triphones; (d) storing the triphones and the fenemic sequences associated with the triphones in a triphone table; (e) iterating steps (a) through (d) until the triphone table contains all possible triphones of a language and the fenemic sequences associated with said all possible triphones.
Claim 12
Independent Claim
91 words
A method of producing fenemic sequences of a word, for use in a computer system for speech recognition, comprising the steps of: (a) deriving a phonetic baseform of the word; (b) decomposing the phonetic baseform of the word into triphones; (c) producing fenemic sequences associated with the triphones; (d) storing the triphones and the fenemic sequences associated with the triphones in a triphone table; (e) iterating steps (a) through (d) until the triphone table contains all possible triphones of a language and the fenemic sequences associated with said all possible triphones.
Claim 13
Dependent Claim
97 words
The method of claim 7, further comprising the steps of: (f) inputting a new word whose fenemic baseform is to be produced; (g) deriving a phonetic baseform of the new word; (h) decomposing the phonetic baseform of the new word into ordered triphones; (i) selecting the fenemic sequences from the triphone table that correspond to the ordered triphones of step (h); (j) concatenating the fenemic sequences of step (i) according to the ordered triphones of step (h); (k) storing the fenemic sequences of step (j) in a word table as the fenemic baseform of the new word.
Claim 14
Independent Claim
91 words
A method of producing fenemic sequences of a word, for use in a computer system for speech recognition, comprising the steps of: (a) deriving a phonetic baseform of the word; (b) decomposing the phonetic baseform of the word into uniphones; (c) producing fenemic sequences associated with the uniphones; (d) storing the uniphones and the fenemic sequences associated with the uniphones in a uniphone table; (e) iterating steps (a) through (d) until the uniphone table contains all possible uniphones of a language and the fenemic sequences associated with said all possible uniphones.
Claim 15
Independent Claim
91 words
A method of producing fenemic sequences of a word, for use in a computer system for speech recognition, comprising the steps of: (a) deriving a phonetic baseform of the word; (b) decomposing the phonetic baseform of the word into uniphones; (c) producing fenemic sequences associated with the uniphones; (d) storing the uniphones and the fenemic sequences associated with the uniphones in a uniphone table; (e) iterating steps (a) through (d) until the uniphone table contains all possible uniphones of a language and the fenemic sequences associated with said all possible uniphones.
Claim 16
Dependent Claim
153 words
The method of claim 9, further comprising the steps of: (f) decomposing the phonetic baseform of step (a) into triphones; (g) producing fenemic sequences associated with the triphones; (h) storing the triphones and the fenemic sequences associated with the triphones in a triphone table; (i) inputting a new word having a triphone not contained in the triphone table; (j) deriving a phonetic baseform of the new word; (k) decomposing the phonetic baseform of the new word into ordered triphones; (l) selecting the fenemic sequences from the triphone table that correspond to the ordered triphones of step (k); (m) selecting the fenemic sequence from the uniphone table that corresponds to the triphone of step (i); (n) concatenating the fenemic sequences of step (l) and step (m) according to the ordered triphones of step (k); (o) storing the fenemic sequence of step (n) in a word table as a fenemic baseform of the new word.
Claim 17
Independent Claim
96 words
A method of producing fenemic sequences of a word, for use in a computer system for speech recognition, comprising the steps of: (a) deriving a phonetic baseform of the word; (b) decomposing the phonetic baseform into 1.5 phones; (c) producing fenemic sequences associated with the 1.5 phones; (d) storing the 1.5 phones and the fenemic sequences associated with the 1.5 phones in a 1.5 phone table; (e) iterating steps (a) through (d) until the 1.5 phone table contains all possible 1.5 phones of a language and the fenemic sequences associated with said all possible 1.5 phones.
Claim 18
Independent Claim
96 words
A method of producing fenemic sequences of a word, for use in a computer system for speech recognition, comprising the steps of: (a) deriving a phonetic baseform of the word; (b) decomposing the phonetic baseform into 1.5 phones; (c) producing fenemic sequences associated with the 1.5 phones; (d) storing the 1.5 phones and the fenemic sequences associated with the 1.5 phones in a 1.5 phone table; (e) iterating steps (a) through (d) until the 1.5 phone table contains all possible 1.5 phones of a language and the fenemic sequences associated with said all possible 1.5 phones.
Claim 19
Dependent Claim
155 words
The method of claim 11, further comprising the steps of: (f) decomposing the phonetic baseform of step (a) into triphones; (g) producing fenemic sequences associated with the triphones; (h) storing the triphones and the fenemic sequences associated with the triphones in a triphone table; (i) inputting a new word having a triphone not contained in the triphone table; (j) deriving a phonetic baseform of the new word; (k) decomposing the phonetic baseform of the new word into ordered triphones; (l) selecting the fenemic sequences from the triphone table that correspond to the ordered triphones of step (k); (m) selecting the fenemic sequence from the 1.5 phone table that corresponds to the triphones of step (i); (n) concatenating the fenemic sequences of step (l) and step (m) according to the ordered 1.5 phones of step (k); (o) storing the fenemic sequence of step (n) in a word table as a fenemic baseform of the new word.
Claim 20
Independent Claim
96 words
A method of producing fenemic sequences of a word, for use in a computer system for speech recognition, comprising the steps of: (a) deriving a phonetic baseform of the word; (b) decomposing the phonetic baseform into classified triphones; (c) producing fenemic sequences associated with the classified triphones; (d) storing the classified triphones and the fenemic sequences associated with the classified triphones in a classified triphone table; (e) iterating steps (a) through (d) until the classified triphone table contains all possible classified triphones of a language and the fenemic sequences associated with said all possible classified triphones.
Claim 21
Independent Claim
96 words
A method of producing fenemic sequences of a word, for use in a computer system for speech recognition, comprising the steps of: (a) deriving a phonetic baseform of the word; (b) decomposing the phonetic baseform into classified triphones; (c) producing fenemic sequences associated with the classified triphones; (d) storing the classified triphones and the fenemic sequences associated with the classified triphones in a classified triphone table; (e) iterating steps (a) through (d) until the classified triphone table contains all possible classified triphones of a language and the fenemic sequences associated with said all possible classified triphones.
Claim 22
Dependent Claim
154 words
The method of claim 13, further comprising the steps of: (f) decomposing the phonetic baseform of step (a) into triphones; (g) producing fenemic sequences associated with the triphones; (h) storing the triphones and the fenemic sequences associated with the triphones in a triphone table; (i) inputting a new word having a triphone not contained in the triphone table; (j) deriving a phonetic baseform of the new word; (k) decomposing the phonetic baseform of the new word into ordered triphones; (l) selecting the fenemic sequences from the triphone table that correspond to the ordered triphones of step (k); (m) selecting the fenemic sequence from the classified triphone table that corresponds to the triphones of step (i); (n) concatenating the fenemic sequences of step (l) and step (m) according to the ordered triphones of step (k); (o) storing the fenemic sequences of step (n) in a word table as a fenemic baseform of the new word.
References Cited (Backward Citations)
US3770892A
Cited
US4718094A
Cited
US4759068A
Cited
EP0241768A2
Cited
US4882759A
Cited
US5072452A
Cited
US5031217A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-08-07 | 1999-02-06 | 1999-08-08 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-08-07 | 2003-02-06 | 2003-08-08 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-08-07 | 2007-02-06 | 2007-08-08 | $7700.00 | Window Closed / Lapsed |