Compact Easily Parseable Binary Format for a Context-Free Grammar
    3.
    发明申请
    Compact Easily Parseable Binary Format for a Context-Free Grammar 有权
    紧凑的易于分析的二进制格式,用于无上下文语法

    公开(公告)号:US20080046242A1

    公开(公告)日:2008-02-21

    申请号:US11857018

    申请日:2007-09-18

    IPC分类号: G10L15/04 G10L15/00

    摘要: A computer-loadable data structure is provided that represents a state-and-transition-based description of a speech grammar. The data structure includes first and second transition entries that both represent transitions from a first state. The second transition entry is contiguous with the first transition entry in the data structure and includes a last-transition value. The last-transition value indicating that the second transition is the last transition from the first state in the data structure.

    摘要翻译: 提供了一种代表基于状态转换的语音语法描述的可计算机可加载的数据结构。 数据结构包括表示从第一状态的转变的第一和第二转换条目。 第二个转换条目与数据结构中的第一个转换条目相邻,并包括最后一个转换值。 表示第二个转换是从数据结构中的第一个状态的最后一个转换的最后一个转换值。

    Compact easily parseable binary format for a context-free grammar
    5.
    发明申请
    Compact easily parseable binary format for a context-free grammar 有权
    紧凑易于解析的二进制格式,用于无上下文的语法

    公开(公告)号:US20050251391A1

    公开(公告)日:2005-11-10

    申请号:US11178043

    申请日:2005-07-08

    摘要: A computer-loadable data structure is provided that represents a state-and-transition-based description of a speech grammar. The data structure includes first and second transition entries that both represent transitions from a first state. The second transition entry is contiguous with the first transition entry in the data structure and includes a last-transition value. The last-transition value indicating that the second transition is the last transition from the first state in the data structure. A method is also provided for retrieving information from a binary grammar. The method includes receiving an index into a set of transition entries and converting the index into a memory offset relative to the beginning of the binary grammar, where the offset is based on a memory offset to the beginning of the set of transition entries, the fixed size of each transition entry and the index.

    摘要翻译: 提供了一种代表基于状态转换的语音语法描述的可计算机可加载的数据结构。 数据结构包括表示从第一状态的转变的第一和第二转换条目。 第二个转换条目与数据结构中的第一个转换条目相邻,并包括最后一个转换值。 表示第二个转换是从数据结构中的第一个状态的最后一个转换的最后一个转换值。 还提供了一种从二进制语法中检索信息的方法。 该方法包括将索引接收到一组转换条目中,并将索引转换为相对于二进制语法的开始的存储器偏移量,其中偏移量基于到转换条目集合的开始处的存储器偏移量,固定的 每个转换条目的大小和索引。

    UTILIZING SPEECH GRAMMAR RULES WRITTEN IN A MARKUP LANGUAGE
    9.
    发明申请
    UTILIZING SPEECH GRAMMAR RULES WRITTEN IN A MARKUP LANGUAGE 有权
    使用语音语法规则书写在标记语言中

    公开(公告)号:US20080243483A1

    公开(公告)日:2008-10-02

    申请号:US12124792

    申请日:2008-05-21

    IPC分类号: G06F17/28 G10L21/00

    摘要: The present invention provides a method and apparatus that utilize a context-free grammar written in a markup language format. The markup language format provides a hierarchical format in which grammar structures are delimited within and defined by a set of tags. The markup language format also provides grammar switch tags that indicate a transitions from the context-free grammar to a dictation grammar or a text buffer grammar. In addition, the markup language format provides for the designation of code to be executed when particular grammar structures are recognized from a speech signal.

    摘要翻译: 本发明提供一种使用以标记语言格式编写的无上下文语法的方法和装置。 标记语言格式提供了分层格式,其中语法结构在一组标签内界定并由其定义。 标记语言格式还提供语法切换标签,指示从上下文无关语法到听写语法或文本缓冲语法的转换。 此外,标记语言格式提供了从语音信号识别特定语法结构时要执行的代码的指定。