Keyword recognition system and method using template concantenation model
US5218668A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Oct 14, 1992 |
| Grant date | Jun 8, 1993 |
| Priority date | — |
| Expiry date | Oct 14, 2012 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG10L15/00
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Similarity is measured between incoming speech and a plurality of candidate strings of filler and keyword templates to test the hypothesis of a keyword being present against the hypothesis of a keyword not being present in the input speech. As alternatives to a candidate string containing a keyword template, other candidate strings are assembled with filler templates of short speech sounds that may be similar to a keyword. A keyword is "recognized" only when an optimal candidate string containing the corresponding keyword template is determined to match the input speech more closely than all other candidate strings. A concatenation penalty is added to the partial string score each time a new template is added to a candidate string, in order to bias the score in favor of a candidate string containing a longer, keyword template.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.