Word dependent N-best search method
US5241619A · kind A · utility
244Cited by
2References
20Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Jun 25, 1991 |
| Grant date | Aug 31, 1993 |
| Priority date | — |
| Expiry date | Jun 25, 2011 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG10L15/197
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
As a step in finding the one most likely word sequence in a spoken language system, an N-best search is conducted to find the N most likely sentence hypotheses. During the search, word theories are distinguished based only on the one previous word. At each state within a word, the total probability is calculated for each of a few previous words. At the end of each word, the probability score is recorded for each previous word theory, together with the name of the previous word. At the end of the sentence, a recursive traceback is performed to derive the list of the N best sentences.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.