viterbi Class Reference

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>

List of all members.

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.

Detailed Description

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.


Constructor & Destructor Documentation

viterbi::viterbi ( int  T  ) 

Constructor.

Constructor: Create dynammic storage for delta and phi tables used by Viterbi algortihm.

References delta_log, and phi.

viterbi::~viterbi (  ) 

Destructor.

Destructor: Free dynammic storage for delta and phi tables.

References delta_log, and phi.


Member Data Documentation

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().


The documentation for this class was generated from the following files:
Generated on Tue Jul 27 16:29:34 2010 for FreeLing by  doxygen 1.6.3