Grapheme-to-phoneme conversion with weighted finite state transducers
    2.
    发明公开
    Grapheme-to-phoneme conversion with weighted finite state transducers 失效
    Graphen-nach-Phonem Konversion nach dem Prinzip des endlichen Automaten mit gewichtetenZuständen

    公开(公告)号:EP0736856A2

    公开(公告)日:1996-10-09

    申请号:EP96301701.7

    申请日:1996-03-13

    申请人: AT&T Corp.

    IPC分类号: G10L5/04

    CPC分类号: G10L13/08

    摘要: The present invention provides a method of expanding one or more digits to form a verbal equivalent of the digits. As a predicate to the formation of the verbal equivalent, a linguistic description of a grammar of numerals is provided. This description is then compiled into one or more weighted finite state transducers. The verbal equivalent of the sequence of one or more digits is then synthesized with use of the one or more weighted finite state transducers.

    摘要翻译: 本发明提供了一种扩展一个或多个数字以形成数字的口头等效的方法。 作为形成口头等价物的谓词,提供了数字语法的语言描述。 然后将该描述编译成一个或多个加权的有限状态换能器。 然后使用一个或多个加权有限状态换能器来合成一个或多个数字的序列的语言等价物。

    Determinization and minimization for speech recognition
    3.
    发明公开
    Determinization and minimization for speech recognition 失效
    确定和最小化语音识别

    公开(公告)号:EP0854468A2

    公开(公告)日:1998-07-22

    申请号:EP98300140.5

    申请日:1998-01-09

    申请人: AT&T Corp.

    CPC分类号: G10L15/193

    摘要: A pattern recognition system and method for optimal reduction of redundancy and size of a weighted and labeled graph presents receiving speech signals, converting the speech signals into word sequences, interpreting the word sequences in a graph where the graph is labeled with word sequences and weighted with probabilities and determinizing the graph by removing redundant word sequences. The size of the graph can also be minimized by collapsing some nodes of the graph in a reverse determinizing manner. The graph can further be tested for determinizability to determine if the graph can be determinized. The resulting word sequence in the graph may be shown in a display device so that recognition of speech signals can be demonstrated.

    Determinization and minimization for speech recognition
    4.
    发明公开
    Determinization and minimization for speech recognition 失效
    语音识别的确定和最小化

    公开(公告)号:EP0854468A3

    公开(公告)日:1998-12-30

    申请号:EP98300140.5

    申请日:1998-01-09

    申请人: AT&T Corp.

    CPC分类号: G10L15/193

    摘要: A pattern recognition system and method for optimal reduction of redundancy and size of a weighted and labeled graph presents receiving speech signals, converting the speech signals into word sequences, interpreting the word sequences in a graph where the graph is labeled with word sequences and weighted with probabilities and determinizing the graph by removing redundant word sequences. The size of the graph can also be minimized by collapsing some nodes of the graph in a reverse determinizing manner. The graph can further be tested for determinizability to determine if the graph can be determinized. The resulting word sequence in the graph may be shown in a display device so that recognition of speech signals can be demonstrated.

    摘要翻译: 用于最佳减少加权和标记图的冗余和大小的模式识别系统和方法呈现接收语音信号,将语音信号转换成单词序列,在图中解释单词序列,其中图用单词序列标记并且用 概率并通过去除多余的单词序列来确定图形。 图形的大小也可以通过以反向确定方式折叠图形的一些节点来最小化。 可以进一步测试该图的可确定性以确定该图是否可以确定。 图中得到的单词序列可以显示在显示设备中,以便可以演示语音信号的识别。