Speech recognition employing a set of Markov models that includes Markov models representing transitions to and from silence
US4977599A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Dec 15, 1988 |
| Grant date | Dec 11, 1990 |
| Priority date | — |
| Expiry date | Dec 15, 2008 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG10L2015/0631
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Apparatus and method for constructing word baseforms which can be matched against a string of generated acoustic labels. A set of phonetic phone machines are formed, wherein each phone machine has (i) a plurality of states, (ii) a plurality of transitions each of which extends from a state to a state, (iii) a stored probability for each transition, and (iv) stored label output probabilities, each label output probability corresponding to the probability of each phone machine producing a corresponding label. The set of phonetic machines is formed to include a subset of onset phone machines. The stored probabilities of each onset phone macine correspond to at least one phonetic element being uttered at the beginning of a speech segment. The set of phonetic machines is formed to include a subset of trailing phone machines. The stored probabilities of each trailing phone machine correspond to at least one single phonetic element being uttered at the end of a speech segment. Word baseforms are constructed by concatenating phone machines selected from the set.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.