#include <tst_search.h>
Data Fields | |
| ps_search_t | base |
| ngram_model_t * | lmset |
| Set of language models. | |
| fillpen_t * | fillpen |
| Sphinx3 filler penalty structure. | |
| int32 | n_lextree |
| There can be several unigram lextrees. Number of lexical tree for time switching: n_lextree. | |
| lextree_t ** | curugtree |
| The current unigram tree that used in the search for this utterance. | |
| hash_table_t * | ugtree |
| The pool of trees that stores all word trees. | |
| lextree_t ** | fillertree |
| The pool of trees that stores all filler trees. | |
| int32 | n_lextrans |
| Transitions to lextree (root) made so far | |
| int32 | epl |
| The number of entry per lexical tree. | |
| int32 | isLMLA |
| Is LM lookahead used? | |
| histprune_t * | histprune |
| Structure that wraps up parameters related to absolute pruning. | |
| beam_t * | beam |
| Structure that wraps up beam pruning parameters. | |
| vithist_t * | vithist |
| Viterbi history (backpointer) table. | |
| bitvec_t * | ssid_active |
| Bitvector of active senone sequences. | |
| bitvec_t * | comssid_active |
| Bitvector of active composite senone sequences. | |
| int16 * | composite_senone_scores |
| Composite senone scores. | |
| FILE * | hmmdumpfp |
| File for dumping HMM debugging information. | |
| int | n_frame |
| Number of frames searched so far. | |
| int | exit_id |
| History ID of exit word (or -1 if not done). | |
| tst_stats_t | st |
| Statistics. | |
Definition at line 119 of file tst_search.h.
| int32 tst_search_s::n_lextree |
There can be several unigram lextrees. Number of lexical tree for time switching: n_lextree.
If we're at the end of frame f, we can only transition into the roots of lextree[(f+1) % n_lextree]; same for fillertree[]. This alleviates the problem of excessive Viterbi pruning in lextrees.
Definition at line 130 of file tst_search.h.
Referenced by tst_search_free().
1.4.7