发明名称 |
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.
|
申请公布号 |
US2002123881(A1) |
申请公布日期 |
2002.09.05 |
申请号 |
US20010778479 |
申请日期 |
2001.02.07 |
申请人 |
SCHMID PHILIPP H.;LIPE RALPH |
发明人 |
SCHMID PHILIPP H.;LIPE RALPH |
分类号 |
G10L15/18;G10L15/28;H04L29/06;H04L29/08;(IPC1-7):G06F17/28 |
主分类号 |
G10L15/18 |
代理机构 |
|
代理人 |
|
主权项 |
|
地址 |
|