发明名称 |
Systems and methods for determining the N-best strings |
摘要 |
Systems and methods for identifying the N-best strings of a weighted automaton. A potential for each state of an input automaton to a set of destination states of the input automaton is first determined. Then, the N-best paths are found in the result of an on-the-fly determinization of the input automaton. Only the portion of the input automaton needed to identify the N-best paths is determinized. As the input automaton is determinized, a potential for each new state of the partially determinized automaton is determined and is used in identifying the N-best paths of the determinized automaton, which correspond exactly to the N-best strings of the input automaton. |
申请公布号 |
US8234115(B2) |
申请公布日期 |
2012.07.31 |
申请号 |
US20020301098 |
申请日期 |
2002.11.21 |
申请人 |
MOHRI MEHRYAR;RILEY MICHAEL DENNIS;AT&T INTELLECTUAL PROPERTY II, L.P. |
发明人 |
MOHRI MEHRYAR;RILEY MICHAEL DENNIS |
分类号 |
G10L15/00;G06F3/00;G06F17/10;G10L15/08;G10L15/14;G10L15/18;G10L21/00 |
主分类号 |
G10L15/00 |
代理机构 |
|
代理人 |
|
主权项 |
|
地址 |
|