The class viterbi stores the two maps for each observation: The delta map stores the maximum probability for each state in that observation, the phi map stores the backpath to maximize the probability. More...
#include <hmm_tagger.h>
Public Member Functions | |
viterbi (int) | |
Constructor. | |
~viterbi () | |
Destructor. | |
Public Attributes | |
std::map< std::string, double > * | delta_log |
Space for delta tables used in Viterbi algorithm. | |
std::map< std::string, std::string > * | phi |
Space for phi tables used in Viterbi algorithm. |
The class viterbi stores the two maps for each observation: The delta map stores the maximum probability for each state in that observation, the phi map stores the backpath to maximize the probability.
An instance of this class is created for each sentence to be tagged, and destroyed when work is finished.
viterbi::viterbi | ( | int | T | ) |
viterbi::~viterbi | ( | ) |
std::map<std::string, double>* viterbi::delta_log |
Space for delta tables used in Viterbi algorithm.
Referenced by viterbi(), and ~viterbi().
std::map<std::string, std::string>* viterbi::phi |
Space for phi tables used in Viterbi algorithm.
Referenced by viterbi(), and ~viterbi().