Back pointer table (forward pass lattice; actually a tree). More...
#include <ngram_search.h>
Data Fields | |
int16 | frame |
start or end frame | |
uint8 | valid |
For absolute pruning. | |
uint8 | reserved |
Not used. | |
int32 | wid |
Word index. | |
int32 | bp |
Back Pointer. | |
int32 | score |
Score (best among all right contexts). | |
int32 | s_idx |
Start of BScoreStack for various right contexts. | |
int32 | real_wid |
wid of this or latest predecessor real word | |
int32 | prev_real_wid |
real word predecessor of real_wid | |
int32 | r_diph |
rightmost diphone of this word | |
int32 | ascr |
int32 | lscr |
Back pointer table (forward pass lattice; actually a tree).
Definition at line 108 of file ngram_search.h.