Patent US4002114A successfully refreshed from Google Patents.
Patent US5675706A successfully refreshed from Google Patents.
US5675706A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Vocabulary independent discriminative utterance verification for non-keyword rejection in subword based speech recognition
Assignee: Nokia of America Corp
•
Filing: 1995-03-31
•
Granted: 1997-10-07
•
Expires: 2015-03-31
Abstract
Abstract A verification system to determine unknown input speech contains a recognized keyword or consists of speech or other sounds that do not contain any of the keywords. The verification system is designed to operate on the subword level, so that the verification process is advantageously vocabulary independent. Such a vocabulary-independent verifier is achieved by a two-stage verification process comprising subword level verification followed by string level verification. The subword level verification stage verifies each subword segment in the input speech as determined by an Hidden Markov Model recognizer to determine if that segment consists of the sound corresponding to the subword that the HMM recognizer assigned to that segment. The string level verification stage combines the results of the subword level verification to make the rejection decision for the whole keyword. Advantageously, the training of this two-stage verifier is independent of the specific vocabulary set implying that when the vocabulary set is update or changed the verifier need not be retrained and can still be reliably verifying the new set of keywords.
Inventors
- 👤 Chin-hui Lee
- 👤 Rafid Antoon Sukkar
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 23:19
CPC Classifications
G; G10; G10L; G10L15/00; G10L15/04; G10L15/08; G10L15/14; G10L15/142; G10L2015/088
Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
239 words
A method for use in a speech recognition system to verify whether input speech signals comprising digitized speech represents a probable keyword, said probable keyword being determined by a speech recognizer, said method comprising the steps of: processing said digitized speech into recognizer observation vectors; processing said recognizer observation vectors in a Hidden Markov Model (HMM) keyword recognizer, said HMM keyword recognizer having output signals representing said probable keyword, one or more subword segments of said probable keyword, and a likelihood score for each of said one or more subword segments; developing a plurality of subword verification likelihood ratio scores for said one or more subword segments of said probable keyword by generating two probability density functions (PDFs) for each subword, wherein a first of said PDFs represents a PDF of subword verification scores when said subword is correctly recognized and a second of said PDFs represents a PDF of subword verification scores when said subword is not correctly recognized; developing a keyword verification confidence score from said plurality of subword verification likelihood ratio scores for each of said one or more subword segments; verifying whether said probable keyword is present in said input speech signals by comparing said keyword verification confidence score to a threshold; and delivering as an output said probable keyword if said threshold test is met, and delivering as an output an indication that no keyword is detected if said threshold test is not met.
Claim 2
Independent Claim
239 words
A method for use in a speech recognition system to verify whether input speech signals comprising digitized speech represents a probable keyword, said probable keyword being determined by a speech recognizer, said method comprising the steps of: processing said digitized speech into recognizer observation vectors; processing said recognizer observation vectors in a Hidden Markov Model (HMM) keyword recognizer, said HMM keyword recognizer having output signals representing said probable keyword, one or more subword segments of said probable keyword, and a likelihood score for each of said one or more subword segments; developing a plurality of subword verification likelihood ratio scores for said one or more subword segments of said probable keyword by generating two probability density functions (PDFs) for each subword, wherein a first of said PDFs represents a PDF of subword verification scores when said subword is correctly recognized and a second of said PDFs represents a PDF of subword verification scores when said subword is not correctly recognized; developing a keyword verification confidence score from said plurality of subword verification likelihood ratio scores for each of said one or more subword segments; verifying whether said probable keyword is present in said input speech signals by comparing said keyword verification confidence score to a threshold; and delivering as an output said probable keyword if said threshold test is met, and delivering as an output an indication that no keyword is detected if said threshold test is not met.
Claim 3
Dependent Claim
27 words
A method in accordance with claim 1 wherein said subword verification score comprises a difference between a subword verification model score and an anti-subword verification model score.
Claim 4
Dependent Claim
27 words
A method in accordance with claim 2 wherein said subword verification model score comprises a weighted sum of the components of a subword verification model feature set.
Claim 5
Dependent Claim
22 words
A method in accordance with claim 3 wherein said weights in said subword verification score are determined by a discriminative training procedure.
Claim 6
Dependent Claim
25 words
A method in accordance with claim 2 wherein anti-subword verification model score comprises a weighted sum of components of an anti-subword verification model feature set.
Claim 7
Dependent Claim
22 words
A method in accordance with claim 5 wherein said weights in said anti-subword verification score are determined by a discriminative training procedure.
Claim 8
Dependent Claim
25 words
A method in accordance with claim 3 wherein said subword verification model feature set is computed for each of said one or more subword segments.
Claim 9
Dependent Claim
21 words
A method in accordance with claim 5 wherein said anti-subword verification model feature set is computed for each said subword segment.
Claim 10
Dependent Claim
49 words
A method in accordance with claim 7 wherein said subword verification model feature set for a given subword segment is determined by processing said subword segment through a corresponding HMM model and computing HMM state centroids of the recognizer observation vector, HMM state durations, and an HMM likelihood score.
Claim 11
Dependent Claim
55 words
A method in accordance with claim 6 wherein said anti-subword verification model feature set for a given segment is determined by processing said subword segments through an anti-subword HMM model of the recognized subword for that segment and computing HMM state centroids of the recognizer observation vector, HMM state durations, and an HMM likelihood score.
Claim 12
Dependent Claim
40 words
A method in accordance with claim 10 wherein anti-subword HMM models are generated specifically for said verification task, and, for a given subword, an anti-subword model is trained to model sounds other than those modeled by said subword HMM model.
Claim 13
Dependent Claim
22 words
A method in accordance with claim 2 wherein the weights in said subword verification score are determined by a discriminative training procedure.
Claim 14
Dependent Claim
50 words
A method in accordance with claim 1 wherein keyword verification confidence score is generated by taking the logarithm of the product of the subword verification likelihood ratio scores of all of the subwords comprising the keyword; wherein said keyword verification confidence score represents a logarithmic likelihood difference for said keyword.
Claim 15
Dependent Claim
225 words
A keyword detection apparatus that determines whether a digitized speech signal includes one of a preselected plurality of keywords, said apparatus comprising: means for receiving input signals representing digitized speech and developing a plurality of signals representing feature vectors of said digitized speech; means responsive to said input signals and said signals representing feature vectors of said digitized speech for developing output signals representing a probable keyword, one or more subword segments of said probable keyword, and one or more likelihood scores for each of said speech segments; means for developing a plurality of subword and anti-subword model scores for one or more subword segments of said probable keyword, wherein said means for developing a plurality of subword and anti-subword model scores includes means for generating two probability density functions for each subword, wherein a first of said probability density functions represents a probability density function of subword verification scores when said subword is correctly recognized and a second of said probability density functions represents a probability density function of subword verification scores when said subword is not correctly recognized; means for determining a confidence score by combining said plurality of subword and anti-subword scores of said one or more subword segments; and means for comparing said confidence score against a threshold value for determining whether the probable keyword is present in said input signals.
Claim 16
Dependent Claim
225 words
A keyword detection apparatus that determines whether a digitized speech signal includes one of a preselected plurality of keywords, said apparatus comprising: means for receiving input signals representing digitized speech and developing a plurality of signals representing feature vectors of said digitized speech; means responsive to said input signals and said signals representing feature vectors of said digitized speech for developing output signals representing a probable keyword, one or more subword segments of said probable keyword, and one or more likelihood scores for each of said speech segments; means for developing a plurality of subword and anti-subword model scores for one or more subword segments of said probable keyword, wherein said means for developing a plurality of subword and anti-subword model scores includes means for generating two probability density functions for each subword, wherein a first of said probability density functions represents a probability density function of subword verification scores when said subword is correctly recognized and a second of said probability density functions represents a probability density function of subword verification scores when said subword is not correctly recognized; means for determining a confidence score by combining said plurality of subword and anti-subword scores of said one or more subword segments; and means for comparing said confidence score against a threshold value for determining whether the probable keyword is present in said input signals.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-10-06 | 2001-04-07 | 2001-10-07 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-10-06 | 2005-04-07 | 2005-10-07 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-10-06 | 2009-04-07 | 2009-10-07 | $7700.00 | Window Closed / Lapsed |