发明名称 |
AUTOMATIC GENERATION OF SIMPLE MARKOV MODEL STUNTED BASEFORMS FOR WORDS IN A VOCABULARY |
摘要 |
The present invention addresses the problem of automatically constructing a phonetic-type baseform which, for a given word, is stunted in length relative to a fenemic baseform for the given word. Specifically, 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 present invention 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. |
申请公布号 |
EP0238695(B1) |
申请公布日期 |
1991.08.28 |
申请号 |
EP19860104223 |
申请日期 |
1986.03.27 |
申请人 |
INTERNATIONAL BUSINESS MACHINES CORPORATION |
发明人 |
BAHL, LALIT RAI;DESOUZA, PETER VINCENT;MERCER, ROBERT LEROY;PICHENY, MICHAEL ALAN |
分类号 |
G10L15/14 |
主分类号 |
G10L15/14 |
代理机构 |
|
代理人 |
|
主权项 |
|
地址 |
|