Automatic generation of simple Markov model stunted baseforms for words in a vocabulary
US4833712A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | May 29, 1985 |
| Grant date | May 23, 1989 |
| Priority date | — |
| Expiry date | May 29, 2005 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG10L15/063
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
In a system that (i) defines each word in a vocabulary by a fenemic baseform of fenemic phones, (ii) defines an alphabet of composite phones each of which corresponds to at least one fenemic phone, and (iii) generates a string of fenemes in response to speech input, the method provides for converting a word baseform comprised of fenemic phones into a stunted word baseform of composite phones by (a) replacing each fenemic phone in the fenemic phone word baseform by the composite phone corresponding thereto; and (b) merging together at least one pair of adjacent composite phones by a single composite phone where the adverse effect of the merging is below a predefined threshold.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.