| /external/srec/srec/include/ |
| srec.h | 49 costdata costdelta; /* cost relative to path being propagated */
54 costdata costbasis; /* cost of best fsmarc_token host */
68 costdata cost[MAX_HMM]; /* cost so far*/
88 costdata cost;
108 costdata cost; /* cost for path up to this point*/
148 costdata max_cost_in_q;
200 costdata prune_delta; /* controls the amount of score-based pruning - should this go in the context instead?*/
201 costdata current_prune_delta; /* when the above changes in mid-frame */
202 costdata current_best_cost; /* 0 if single recog */
221 costdata *current_model_scores; /* temporary array used by the search to contain model scores
[all...] |
| swimodel.h | 85 static PINLINE costdata duration_penalty_loop(frameID average_duration, frameID duration_so_far)
89 return (costdata)loop_cost_table[average_duration][duration_so_far-1];
99 static PINLINE costdata duration_penalty_depart(frameID average_duration, frameID duration_so_far)
103 return (costdata) trans_cost_table[average_duration][duration_so_far-1];
|
| srec_eosd.h | 29 costdata eos_costdelta;
30 costdata opt_eos_costdelta;
|
| srec_sizes.h | 26 typedef asr_uint16_t costdata; /*done as cost, so always >= 0*/ typedef
42 #define MAXcostdata ((costdata)65535)
|
| word_lattice.h | 48 int reprune_word_tokens(srec* rec, costdata current_best_cost);
54 costdata lattice_best_cost_to_frame(srec_word_lattice *wl, word_token* word_token_array, frameID ifr);
|
| srec_context.h | 116 costdata wrapup_cost; /* cost of going from optend nodes to endnode */
117 costdata wtw_average; /* cost of going from optend nodes to endnode */
|
| astar.h | 106 costdata prune_delta;
|
| search_network.h | 133 costdata cost;
|
| /external/srec/srec/crec/ |
| srec_initialize.c | 91 rec->current_model_scores = (costdata*) CALLOC_CLR(max_model_states, sizeof(costdata), "search.srec.current_model_scores"); /*FIX - either get NUM_MODELS from acoustic models, or check this someplace to make sure we have enough room*/
110 rec->prune_delta = (costdata)viterbi_prune_thresh;
113 rec->best_model_cost_for_frame = (costdata*)CALLOC_CLR(max_frames, sizeof(costdata), "search.srec.best_model_cost_for_frame");
187 rec->cost_offset_for_frame = (costdata*)CALLOC_CLR(max_frames, sizeof(costdata), "search.srec.current_best_costs");
|
| srec.c | 61 costdata current_best_cost);
62 static void update_internal_hmm_states(srec *rec, costdata *pcurrent_prune_delta,
63 costdata *pcurrent_best_cost,
64 costdata *precomputed_model_scores);
182 current_prune_delta = (costdata)(PRUNE_TIGHTEN * PRUNE_TIGHTEN * current_prune_delta);
212 static altword_token* copy_altwords(srec* rec, altword_token* list1, costdata delta)
215 costdata q2_costdelta;
324 static int compute_model_scores(costdata *current_model_scores, const SWIModel *acoustic_models,
338 current_model_scores[i] = (costdata) - score;
357 costdata *current_model_scores
[all...] |
| word_lattice.c | 84 costdata lattice_best_cost_to_frame(srec_word_lattice *wl, word_token* word_token_array, frameID ifr)
87 costdata best_cost = MAXcostdata;
392 costdata current_best_cost = MAXcostdata;
679 int reprune_word_tokens(srec* rec, costdata current_best_cost)
754 rec->astar_stack->prune_delta = (costdata) keep_astar_prune;
|
| priority_q.c | 193 costdata cost_to_add;
327 costdata get_priority_q_threshold(priority_q *pq, word_token *word_token_array)
|
| srec_debug.c | 98 costdata* costs = &stoken->cost[0];
|
| srec_eosd.c | 87 costdata wrapup_cost = rec->context->wrapup_cost;
|
| srec_context.c | 110 wordID olabel, costdata cost,
239 void fst_set_wb_costs( srec_context* context, costdata wbcost)
251 costdata wbcost = MAXcostdata;
262 wbcost = (costdata)atoi_with_check(val, MAXcostdata);
279 fst_set_wb_costs( context, (costdata)DEFAULT_WB_COST);
916 costdata cost = FREEcostdata;
[all...] |
| srec_results.c | 34 costdata current_best_cost = MAXcostdata;
|
| astar.c | 300 costdata best_cost_for_node;
[all...] |
| /external/srec/srec/Grammar/src/ |
| SR_GrammarImpl.c | 730 costdata mincost;
|
| /external/srec/srec/Semproc/src/ |
| SemanticGraphImpl.c | 282 costdata cost = 0;
[all...] |
