US5522011A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Speech coding apparatus and method using classification rules
Assignee: Nuance Communications Inc
•
Filing: 1993-09-27
•
Granted: 1996-05-28
•
Expires: 2013-09-27
Abstract
Abstract A speech coding apparatus and method uses classification rules to code an utterance while consuming fewer computing resources. The value of at least one feature of an utterance is measured during each of a series of successive time intervals to produce a series of feature vector signals representing the feature values. The classification rules comprise at least first and second sets of classification rules. The first set of classification rules map each feature vector signal from a set of all possible feature vector signals to exactly one of at least two disjoint subsets of feature vector signals. The second set of classification rules map each feature vector signal in a subset of feature vector signals to exactly one of at least two different classes of prototype vector signals. Each class contains a plurality of prototype vector signals. According to the classification rules, a first feature vector signal is mapped to a first class of prototype vector signals. The closeness of the feature value of the first feature vector signal is compared to the parameter values of only the prototype vector signals in the first class of prototype vector signals to obtain prototype match scores for the first feature vector signal and each prototype vector signal in the first class. At least the identification value of at least the prototype vector signal having the best prototype match score is output as a coded utterance representation signal of the first feature vector signal.
Inventors
- 👤 Mark E. Epstein
- 👤 Ponani S. Gopalakrishnan
- 👤 David Nahamoo
- 👤 Michael A. Picheny
- 👤 Jan Sedivy
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 13:10
CPC Classifications
G; G10; G10L; G10L19/00; G10L19/02; G10L19/032; G10L19/038
Claims Analysis
Total Claims: 29
Claim 1
Independent Claim
267 words
A speech coding apparatus comprising: means for measuring the value of at least one feature of an utterance during each of a series of successive time intervals to produce a series of feature vector signals representing the feature values; means for storing a plurality of prototype vector signals, each prototype vector signal having at least one parameter value and having an identification value, at least two prototype vector signals having different identification values; classification rules means for storing classification rules mapping each feature vector signal from a set of all possible feature vector signals to exactly one of at least two different classes of prototype vector signals, each class containing a plurality of prototype vector signals and each class of prototype vector signals is at least partially different from other classes of prototype vector signals, wherein each class of prototype vector signals contains less than 1/N times the total number of prototype vector signals in all classes, where 5≦N≦150; classifier means for mapping, by the classification rules, a first feature vector signal to a first class of prototype vector signals; means for comparing the closeness of the feature value of the first feature vector signal to the parameter values of only the prototype vector signals in the first class of prototype vector signals to obtain prototype match scores for the first feature vector signal and each prototype vector signal in the first class; and means for outputting at least the identification value of at least the prototype vector signal having the best prototype match score as a coded utterance representation signal of the first feature vector signal.
Claim 2
Dependent Claim
267 words
A speech coding apparatus comprising: means for measuring the value of at least one feature of an utterance during each of a series of successive time intervals to produce a series of feature vector signals representing the feature values; means for storing a plurality of prototype vector signals, each prototype vector signal having at least one parameter value and having an identification value, at least two prototype vector signals having different identification values; classification rules means for storing classification rules mapping each feature vector signal from a set of all possible feature vector signals to exactly one of at least two different classes of prototype vector signals, each class containing a plurality of prototype vector signals and each class of prototype vector signals is at least partially different from other classes of prototype vector signals, wherein each class of prototype vector signals contains less than 1/N times the total number of prototype vector signals in all classes, where 5≦N≦150; classifier means for mapping, by the classification rules, a first feature vector signal to a first class of prototype vector signals; means for comparing the closeness of the feature value of the first feature vector signal to the parameter values of only the prototype vector signals in the first class of prototype vector signals to obtain prototype match scores for the first feature vector signal and each prototype vector signal in the first class; and means for outputting at least the identification value of at least the prototype vector signal having the best prototype match score as a coded utterance representation signal of the first feature vector signal.
Claim 3
Dependent Claim
42 words
A speech coding apparatus as claimed in claim 1, characterized in that the average number of prototype vector signals in a class of prototype vector signals is approximately equal to 1/10 times the total number of prototype vector signals in all classes.
Claim 4
Dependent Claim
104 words
A speech coding apparatus as claimed in claim 1, characterized in that: the classification rules comprise at least first and second sets of classification rules; the first set of classification rules map each feature vector signal from a set of all possible feature vector signals to exactly one of at least two disjoint subsets of feature vector signals; and the second set of classification rules map each feature vector signal in a subset of feature vector signals to exactly one of at least two different classes of prototype vector signals, wherein the classification rules are determined by an entropy of the prototype vector signals.
Claim 5
Dependent Claim
36 words
A speech coding apparatus as claimed in claim 3, characterized in that the classifier means maps, by the first set of classification rules, the first feature vector signal to a first subset of feature vector signals.
Claim 6
Dependent Claim
44 words
A speech coding apparatus as claimed in claim 4, characterized in that the classifier means maps, by the second set of classification rules, the first feature vector signal from the first subset of feature vector signals to the first class of prototype vector signals.
Claim 7
Dependent Claim
91 words
A speech coding apparatus as claimed in claim 4, characterized in that: the second set of classification rules comprises at least third and fourth sets of classification rules; the third set of classification rules map each feature vector signal from a subset of feature vector signals to exactly one of at least two disjoint sub-subsets of feature vector signals; and the fourth set of classification rules map each feature vector signal in a sub-subset of feature vector signals to exactly one of at least two different classes of prototype vector signals.
Claim 8
Dependent Claim
44 words
A speech coding apparatus as claimed in claim 6, characterized in that the classifier means maps, by the third set of classification rules, the first feature vector signal from the first subset of feature vector signals to a first sub-subset of feature vector signals.
Claim 9
Dependent Claim
44 words
A speech coding apparatus as claimed in claim 7, characterized in that the classifier means maps, by the fourth set of classification rules, the first feature vector signal from the first sub-subset of feature vector signals to the first class of prototype vector signals.
Claim 10
Dependent Claim
85 words
A speech coding apparatus as claimed in claim 8, characterized in that the classification rules comprise: at least one scalar function mapping the feature values of a feature vector signal to a scalar value; and at least one rule mapping feature vector signals whose scalar function is less than a threshold to the first subset of feature vector signals, and mapping feature vector signals whose scalar function is greater than the threshold to a second subset of feature vector signals different from the first subset.
Claim 11
Dependent Claim
69 words
A speech coding apparatus as claimed in claim 9, characterized in that: the measuring means measures the values of at least two features of an utterance during each of a series of successive time intervals to produce a series of feature vector signals representing the feature values; and the scalar function of a feature vector signal comprises the value of only a single feature of the feature vector signal.
Claim 12
Dependent Claim
18 words
A speech coding apparatus as claimed in claim 10, characterized in that the measuring means comprises a microphone.
Claim 13
Dependent Claim
41 words
A speech coding apparatus as claimed in claim 11, characterized in that the measuring means comprises a spectrum analyzer for measuring the amplitudes of the utterance in two or more frequency bands during each of a series of successive time intervals.
Claim 14
Dependent Claim
245 words
A speech coding apparatus comprising: means for measuring the value of at least one feature of an utterance during each of a series of successive time intervals to produce a series of feature vector signals representing feature values; means for storing a plurality of prototype vector signals, each prototype vector signal having at least one parameter value and having an identification value, at least two prototype vector signals having different identification values; classification rules means for storing classification rules mapping each feature vector signal from a set of all possible feature vector signals to exactly one of at least two different classes of prototype vector signals, each class containing a plurality of prototype vector signals; classifier means for mapping, by the classification rules, a first feature vector signal to a first class of prototype vector signals; means for comparing the closeness of the feature value of the first feature vector signal to the parameter values of only the prototype vector signals in the first class prototype vector signals to obtain prototype match scores for the first feature vector signal and each prototype vector signal in the first class, wherein the closeness of the feature vector signal to the prototype vector signal is one of a Euclidian distance and a Gaussian distance; and means for outputting at least the identification value of at least the prototype vector signal having the best prototype match score as a coded utterance representation signal of the first feature vector signal.
Claim 15
Dependent Claim
245 words
A speech coding apparatus comprising: means for measuring the value of at least one feature of an utterance during each of a series of successive time intervals to produce a series of feature vector signals representing feature values; means for storing a plurality of prototype vector signals, each prototype vector signal having at least one parameter value and having an identification value, at least two prototype vector signals having different identification values; classification rules means for storing classification rules mapping each feature vector signal from a set of all possible feature vector signals to exactly one of at least two different classes of prototype vector signals, each class containing a plurality of prototype vector signals; classifier means for mapping, by the classification rules, a first feature vector signal to a first class of prototype vector signals; means for comparing the closeness of the feature value of the first feature vector signal to the parameter values of only the prototype vector signals in the first class prototype vector signals to obtain prototype match scores for the first feature vector signal and each prototype vector signal in the first class, wherein the closeness of the feature vector signal to the prototype vector signal is one of a Euclidian distance and a Gaussian distance; and means for outputting at least the identification value of at least the prototype vector signal having the best prototype match score as a coded utterance representation signal of the first feature vector signal.
Claim 16
Dependent Claim
255 words
A speech coding method comprising the steps of: measuring the value of at least one feature of an utterance during each of a series of successive time intervals to produce a series of feature vector signals representing the feature values; storing a plurality of prototype vector signals, each prototype vector signal having at least one parameter value and having an identification value, at least two prototype vector signals having different identification values; storing classification rules mapping each feature vector signal from a set of all possible feature vector signals to exactly one of at least two different classes of prototype vector signals, each class containing a plurality of prototype vector signals and each class of prototype vector signals is at least partially different from other classes of prototype vector signals, wherein each class of prototype vector signals contains less than 1/N times the total number of prototype vector signals in all classes, where 5≦N≦150; mapping, by the classification rules, a first feature vector signal to a first class of prototype vector signals; comparing the closeness of the feature value of the first feature vector signal to the parameter values of only the prototype vector signals in the first class of prototype vector signals to obtain prototype match scores for the first feature vector signal and each prototype vector signal in the first class; and outputting at least the identification value of at least the prototype vector signal having the best prototype match score as a coded utterance representation signal of the first feature vector signal.
Claim 17
Dependent Claim
255 words
A speech coding method comprising the steps of: measuring the value of at least one feature of an utterance during each of a series of successive time intervals to produce a series of feature vector signals representing the feature values; storing a plurality of prototype vector signals, each prototype vector signal having at least one parameter value and having an identification value, at least two prototype vector signals having different identification values; storing classification rules mapping each feature vector signal from a set of all possible feature vector signals to exactly one of at least two different classes of prototype vector signals, each class containing a plurality of prototype vector signals and each class of prototype vector signals is at least partially different from other classes of prototype vector signals, wherein each class of prototype vector signals contains less than 1/N times the total number of prototype vector signals in all classes, where 5≦N≦150; mapping, by the classification rules, a first feature vector signal to a first class of prototype vector signals; comparing the closeness of the feature value of the first feature vector signal to the parameter values of only the prototype vector signals in the first class of prototype vector signals to obtain prototype match scores for the first feature vector signal and each prototype vector signal in the first class; and outputting at least the identification value of at least the prototype vector signal having the best prototype match score as a coded utterance representation signal of the first feature vector signal.
Claim 18
Dependent Claim
42 words
A speech coding method as claimed in claim 14, characterized in that the average number of prototype vector signals in a class of prototype vector signals is approximately equal to 1/10 times the total number of prototype vector signals in all classes.
Claim 19
Dependent Claim
104 words
A speech coding method as claimed in claim 14, characterized in that: the classification rules comprise at least first and second sets of classification rules; the first set of classification rules map each feature vector signal from a set of all possible feature vector signals to exactly one of at least two disjoint subsets of feature vector signals; and the second set of classification rules map each feature vector signal in a subset of feature vector signals to exactly one of at least two different classes of prototype vector signals, wherein the classification rules are determined by an entropy of the prototype vector signals.
Claim 20
Dependent Claim
38 words
A speech coding method as claimed in claim 16, characterized in that the step of mapping comprises mapping, by the first set of classification rules, the first feature vector signal to a first subset of feature vector signals.
Claim 21
Dependent Claim
46 words
A speech coding method as claimed in claim 17, characterized in that the step of mapping comprises mapping, by the second set of classification rules, the first feature vector signal from the first subset of feature vector signals to the first class of prototype vector signals.
Claim 22
Dependent Claim
91 words
A speech coding method as claimed in claim 17, characterized in that: the second set of classification rules comprises at least third and fourth sets of classification rules; the third set of classification rules map each feature vector signal from a subset of feature vector signals to exactly one of at least two disjoint sub-subsets of feature vector signals; and the fourth set of classification rules map each feature vector signal in a sub-subset of feature vector signals to exactly one of at least two different classes of prototype vector signals.
Claim 23
Dependent Claim
46 words
A speech coding method as claimed in claim 19, characterized in that the step of mapping comprises mapping by the third set of classification rules, the first feature vector signal from the first subset of feature vector signals to a first sub-subset of feature vectors signals.
Claim 24
Dependent Claim
44 words
A speech coding method as claimed in claim 20, characterized in that the classifier means maps, by the fourth set of classification rules, the first feature vector signal from the first sub-subset of feature vector signals to the first class of prototype vector signals.
Claim 25
Dependent Claim
85 words
A speech coding method as claimed in claim 21, characterized in that the classification rules comprise: at least one scalar function mapping the feature values of a feature vector signal to a scalar value; and at least one rule mapping feature vector signals whose scalar function is less than a threshold to the first subset of feature vector signals, and mapping feature vector signals whose scalar function is greater than the threshold to a second subset of feature vector signals different from the first subset.
Claim 26
Dependent Claim
71 words
A speech coding method as claimed in claim 22, characterized in that: the step of measuring comprising measuring the values of at least two features of an utterance during each of a series of successive time intervals to produce a series of feature vector signals representing the feature values; and the scalar function of a feature vector signal comprises the value of only a single feature of the feature vector signal.
Claim 27
Dependent Claim
38 words
A speech coding method as claimed in claim 23, characterized in that the step of measuring comprises measuring the amplitudes of the utterance in two or more frequency bands during each of a series of successive time intervals.
Claim 28
Dependent Claim
239 words
A speech coding method comprising the steps of: measuring the value of at least one feature of an utterance during each of a series of successive time intervals to produce a series of feature vector signals representing the feature values; storing a plurality of prototype vector signals, each prototype vector signal having at least one parameter vector and having an identification value, at least two prototype vector signals having different identification values; storing classification rules mapping each feature vector from a set of all possible feature vectors to exactly one of at least two different classes of prototype vector signals, each class containing a plurality of prototype vector signals; mapping, by the classification rules, a first feature vector signal to a first class of prototype vector signals; comparing the closeness of the feature vector to the first feature vector signal to the parameter vectors of only the prototype vector signals in the first class of prototype vector signals to obtain prototype match scores for the first feature vector signal and each prototype vector signal in the first class, wherein the comparing step includes comparing the closeness of the feature vector signal to the prototype vector signal using is one of a Euclidian distance and a Gaussian distance; and outputting at least the identification value of at least the prototype vector signal having the best prototype match score as a coded utterance representation signal of the first feature vector signal.
Claim 29
Dependent Claim
239 words
A speech coding method comprising the steps of: measuring the value of at least one feature of an utterance during each of a series of successive time intervals to produce a series of feature vector signals representing the feature values; storing a plurality of prototype vector signals, each prototype vector signal having at least one parameter vector and having an identification value, at least two prototype vector signals having different identification values; storing classification rules mapping each feature vector from a set of all possible feature vectors to exactly one of at least two different classes of prototype vector signals, each class containing a plurality of prototype vector signals; mapping, by the classification rules, a first feature vector signal to a first class of prototype vector signals; comparing the closeness of the feature vector to the first feature vector signal to the parameter vectors of only the prototype vector signals in the first class of prototype vector signals to obtain prototype match scores for the first feature vector signal and each prototype vector signal in the first class, wherein the comparing step includes comparing the closeness of the feature vector signal to the prototype vector signal using is one of a Euclidian distance and a Gaussian distance; and outputting at least the identification value of at least the prototype vector signal having the best prototype match score as a coded utterance representation signal of the first feature vector signal.
References Cited (Backward Citations)
US4715004A
Cited
US4980918A
Cited
US4958375A
Cited
US4907276A
Cited
US5067152A
Cited
US5144671A
Cited
US5345536A
Cited
US5182773A
Cited
EP0535380A2
Cited
EP0538626A2
Cited
EP0545083A2
Cited
US5327520A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-05-28 | 1999-11-27 | 2000-05-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-05-28 | 2003-11-27 | 2004-05-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-05-28 | 2007-11-27 | 2008-05-28 | $7700.00 | Window Closed / Lapsed |