In each frame, there are several word exits. More...
#include <vithist.h>
Data Fields | |
| int32 | state |
| < Mapping from LM state to vithist entry | |
| int32 | vhid |
| Associated vithist ID (only for leaf nodes). | |
| vithist_entry_t * | ve |
| Entry ptr corresponding to vhid (only for leaf nodes). | |
| glist_t | children |
| Children of this node in the LM state tree; data.ptr of type (vh_lms2vh_t *). | |
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.
Definition at line 223 of file vithist.h.
| int32 vh_lms2vh_t::state |
1.6.1