Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
162 words
A method for recognizing spoken utterances of a speaker, comprising the steps of: providing a database of labeled speech data; providing a prototype of a Hidden Markov Model (HMM) definition to define the characteristics of the HMM; parameterizing speech utterances according to one of linear prediction parameters or Mel-scale filter bank parameters; selecting a frame period of approximately 20 msecs and a window duration of substantially 25 msecs for accommodating said parameters; generating HMMs and decoding to specified speech utterances by causing said speaker to utter predefined training speech utterances for each said HMM, statistically computing said generated HMMs with said prototype HMM to provide a set of fully trained HMMs for each utterance indicative of said speaker; using said trained HMMs for recognizing a speaker by computing Laplacian distances for utterances of said speaker during said selected frame period; and iteratively decoding node transitions corresponding to said spoken utterances during said selected frame period to determine which predefined utterance is present.
Claim 2
Independent Claim
162 words
A method for recognizing spoken utterances of a speaker, comprising the steps of: providing a database of labeled speech data; providing a prototype of a Hidden Markov Model (HMM) definition to define the characteristics of the HMM; parameterizing speech utterances according to one of linear prediction parameters or Mel-scale filter bank parameters; selecting a frame period of approximately 20 msecs and a window duration of substantially 25 msecs for accommodating said parameters; generating HMMs and decoding to specified speech utterances by causing said speaker to utter predefined training speech utterances for each said HMM, statistically computing said generated HMMs with said prototype HMM to provide a set of fully trained HMMs for each utterance indicative of said speaker; using said trained HMMs for recognizing a speaker by computing Laplacian distances for utterances of said speaker during said selected frame period; and iteratively decoding node transitions corresponding to said spoken utterances during said selected frame period to determine which predefined utterance is present.
Claim 3
Dependent Claim
45 words
The method according to claim 1, further including the step of hand marking said speech data for seeding the training of HMMs said step of hand marking occurring between the steps of parameterizing said speech data and selecting a frame period for accommodating said parameters.
Claim 4
Dependent Claim
29 words
The method according to claim 1, wherein said node transitions correspond to node transition paths extending through a lattice, wherein said node transition paths are identical at each iteration.
Claim 5
Dependent Claim
13 words
The method according to claim 3, wherein said node decoding is viterbi decoding.
Claim 6
Dependent Claim
26 words
The method according to claim 3, wherein the step of decoding further includes providing a backpointer vector for optimizing optimal paths to each of the nodes.
Claim 7
Dependent Claim
29 words
The method according to claim 1, wherein the step of generating HMMs further includes a preemphasis coefficient of approximately 1.0 and a scale log energy setting of approximately 1.0.
Claim 8
Dependent Claim
19 words
The method according to claim 6, wherein said fully trained HMMs are trained in at least 40 training passes.
Claim 9
Dependent Claim
18 words
The method according to claim 6, wherein said fully trained HMMs are trained in approximately 100 training passes.
Claim 10
Dependent Claim
16 words
The method according to claim 1 wherein said Laplacian distances are stored in a lookup table.