#include <srch_flat_fwd_internal.h>
◆ ctr_latentry
pctr_t* srch_FLAT_FWD_graph_s::ctr_latentry |
◆ ctr_mpx_whmm
pctr_t* srch_FLAT_FWD_graph_s::ctr_mpx_whmm |
◆ ctr_nonmpx_whmm
pctr_t* srch_FLAT_FWD_graph_s::ctr_nonmpx_whmm |
◆ ctxt
A context table. This parameter, as well as the one in word_fsg.c should all go up to srch.c. They are more generic then the others.
◆ filler_backoff
backoff_t* srch_FLAT_FWD_graph_s::filler_backoff |
◆ final_state
int32 srch_FLAT_FWD_graph_s::final_state |
Final state is supposed to be the last state, so it is usually equal to n_state-1
◆ fwdDBG
Debug object of srch_flat_fwd.c
◆ hmmctx
Structures for flat lexicon decoding search The HMM context.
◆ kbcore
A pointer for convenience
◆ latfile_ext
char const* srch_FLAT_FWD_graph_s::latfile_ext |
Complete word candidate filename for an utterance formed by word_cand_dir/<uttid>.latfile_ext
◆ lathist
Viterbi history (backpointer) table
◆ multiplex
int32 srch_FLAT_FWD_graph_s::multiplex |
Whether we will use multiplexed triphones
◆ multiplex_singleph
int32 srch_FLAT_FWD_graph_s::multiplex_singleph |
Whether we will use multiplexed triphones
◆ n_frm
int32 srch_FLAT_FWD_graph_s::n_frm |
Number of frame of this utternance
◆ n_word_cand
int32 srch_FLAT_FWD_graph_s::n_word_cand |
#candidate entries in word_cand for current utterance. If <= 0; full search performed for current utterance
◆ rcscore
int32* srch_FLAT_FWD_graph_s::rcscore |
rc scores uncompacted; one entry/rc-ciphone
◆ renormalized
int32 srch_FLAT_FWD_graph_s::renormalized |
Whether scores had to be renormalized in current utt
◆ tg_trans_done
uint8* srch_FLAT_FWD_graph_s::tg_trans_done |
If tg_trans_done[w] TRUE, trigram transition to w occurred for a given history, and backoff bigram transition from same history should be avoided
◆ tm_hmmeval
ptmr_t srch_FLAT_FWD_graph_s::tm_hmmeval |
◆ tm_hmmtrans
ptmr_t srch_FLAT_FWD_graph_s::tm_hmmtrans |
◆ tm_wdtrans
ptmr_t srch_FLAT_FWD_graph_s::tm_wdtrans |
◆ ug_backoff
Unigram backoff probability
◆ whmm
whmm_t** srch_FLAT_FWD_graph_s::whmm |
The word hmms list. For actual search traverse
◆ word_cand
Word candidates for each frame. (NOTE!! Another array with a hard limit on its size.)
◆ word_cand_cf
s3wid_t* srch_FLAT_FWD_graph_s::word_cand_cf |
BAD_S3WID terminated array of candidate words for word transition in current frame (if using input word lattices to restrict search).
◆ word_cand_dir
char const* srch_FLAT_FWD_graph_s::word_cand_dir |
Structures for decoding utterances subject to given input word lattices; ie, restricting the decoding to words found in the lattice. (For speeding up the decoding process.) NOTE: This mode is optional. If no input lattice is given, the entire vocabulary is eligible during recognition. Also, SILENCEWORD, FINISHWORD, and noisewords are always eligible candidates.
Input lattice specifies candidate words that may start at a given frame. In addition, this forward pass can also consider words starting at a number of neighbouring frames within a given window.
Input lattice file format: Each line contains a single <word> <startframe> info. The line may contain other info following these two fields; these are ignored. Empty lines and lines beginning with a # char in the first column (ie, comment lines) are ignored. Directory containing candidate words files. If NULL, full search performed for entire run
◆ word_cand_win
int32 srch_FLAT_FWD_graph_s::word_cand_win |
In frame f, candidate words in input lattice from frames [(f - word_cand_win) .. (f + word_cand_win)] will be the actual candidates to be started(entered)
◆ word_ugprob
The documentation for this struct was generated from the following file: