tst_search_s Struct Reference

Time-switch tree search module structure. More...

#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.
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.

Detailed Description

Time-switch tree search module structure.

Definition at line 119 of file tst_search.h.

Field Documentation

beam_t* tst_search_s::beam

Structure that wraps up beam pruning parameters.

Definition at line 141 of file tst_search.h.

Referenced by tst_search_free(), and tst_search_init().

int16* tst_search_s::composite_senone_scores

Composite senone scores.

Definition at line 146 of file tst_search.h.

Referenced by tst_search_free(), and tst_search_init().

bitvec_t* tst_search_s::comssid_active

Bitvector of active composite senone sequences.

Definition at line 145 of file tst_search.h.

Referenced by tst_search_free(), and tst_search_init().

lextree_t** tst_search_s::curugtree

The current unigram tree that used in the search for this utterance.

Definition at line 131 of file tst_search.h.

Referenced by tst_search_free(), and tst_search_init().

int tst_search_s::exit_id

History ID of exit word (or -1 if not done).

Definition at line 152 of file tst_search.h.

lextree_t** tst_search_s::fillertree

The pool of trees that stores all filler trees.

Definition at line 134 of file tst_search.h.

Referenced by tst_search_free(), and tst_search_init().

fillpen_t* tst_search_s::fillpen

Sphinx3 filler penalty structure.

Definition at line 122 of file tst_search.h.

Referenced by tst_search_free(), tst_search_init(), and vithist_rescore().

histprune_t* tst_search_s::histprune

Structure that wraps up parameters related to absolute pruning.

Definition at line 140 of file tst_search.h.

Referenced by tst_search_free(), and tst_search_init().

FILE* tst_search_s::hmmdumpfp

File for dumping HMM debugging information.

Definition at line 148 of file tst_search.h.

ngram_model_t* tst_search_s::lmset

Set of language models.

Definition at line 121 of file tst_search.h.

Referenced by tst_search_init().

int tst_search_s::n_frame

Number of frames searched so far.

Definition at line 150 of file tst_search.h.

int32 tst_search_s::n_lextree

There can be several unigram lextrees.

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. Number of lexical tree for time switching: n_lextree

Definition at line 130 of file tst_search.h.

Referenced by tst_search_free(), and tst_search_init().

bitvec_t* tst_search_s::ssid_active

Bitvector of active senone sequences.

Definition at line 144 of file tst_search.h.

Referenced by tst_search_free(), and tst_search_init().

tst_stats_t tst_search_s::st

Statistics.

Definition at line 153 of file tst_search.h.

hash_table_t* tst_search_s::ugtree

The pool of trees that stores all word trees.

Definition at line 133 of file tst_search.h.