nltk.tag.HiddenMarkovModelTagger.best_path_simple¶

HiddenMarkovModelTagger.best_path_simple(unlabeled_sequence)[source]¶

Returns the state sequence of the optimal (most probable) path through the HMM. Uses the Viterbi algorithm to calculate this part by dynamic programming. This uses a simple, direct method, and is included for teaching purposes.

Returns:	the state sequence
Return type:	sequence of any
Parameters:	unlabeled_sequence (list) – the sequence of unlabeled symbols