Histogram based pre-pruning scheme for active HMMS
US-9224384-B2 · Dec 29, 2015 · US
US2017301341A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2017301341-A1 |
| Application number | US-201615098343-A |
| Country | US |
| Kind code | A1 |
| Filing date | Apr 14, 2016 |
| Priority date | Apr 14, 2016 |
| Publication date | Oct 19, 2017 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
The disclosed embodiments relate to a method of keyword recognition in a speech signal. The method includes determining a first likelihood score and a second likelihood score of one or more features of a frame of said speech signal being associated with one or more states in a first model and one or more states in a second model, respectively. The one or more states in the first model corresponds to one or more tied triphone states and the one or more states in the second model corresponds to one or more monophone states of a keyword to be recognized in the speech signal. The method further includes determining a third likelihood score based on the first likelihood score and the second likelihood score. The first likelihood score and the third likelihood score are utilizable to determine presence of the keyword in the speech signal.
Opening claim text (preview).
What is claimed is: 1 . A method of keyword recognition in a speech signal, the method comprising: sampling, by one or more processors, the speech signal in one or more frames; determining, by the one or more processors, a first likelihood score of one or more features of a frame, of the one or more frames, of the speech signal being associated with one or more states in a first model, wherein the one or more states in the first model correspond to one or more tied triphone states of a keyword to be recognized in the speech signal, and wherein the one or more features comprise a frequency of an audio in the frame; determining, by the one or more processors, a second likelihood score of the one or more features of the frame of the speech signal being associated with one or more states in a second model, wherein the one or more states in the second model correspond to one or more monophone states of the keyword to be recognized in the speech signal; determining, by the one or more processors, a third likelihood score based on the first likelihood score and the second likelihood score, wherein the third likelihood score is deterministic of a likelihood of the frame corresponding to keywords other than the keyword; and determining, by the one or more processors, a presence of the keyword in the speech signal based on the first likelihood score and the third likelihood score. 2 . The method of claim 1 , further comprising training, by the one or more processors, the first model based on a Gaussian mixture model (GMM) for each of the one or more tied triphone states, wherein the one or more tied triphone states are based on one or more triphone states of the keyword. 3 . The method of claim 1 , further comprising determining, by the one or more processors, a maxima between the first likelihood score and the second likelihood score. 4 . The method of claim 3 , further comprising determining, by the one or more processors, a minima between the first likelihood score and the second likelihood score, wherein the determination of the third likelihood score is based on the maxima, the minima, and a value. 5 . The method of claim 1 , further comprising determining, by the one or more processors, a first score for each of the one or more states in the first model based on the first score of the one or more states in the first model for a previous frame, of the one or more frames, of the speech signal and the first likelihood score, wherein the keyword is recognized in the speech signal based on the first score. 6 . The method of claim 1 , wherein the determination of the third likelihood score is based on a third model, wherein the third model comprises a garbage state. 7 . The method of claim 6 , further comprising determining, by the one or more processors, a second score based on the third likelihood score. 8 . (canceled) 9 . A system of keyword recognition in a speech signal, the system comprising: one or more processors configured to: sample the speech signal in one or more frames; determine a first likelihood score of one or more features of a frame, of the one or more frames, of the speech signal being associated with one or more states in a first model, wherein the one or more states in the first model correspond to one or more tied triphone states of a keyword to be recognized in the speech signal, and wherein the one or more features comprise a frequency of an audio in the frame; determine a second likelihood score of the one or more features of the frame of the speech signal being associated with one or more states in a second model, wherein the one or more states in the second model correspond to one or more monophone states of the keyword to be recognized in the speech signal; determine a third likelihood score based on the first likelihood score and the second likelihood score, wherein the third likelihood score is deterministic of a likelihood of the frame corresponding to keywords other than the keyword; and determine a presence of the keyword in the speech signal based on the first likelihood score and the third likelihood score. 10 . The system of claim 9 , wherein the one or more processors are further configured to train the first model based on a Gaussian mixture model (GMM) for each of the one or more tied triphone states, wherein the one or more tied triphone states are based on one or more triphone states of the keyword. 11 . The system of claim 9 , wherein the one or more processors are further configured to determine a maxima between the first likelihood score and the second likelihood score. 12 . The system of claim 11 , wherein the one or more processors are further configured to determine a minima between the first likelihood score and the second likelihood score, wherein the determination of the third likelihood score is based on the maxima, the minima, and a value. 13 . The system of claim 9 , wherein the one or more processors are further configured to determine a first score for each of the one or more states in the first model based on the first score of the one or more states in the first model for a previous frame, of the one or more frames, of the speech signal and the first likelihood score, wherein the keyword is recognized in the speech signal based on the first score. 14 . The system of claim 9 , wherein the determination of the third likelihood score is based on a third model, wherein the third model comprises a garbage state. 15 . The system of claim 14 , wherein the one or more processors are further configured to determine a second score based on the third likelihood score. 16 . (canceled) 17 . A computer program product for use with a computer, the computer program product comprising a non-transitory computer readable medium, wherein the non-transitory computer readable medium stores a computer program code for keyword recognition in a speech signal, wherein the computer program code is executable by one or more processors to: sample the speech signal in one or more frames; determine a first likelihood score of one or more features of a frame, of the one or more frames, of the speech signal being associated with one or more states in a first model, wherein the one or more states in the first model correspond to one or more tied triphone states of a keyword to be recognized in the speech signal, and wherein the one or more features comprise a frequency of an audio in the frame; determine a second likelihood score of the one or more features of the frame of the speech signal being associated with one or more states in a second model, wherein the one or more states in the second model correspond to one or more monophone states of the keyword to be recognized in the speech signal; determine a third likelihood score based on the first likelihood score and the second likelihood score, wherein the third likelihood score is deterministic of a likelihood of the frame corresponding to keywords other than the keyword; and determine a presence of the keyword in the speech signal based on the first likelihood score and the third likelihood score.
Hidden Markov Models [HMMs] · CPC title
Assessment or evaluation of speech recognition systems · CPC title
using statistical models, e.g. Hidden Markov Models [HMMs] (G10L15/18 takes precedence) · CPC title
Word spotting · CPC title
Demisyllables, biphones or triphones being the recognition units · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.