Main Page | Namespace List | Class Hierarchy | Alphabetical List | Class List | Directories | File List | Class Members | File Members

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

map< string, double > * delta_log
 Space for delta tables used in Viterbi algorithm.
map< string, 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   ) 
 

Constructor.

viterbi::~viterbi  ) 
 

Destructor.


Member Data Documentation

map<string, double>* viterbi::delta_log
 

Space for delta tables used in Viterbi algorithm.

map<string, string>* viterbi::phi
 

Space for phi tables used in Viterbi algorithm.


The documentation for this class was generated from the following files:
Generated on Wed Apr 26 12:59:22 2006 for FreeLing by  doxygen 1.4.4