HomeSort by relevance Sort by last modified time
    Searched full:nbest (Results 1 - 25 of 25) sorted by null

  /external/srec/srec/ca/
rec_nbes.c 56 void CA_DeleteNBestList(CA_NBestList *nbest)
58 if (nbest)
59 srec_nbest_destroy_list(nbest);
63 END_CATCH_CA_EXCEPT(nbest)
67 int CA_NBestListCount(CA_NBestList *nbest)
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)
80 if (nbest)
    [all...]
  /external/speex/libspeex/
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)
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)
111 nbest[k] = nbest[k-1];
114 nbest[k]=i;
117 nbest[k]+=entries;
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)
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)
137 nbest[k] = nbest[k-1];
140 nbest[k]=i;
143 nbest[k]+=entries;
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);
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)
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;
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)
93 *nbest=i;
99 *nbest=i+1;
105 *nbest=i+2;
111 *nbest=i+3;
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];
cb_search.c 359 /*"erase" nbest list*/
  /external/srec/srec/Recognizer/src/
RecognizerResult.c 46 ESR_ReturnCode SR_RecognizerResultGetKeyCount(const SR_RecognizerResult* self, const size_t nbest, size_t* count)
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)
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)
73 return self->getValue(self, nbest, key, value, len);
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,
159 /* Choose nbest-list entry */
160 CHKLOG(rc, impl->results->get(impl->results, nbest, (void **)&results));
192 key, nbest, *len )
227 size_t nbest, i, j, num_semanticResults; local
    [all...]
RecognizerImpl.c 74 CHKLOG(rc, ESR_SessionSetIntIfEmpty("CREC.Recognizer.NBest", 1));
586 CHKLOG(rc, ESR_SessionGetInt("CREC.Recognizer.NBest", &params->top_choices));
    [all...]
  /external/srec/srec/include/
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);
simapi.h 278 int max_altword_tokens; /*controls the maximum number of alternative paths to propagate, for nbest */
    [all...]
srec.h 125 * Contains what we need for later backtrace, nbest, etc.
  /external/srec/srec/Recognizer/include/
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...]
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/crec/
srec_results.c 198 LCHAR* srec_nbest_get_word(void* nbest, size_t choice)
200 srec* rec = (srec*)nbest;
220 in the middle of my nbest list */
225 /* finally change the size of my nbest list */
srec_initialize.c 59 int max_altword_tokens; controls the maximum number of alternative paths to propagate for proper nbest
  /packages/apps/VoiceDialer/src/com/android/voicedialer/
RecognizerLogger.java 141 * Write a header for the NBest lines into the text log file.
144 logLine("Nbest *****************");
  /external/srec/srec_jni/
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);
  /external/srec/srec/Nametag/src/
NametagImpl.c 52 PLogError(L("ESR_INVALID_ARGUMENT (recognition result nbest-list size=0)"));
  /frameworks/base/core/java/android/speech/srec/
Recognizer.java 327 * @return number of results in nbest list.
713 private static native int SR_RecognizerResultGetKeyCount(int recognizer, int nbest);
714 private static native String[] SR_RecognizerResultGetKeyList(int recognizer, int nbest);
716 int nbest, String key);
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/deprecated/
VoiceProxy.java 540 final List<CharSequence> nBest = new ArrayList<CharSequence>();
545 nBest.add(c);
547 if (nBest.size() == 0) {
550 String bestResult = nBest.get(0).toString();
    [all...]
  /external/srec/shared/src/
SessionTypeImpl.c     [all...]
  /external/opencv/cvaux/src/
cvlevmarprojbandle.cpp     [all...]

Completed in 296 milliseconds