Finding the top - k viterbi paths in HMM

Question

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 l

Answer 1

There's actually extensive literature on this. It took some digging, but I found this.

List Viterbi Decoding Algorithms with Applications

http://www.ensc.sfu.ca/people/faculty/cavers/ENSC805/readings/42comm02-seshadri.pdf