Decoding HMMs using the k best paths: algorithms and applications

摘要

BackgroundTraditional algorithms for hidden Markov model decoding seek to maximize either the probability of a state path or the number of positions of a sequence assigned to the correct state. These algorithms provide only a single answer and in practice do not produce good results.