#include <srch.h>
Public Attributes | |
| int(* | init )(kb_t *kb, void *srch_struct) |
| int(* | uninit )(void *srch_struct) |
| int(* | utt_begin )(void *srch_struct) |
| int(* | utt_end )(void *srch_struct) |
| int(* | decode )(void *srch_struct) |
| int(* | set_lm )(void *srch_struct, const char *lmname) |
| int(* | add_lm )(void *srch_struct, lm_t *lm, const char *lmname) |
| int(* | delete_lm )(void *srch_struct, const char *lmname) |
| int(* | gmm_compute_lv1 )(void *srch_struct, float32 *feat, int32 frmno_lp1, int32 frmno_lp2) |
| int(* | one_srch_frame_lv1 )(void *srch_struct) |
| int(* | hmm_compute_lv1 )(void *srch_struct) |
| int(* | eval_beams_lv1 )(void *srch_struct) |
| int(* | propagate_graph_ph_lv1 )(void *srch_struct) |
| int(* | propagate_graph_wd_lv1 )(void *srch_struct) |
| int(* | gmm_compute_lv2 )(void *srch_struct, float32 **feat, int32 time) |
| int(* | one_srch_frame_lv2 )(void *srch_struct) |
| int(* | hmm_compute_lv2 )(void *srch_struct, int32 frmno) |
| int(* | eval_beams_lv2 )(void *srch_struct) |
| int(* | propagate_graph_ph_lv2 )(void *srch_struct, int32 frmno) |
| int(* | propagate_graph_wd_lv2 )(void *srch_struct, int32 frmno) |
| int(* | rescoring )(void *srch_struct, int32 frmno) |
| int(* | frame_windup )(void *srch_struct, int32 frmno) |
| int(* | compute_heuristic )(void *srch_struct, int32 win_efv) |
| int(* | shift_one_cache_frame )(void *srch_struct, int32 win_efv) |
| int(* | select_active_gmm )(void *srch_struct) |
| glist_t(* | gen_hyp )(void *srch_struct) |
| dag_t *(* | gen_dag )(void *srch_struct, glist_t hyp) |
| int(* | dump_vithist )(void *srch_struct) |
| glist_t(* | bestpath_impl )(void *srch_struct, dag_t *dag) |
| int(* | dag_dump )(void *srch_struct, dag_t *dag) |
| glist_t(* | nbest_impl )(void *srch_struct, dag_t *dag) |
| void * | nothing |
| int(* srch_funcs_s::add_lm)(void *srch_struct,lm_t *lm,const char *lmname) |
Add LM operation
| glist_t(* srch_funcs_s::bestpath_impl)(void *srch_struct,dag_t *dag) |
Interface of best path search.
| int(* srch_funcs_s::compute_heuristic)(void *srch_struct, int32 win_efv) |
| int(* srch_funcs_s::dag_dump)(void *srch_struct, dag_t *dag) |
Interface for sphinx3 dag dumping function
| int(* srch_funcs_s::decode)(void *srch_struct) |
Actual decoding operation
| int(* srch_funcs_s::delete_lm)(void *srch_struct,const char *lmname) |
Delete LM operation
| int(* srch_funcs_s::dump_vithist)(void *srch_struct) |
Dump vithist
| int(* srch_funcs_s::eval_beams_lv1)(void *srch_struct) |
| int(* srch_funcs_s::eval_beams_lv2)(void *srch_struct) |
Compute the beams
| int(* srch_funcs_s::frame_windup)(void *srch_struct, int32 frmno) |
| dag_t*(* srch_funcs_s::gen_dag)(void *srch_struct,glist_t hyp) |
Generation of directed acyclic graph (*.lat.gz). Notice , dumping the dag will be taken care by srch.c. There is mode specific optimization.
| glist_t(* srch_funcs_s::gen_hyp)(void *srch_struct) |
Second stage functions. They provide a generalized interface for different modes to generate output Generation of hypothesis (*.hyp). Notice, displaying hypothesis is taken care by srch.c itself.
| int(* srch_funcs_s::gmm_compute_lv1)(void *srch_struct,float32 *feat,int32 frmno_lp1,int32 frmno_lp2) |
Read FSG operation < lv1 stands for approximate search. Currently not used. Compute Approximate GMM
| int(* srch_funcs_s::gmm_compute_lv2)(void *srch_struct,float32 **feat,int32 time) |
lv2 stands for detail search. Compute detail (CD) GMM scores or lv2
| int(* srch_funcs_s::hmm_compute_lv1)(void *srch_struct) |
| int(* srch_funcs_s::hmm_compute_lv2)(void *srch_struct,int32 frmno) |
Compute detail (CD) HMM scores or lv2
| int(* srch_funcs_s::init)(kb_t *kb,void *srch_struct) |
Initialization of the search, coz the graph type can be different Un-Initialize of the search.
| glist_t(* srch_funcs_s::nbest_impl)(void *srch_struct,dag_t *dag) |
Interface of N-best search.
| void* srch_funcs_s::nothing |
Empty "guard" element which does nothing.
| int(* srch_funcs_s::one_srch_frame_lv1)(void *srch_struct) |
| int(* srch_funcs_s::one_srch_frame_lv2)(void *srch_struct) |
A short-cut function that allows implementer could just implement searching for one frame without implement the following 4 fuctions.
| int(* srch_funcs_s::propagate_graph_ph_lv1)(void *srch_struct) |
| int(* srch_funcs_s::propagate_graph_ph_lv2)(void *srch_struct,int32 frmno) |
Propagate the graph in phone level
| int(* srch_funcs_s::propagate_graph_wd_lv1)(void *srch_struct) |
| int(* srch_funcs_s::propagate_graph_wd_lv2)(void *srch_struct,int32 frmno) |
Propagate the graph in word level
| int(* srch_funcs_s::rescoring)(void *srch_struct,int32 frmno) |
Rescoring srch
| int(* srch_funcs_s::select_active_gmm)(void *srch_struct) |
| int(* srch_funcs_s::set_lm)(void *srch_struct,const char *lmname) |
Set LM operation.
| int(* srch_funcs_s::shift_one_cache_frame)(void *srch_struct, int32 win_efv) |
| int(* srch_funcs_s::uninit)(void *srch_struct) |
Begin search for one utterance
| int(* srch_funcs_s::utt_begin)(void *srch_struct) |
| int(* srch_funcs_s::utt_end)(void *srch_struct) |
End search for one utterance
1.7.6.1