Finding the top - k viterbi paths in HMM
问题 I need to write an algorithm that finds the top-k viterbi paths in a HMM (using the regular viterbi algorithm to find the best path). I think I probably need to save a list V_t,N of size k for each state N that contains the top-K paths that end in state N, but I am not so sure how to keep track of that list.. any ideas? Thanks 回答1: We can solve this with some care. It is easiest to see by looking at the trellis structure of hmm: In this example the hidden states are 00, 01, 10, 11, denote the