首页>
外国专利>
Compact easily parseable binary format for a context-free grammar
Compact easily parseable binary format for a context-free grammar
展开▼
机译:紧凑,易于解析的二进制格式,可实现无上下文语法
展开▼
页面导航
摘要
著录项
相似文献
摘要
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.
展开▼