System operable as an automaton for recognizing continuously spoken words with reference to demi-word pair reference patterns
US4513435A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Apr 21, 1982 |
| Grant date | Apr 23, 1985 |
| Priority date | — |
| Expiry date | Apr 21, 2002 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG10L15/00
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A system for recognizing a continuously spoken word sequence with reference to preselected reference words with the problem of coarticulation removed, comprises a pattern memory for memorizing demi-word pair reference patterns consisting of a former and a latter reference pattern segment for each reference word and a word pair reference pattern segment for each permutation with repetition of two words selected from the preselected reference words. A recognition unit is operable as a finite-state automaton on concatenating the demi-word pair reference patterns so that no contradiction occurs at each interface of the reference patterns in every concatenation. It is possible to use the automaton in restricting the number of reference patterns in each concatenation either to an odd or an even positive integer.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.