vithist_t Struct Reference

#include <vithist.h>

List of all members.

Public Attributes

vithist_entry_t ** entry
int32 * frame_start
int32 n_entry
int32 n_frm
int32 n_ci
int32 bghist
int32 wbeam
int32 * bestscore
int32 * bestvh
vh_lms2vh_t ** lms2vh_root
glist_t lwidlist

Detailed Description

Memory management of Viterbi history entries done in blocks. Initially, one block of VITHIST_BLKSIZE entries allocated. If exhausted, another block allocated, and so on. So we can have several discontiguous blocks allocated. Entries are identified by a global, running sequence no.


Member Data Documentation

Best word exit score in each frame

Vithist entry ID with the best exit score in each frame

If TRUE (bigram-mode) only one entry/word/frame; otherwise multiple entries allowed, one per distinct LM state

entry[i][j]= j-th entry in the i-th block allocated

For each frame, the first vithist ID in that frame; (the last is just before the first of the next frame)

lms2vh[w]= Root of LM states ending in w in current frame

List of LM word IDs with entries in lms2vh_root

No. of CI phones

Total #entries used (generates global seq no. or ID)

No. of frames processed so far in this utterance

Pruning beamwidth


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

Generated on 7 Mar 2010 by  doxygen 1.6.1