Memory management of Viterbi history entries done in blocks. More...
#include <vithist.h>
Data Fields | |
| vithist_entry_t ** | entry |
| entry[i][j]= j-th entry in the i-th block allocated | |
| int32 * | frame_start |
| For each frame, the first vithist ID in that frame; (the last is just before the first of the next frame). | |
| int32 | n_entry |
| Total entries used (generates global seq no. | |
| int32 | n_frm |
| No. | |
| int32 | n_ci |
| No. | |
| int32 | bghist |
| If TRUE (bigram-mode) only one entry/word/frame; otherwise multiple entries allowed, one per distinct LM state. | |
| int32 | wbeam |
| Pruning beamwidth. | |
| int32 * | bestscore |
| Best word exit score in each frame. | |
| int32 * | bestvh |
| Vithist entry ID with the best exit score in each frame. | |
| vh_lms2vh_t ** | lms2vh_root |
| lms2vh[w]= Root of LM states ending in w in current frame | |
| glist_t | lwidlist |
| List of LM word IDs with entries in lms2vh_root. | |
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.
Definition at line 239 of file vithist.h.
| int32 vithist_t::n_ci |
No.
of CI phones
Definition at line 245 of file vithist.h.
Referenced by vithist_enter(), and vithist_init().
| int32 vithist_t::n_entry |
Total entries used (generates global seq no.
or ID)
Definition at line 243 of file vithist.h.
Referenced by vithist_dump(), vithist_enter(), vithist_frame_windup(), vithist_init(), vithist_prune(), vithist_utt_begin(), vithist_utt_end(), and vithist_utt_reset().
| int32 vithist_t::n_frm |
No.
of frames processed so far in this utterance
Definition at line 244 of file vithist.h.
Referenced by vithist_dump(), vithist_enter(), vithist_frame_windup(), vithist_partialutt_end(), vithist_rescore(), vithist_utt_begin(), and vithist_utt_end().
1.6.1