/external/srec/srec/ca/ |
H A D | rec_nbes.c | 56 void CA_DeleteNBestList(CA_NBestList *nbest) argument 58 if (nbest) 59 srec_nbest_destroy_list(nbest); 63 END_CATCH_CA_EXCEPT(nbest) 67 int CA_NBestListCount(CA_NBestList *nbest) argument 70 if (nbest) 71 return srec_nbest_get_num_choices(nbest); 75 END_CATCH_CA_EXCEPT(nbest) 78 int CA_NBestListGetResultConfidenceValue(CA_NBestList *nbest, size_t choice, int *value) argument 80 if (nbest) 89 CA_NBestListRemoveResult(CA_NBestList *nbest, int index) argument 94 CA_NBestListGetResultWord(CA_NBestList* nbest, size_t iChoice) argument 99 CA_NBestListGetResultWordIDs(CA_NBestList* nbest, size_t index, wordID* wordIDs, size_t* len, asr_int32_t* cost) argument [all...] |
/external/speex/libspeex/ |
H A D | vq_bfin.h | 37 void vq_nbest(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack) argument 67 : "=&D" (dist), "=&a" (codebook), "=&d" (best_dist[0]), "=&d" (nbest[0]), "=&a" (E) 68 : "a" (len-1), "a" (in), "a" (2), "d" (entries), "d" (len<<1), "1" (codebook), "4" (E), "2" (best_dist[0]), "3" (nbest[0]) 99 nbest[k] = nbest[k-1]; 102 nbest[k]=i;
|
H A D | vq.h | 45 void vq_nbest(spx_word16_t *in, const __m128 *codebook, int len, int entries, __m128 *E, int N, int *nbest, spx_word32_t *best_dist, char *stack); 47 void vq_nbest_sign(spx_word16_t *in, const __m128 *codebook, int len, int entries, __m128 *E, int N, int *nbest, spx_word32_t *best_dist, char *stack); 49 void vq_nbest(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack); 51 void vq_nbest_sign(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack);
|
H A D | vq.c | 76 void vq_nbest(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack) argument 95 nbest[k] = nbest[k-1]; 98 nbest[k]=i; 110 void vq_nbest_sign(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack) argument 137 nbest[k] = nbest[k-1]; 140 nbest[k]=i; 143 nbest[k]+=entries;
|
H A D | vq_arm4.h | 36 void vq_nbest(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack) argument 93 *nbest=i; 99 *nbest=i+1; 105 *nbest=i+2; 111 *nbest=i+3;
|
H A D | vq_sse.h | 36 void vq_nbest(spx_word16_t *_in, const __m128 *codebook, int len, int entries, __m128 *E, int N, int *nbest, spx_word32_t *best_dist, char *stack) argument 62 nbest[k] = nbest[k-1]; 65 nbest[k]=i; 75 void vq_nbest_sign(spx_word16_t *_in, const __m128 *codebook, int len, int entries, __m128 *E, int N, int *nbest, spx_word32_t *best_dist, char *stack) argument 111 nbest[k] = nbest[k-1]; 114 nbest[k]=i; 117 nbest[k]+=entries;
|
H A D | ltp.c | 564 VARDECL(int *nbest); 576 ALLOC(nbest, N, int); 609 open_loop_nbest_pitch(sw, start, end, nsf, nbest, NULL, N, stack); 611 nbest[0] = start; 619 pitch=nbest[i];
|
/external/srec/srec/include/ |
H A D | srec_results.h | 35 /* nbest */ 37 void srec_nbest_destroy_list(void* nbest); 38 int srec_nbest_get_num_choices(void* nbest); 42 int srec_nbest_get_result(void* nbest, int n, char* label, int label_len, asr_int32_t* cost, int whether_strip_slot_markers); 43 LCHAR* srec_nbest_get_word(void* nbest, size_t choice); 44 ESR_ReturnCode srec_nbest_get_resultWordIDs(void* nbest, size_t inde, wordID* wordIDs, size_t* len, asr_int32_t* cost);
|
H A D | simapi.h | 278 int max_altword_tokens; /*controls the maximum number of alternative paths to propagate, for nbest */ 2324 * Params hNbest valid nbest object handle 2356 * Returns the n'th nbest-list entry. 2358 * @param nbest N-best list structure 2365 ESR_ReturnCode CA_NBestListGetResultWordIDs(CA_NBestList* nbest, size_t iChoice, wordID* wordIDs, size_t* len, asr_int32_t* cost); 2831 * nbestlist Handle to nbest list where confidence values will be inserted
|
/external/srec/srec/Recognizer/include/ |
H A D | SR_RecognizerResult.h | 66 * @param nbest Index of n-best list element (0-based) 70 ESR_ReturnCode(*getKeyCount)(const struct SR_RecognizerResult_t* self, const size_t nbest, 77 * @param nbest Index of n-best list element (0-based) 81 * @return ESR_INVALID_ARGUMENT if self or list are null; ESR_OUT_OF_BOUNDS if nbest entry does not exist; 84 ESR_ReturnCode(*getKeyList)(const struct SR_RecognizerResult_t* self, const size_t nbest, 90 * @param nbest Index of n-best list element (0-based) 95 * @return ESR_INVALID_ARGUMENT if self or list are null; ESR_OUT_OF_BOUNDS if nbest entry does not exist; 98 ESR_ReturnCode(*getValue)(const struct SR_RecognizerResult_t* self, const size_t nbest, 136 * @param nbest Index of n-best list element (0-based) 142 const size_t nbest, [all...] |
H A D | SR_RecognizerResultImpl.h | 65 * The first ArrayList denotes the nbest-list. 66 * The second ArrayList denotes the collection of semantic results per nbest list entry. 93 const size_t nbest, 99 const size_t nbest, 106 const size_t nbest,
|
/external/srec/srec/Recognizer/src/ |
H A D | RecognizerResult.c | 46 ESR_ReturnCode SR_RecognizerResultGetKeyCount(const SR_RecognizerResult* self, const size_t nbest, size_t* count) argument 53 return self->getKeyCount(self, nbest, count); 56 ESR_ReturnCode SR_RecognizerResultGetKeyList(const SR_RecognizerResult* self, const size_t nbest, LCHAR** list, size_t* size) argument 63 return self->getKeyList(self, nbest, list, size); 66 ESR_ReturnCode SR_RecognizerResultGetValue(const SR_RecognizerResult* self, const size_t nbest, const LCHAR* key, LCHAR* value, size_t* len) argument 73 return self->getValue(self, nbest, key, value, len);
|
H A D | RecognizerResultImpl.c | 104 const size_t nbest, size_t* count) 111 /* Choose nbest-list entry */ 112 CHKLOG(rc, impl->results->get(impl->results, nbest, (void **)&results)); 125 const size_t nbest, LCHAR** list, size_t* listSize) 132 /* Choose nbest-list entry */ 133 CHKLOG(rc, impl->results->get(impl->results, nbest, (void **)&results)); 147 ESR_ReturnCode SR_RecognizerResult_GetValue(const SR_RecognizerResult* self, const size_t nbest, argument 159 /* Choose nbest-list entry */ 160 CHKLOG(rc, impl->results->get(impl->results, nbest, (void **)&results)); 192 key, nbest, *le 103 SR_RecognizerResult_GetKeyCount(const SR_RecognizerResult* self, const size_t nbest, size_t* count) argument 124 SR_RecognizerResult_GetKeyList(const SR_RecognizerResult* self, const size_t nbest, LCHAR** list, size_t* listSize) argument 227 size_t nbest, i, j, num_semanticResults; local [all...] |
/external/srec/srec_jni/ |
H A D | android_speech_srec_Recognizer.cpp | 488 (JNIEnv *env, jclass clazz, jint recognizer, jint nbest) { 490 checkEsrError(env, SR_RecognizerResultGetKeyCount(((SR_RecognizerImpl*)recognizer)->result, nbest, &size)); 495 (JNIEnv *env, jclass clazz, jint recognizer, jint nbest) { 499 ESR_ReturnCode esr_status = SR_RecognizerResultGetKeyList(((SR_RecognizerImpl*)recognizer)->result, nbest, list, &listSize); 525 (JNIEnv *env, jclass clazz, jint recognizer, jint nbest, jstring key) { 529 ESR_ReturnCode esr_status = SR_RecognizerResultGetValue(((SR_RecognizerImpl*)recognizer)->result, nbest, ke, rtn, &rtnLength); 487 Java_android_speech_srec_Recognizer_SR_1RecognizerResultGetKeyCount(JNIEnv *env, jclass clazz, jint recognizer, jint nbest) argument 494 Java_android_speech_srec_Recognizer_SR_1RecognizerResultGetKeyList(JNIEnv *env, jclass clazz, jint recognizer, jint nbest) argument 524 Java_android_speech_srec_Recognizer_SR_1RecognizerResultGetValue(JNIEnv *env, jclass clazz, jint recognizer, jint nbest, jstring key) argument
|
/external/srec/srec/crec/ |
H A D | srec_results.c | 198 LCHAR* srec_nbest_get_word(void* nbest, size_t choice) argument 200 srec* rec = (srec*)nbest; 220 in the middle of my nbest list */ 225 /* finally change the size of my nbest list */
|