vh_lms2vh_t Struct Reference

#include <vithist.h>

List of all members.

Public Attributes

int32 state
int32 vhid
vithist_entry_tve
glist_t children

Detailed Description

In each frame, there are several word exits. There can be several exit instances of the same word, corresponding to different LM histories. Generally, each exit is associated with an LM state. We only need to retain the best entry for each LM state. The following structure is for this purpose. For all exits in the current frame, all n-word histories (assuming an N-gram LM) ending in a given word are arranged in a tree, with the most recent history word at the root. The leaves of the tree point to the (current best) vithist entry with that history in the current frame.


Member Data Documentation

Children of this node in the LM state tree; data.ptr of type (vh_lms2vh_t *)

< Mapping from LM state to vithist entry (Part of) the state information

Entry ptr corresponding to vhid (only for leaf nodes)

Associated vithist ID (only for leaf nodes)


The documentation for this struct was generated from the following file:

Generated on 7 Mar 2010 by  doxygen 1.6.1