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 state s of the input automaton is first determined. Then, the N-best paths are found in the resul t 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.