Searched defs:recm (Results 1 - 6 of 6) sorted by relevance
/external/srec/srec/crec/ |
H A D | rec_norm.c | 35 int inherit_recognition_statistics(utterance_info *utt, multi_srec *recm, argument 40 multi_srec_get_speech_bounds(recm, &speech_start, &speech_end);
|
H A D | c47mulsp.c | 30 int add_acoustic_model_for_recognition(multi_srec* recm, const SWIModel* model) argument 32 if (recm->num_swimodels >= MAX_ACOUSTIC_MODELS) 37 if (recm->num_activated_recs >= recm->num_allocated_recs) 43 if (recm->rec[0].num_model_slots_allocated < model->num_hmmstates) 46 recm->rec[0].num_model_slots_allocated, 51 recm->swimodel[ recm->num_swimodels] = model; 52 recm->num_swimodels++; 54 recm 58 clear_acoustic_models_for_recognition(multi_srec* recm) argument 65 begin_recognition(multi_srec *recm, int begin_syn_node) argument 78 end_recognition(multi_srec *recm) argument 91 activate_grammar_for_recognition(multi_srec* recm, srec_context* grammar, const char* rule) argument 118 clear_grammars_for_recognition(multi_srec* recm) argument [all...] |
H A D | srec_results.c | 31 static srec* WHICH_RECOG(multi_srec* recm) argument 37 for (i = 0; i < recm->num_activated_recs; i++) 40 if (current_best_cost > recm->rec[i].current_best_cost) 42 current_best_cost = recm->rec[i].current_best_cost; 43 return_rec = &recm->rec[i]; 51 int srec_get_bestcost_recog_id(multi_srec* recm, int* id) argument 53 srec* rec = WHICH_RECOG(recm); 76 int srec_has_results(multi_srec* recm) argument 78 srec* rec = WHICH_RECOG(recm); 92 int srec_clear_results(multi_srec* recm) argument 108 srec_nbest_prepare_list(multi_srec* recm, int n, asr_int32_t* bestcost) argument [all...] |
H A D | word_lattice.c | 409 ESR_ReturnCode srec_get_top_choice_wordIDs(multi_srec* recm, wordID* wordIDs, size_t* len) argument 411 srec* rec = WHICH_RECOG(recm); 444 int srec_get_top_choice_transcription(multi_srec* recm, char *transcription, int len, int whether_strip_slot_markers) argument 447 srec* rec = WHICH_RECOG(recm); 457 if( recm->eos_status == VALID_SPEECH_NOT_YET_DETECTED) 486 int srec_get_top_choice_score(multi_srec* recm, bigcostdata *cost, int do_incsil) argument 488 srec* rec = WHICH_RECOG(recm); 518 int srec_print_results(multi_srec *recm, int max_choices) argument 523 srec_get_top_choice_transcription(recm, transcription, MAX_LEN, 1); 524 srec_get_top_choice_score(recm, [all...] |
H A D | srec.c | 2002 int multi_srec_viterbi(multi_srec *recm, argument 2009 ASSERT(recm->num_activated_recs == recm->num_swimodels); 2010 if (recm->num_activated_recs == 1) 2013 srec* rec1 = &recm->rec[0]; 2019 srec_viterbi_part1(&recm->rec[0], recm->swimodel[0], pattern, DO_NOT_COMPUTE_MODEL); 2021 reset_cost_offsets(recm, rec1->current_search_frame, rec1->current_best_cost); 2024 srec_viterbi_part2(&recm->rec[0]); 2025 eosrc1 = srec_check_end_of_speech(eosd, &recm 2356 multi_srec_get_speech_bounds(multi_srec* recm, frameID* start_frame, frameID* end_frame) argument [all...] |
/external/srec/srec/include/ |
H A D | simapi.h | 102 multi_srec *recm; /* contains recognition structure */ member in struct:__anon25959
|
Completed in 212 milliseconds