111 #ifndef _S3_LEXTREE_H_ 112 #define _S3_LEXTREE_H_ 135 #define LEXTREE_OPERATION_SUCCESS 1 136 #define LEXTREE_OPERATION_FAILURE 0 138 #define LEXTREE_TYPE_FILLER -1 139 #define LEXTREE_TYPE_UNIGRAM 0 140 #define LEXTREE_TYPE_BIGRAM 1 141 #define LEXTREE_TYPE_TRIGRAM 2 144 #define LEXTREE_TYPE_QUADGRAM 3 145 #define LEXTREE_TYPE_QUINGRAM 4 211 #define lextree_node_wid(n) ((n)->wid) 212 #define lextree_node_prob(n) ((n)->prob) 213 #define lextree_node_ssid(n) ((n)->ssid) 214 #define lextree_node_rc(n) ((n)->rc) 215 #define lextree_node_composite(n) ((n)->composite) 216 #define lextree_node_frame(n) ((n)->frame) 260 #define lextree_type(l) ((l)->type) 261 #define lextree_root(l) ((l)->root) 262 #define lextree_lcroot(l) ((l)->lcroot) 263 #define lextree_n_lc(l) ((l)->n_lc) 264 #define lextree_n_node(l) ((l)->n_node) 265 #define lextree_n_alloc_node(l) ((l)->n_alloc_node) 266 #define lextree_active(l) ((l)->active) 267 #define lextree_next_active(l) ((l)->next_active) 268 #define lextree_n_active(l) ((l)->n_active) 269 #define lextree_n_next_active(l) ((l)->n_next_active) hmm_context_t * comctx
Definition: lextree.h:245
strcture for storing the model definition.
Definition: mdef.h:184
File that implement various structure for fast algorithms. fast_algo_struct implement beam_t...
Definition: lextree.h:233
Definition: vithist.h:238
Generic structure that could be used at any n-gram level.
Definition: lm.h:783
int32 num_lextree_links(lextree_t *ltree)
Structure that contains all parameters for phoneme lookahead.
Definition: fast_algo_struct.h:173
int32 n_active
Definition: lextree.h:250
lextree_t * fillertree_init(kbcore_t *kbcore)
int32 type
Definition: lextree.h:234
int32 n_next_active
Definition: lextree.h:251
lextree_node_t ** active
Definition: lextree.h:247
An individual HMM among the HMM search space.
void lextree_enter(lextree_t *lextree, s3cipid_t lc, int32 frame, int32 inscore, int32 inhist, int32 thresh, kbcore_t *kbc)
kb core structures, the structure that stores parameters for s3.X search
void lextree_hmm_histbin(lextree_t *lextree, int32 bestscr, int32 *bin, int32 nbin, int32 bw)
Operations on dictionary.
lextree_node_t ** next_active
Definition: lextree.h:248
int32 prob
Definition: lextree.h:202
lextree_lcroot_t * lcroot
Definition: lextree.h:237
int32 wid
Definition: lextree.h:201
HMM data structure and operation.
glist_t root
Definition: lextree.h:225
int32 lextree_hmm_propagate_non_leaves(lextree_t *lextree, kbcore_t *kbc, int32 cf, int32 th, int32 pth, int32 wth, pl_t *pl)
int8 composite
Definition: lextree.h:207
Definition: lextree.h:183
int32 n_alloc_node
Definition: lextree.h:241
lextree_t * lextree_init(kbcore_t *kbcore, lm_t *lm, char *lmname, int32 istreeUgProb, int32 bReport, int32 type)
void lextree_utt_end(lextree_t *l, kbcore_t *kbc)
int16 s3cipid_t
Definition: s3types.h:110
void lextree_ci_active(lextree_t *lextree, bitvec_t *ci_active)
Definition: lextree.h:223
Viterbi history structures. Mainly vithist_t, also its slightly older brother latticehist_t. They are respectively used by decode (mode 4 and 5) and decode_anytopo (mode 3). The curent arrangement is temporary.
Size definition of semantically units. Common for both s3 and s3.X decoder.
Shared information between a set of HMMs.
int32 n_alloc_blk_sz
Definition: lextree.h:242
void lextree_report(lextree_t *ltree)
a structure for a dictionary.
Definition: dict.h:146
void lextree_ssid_active(lextree_t *lextree, uint8 *ssid, uint8 *comssid)
glist_t root
Definition: lextree.h:236
int32 n_lc
Definition: lextree.h:239
glist_t children
Definition: lextree.h:187
void lextree_dump(lextree_t *lextree, dict_t *dict, mdef_t *mdef, FILE *fp, int32 fmt)
int32 ssid
Definition: lextree.h:203
int32 wbest
Definition: lextree.h:254
hmm_context_t * ctx
Definition: lextree.h:244
s3cipid_t ci
Definition: lextree.h:206
The language model. All unigrams are read into memory on initialization. Bigrams and trigrams read in...
Wrapper to hold senone scores.
s3cipid_t lc
Definition: lextree.h:224
int32 lextree_hmm_eval(lextree_t *lextree, kbcore_t *kbc, ascr_t *ascr, int32 f, FILE *fp)
int32 n_node
Definition: lextree.h:240
hmm_context_t * ctx
Definition: lextree.h:185
void lextree_active_swap(lextree_t *lextree)
lextree_t * lextree_build(kbcore_t *kbc, wordprob_t *wordprob, int32 n_word, s3cipid_t *lc, int32 type)
void lextree_free(lextree_t *lextree)
int32 best
Definition: lextree.h:253
s3cipid_t rc
Definition: lextree.h:204
int32 lextree_hmm_propagate_leaves(lextree_t *lextree, kbcore_t *kbc, vithist_t *vh, int32 cf, int32 wth)
hmm_t hmm
Definition: lextree.h:184