N Best Search

Current version of the ISIP decoder only propagates the single best hypothesis at every state. There is only one token per state.

In N-best search, at each state the top N hypotheses will be propagated. This will be achieved by maintaining the top N tokens instead of only the best instance.

N-best lists of hypotheses can be stored in a word graph (lattice) format, which is suitable for the second pass of decoding.