Searched refs:score (Results 1 - 24 of 24) sorted by relevance

/packages/providers/ContactsProvider/src/com/android/providers/contacts/aggregation/util/
H A DContactMatcher.java34 // Best possible match score
37 // Suggest to aggregate contacts if their match score is equal or greater than this threshold
40 // Automatically aggregate contacts if their match score is equal or greater than this threshold
43 // Automatically aggregate contacts if the match score is equal or greater than this threshold
81 * "full name", the score may be 99. If we are looking for a "nickname" but
82 * find "first name", the score may be 50 (see specific scores defined
86 * similar the two strings are, the score will be somewhere between 40 and 70, with the exact
87 * match producing the score of 70. The score may also be 0 if the similarity (distance)
135 * Populates the cells of the score matri
191 updatePrimaryScore(int score) argument
198 updateSecondaryScore(int score) argument
344 updatePrimaryScore(long contactId, int score) argument
348 updateSecondaryScore(long contactId, int score) argument
[all...]
/packages/inputmethods/LatinIME/native/jni/src/
H A Dwords_priority_queue.h38 void setParams(int score, unsigned short *word, int wordLength, int type) { argument
39 mScore = score;
60 void push(int score, unsigned short *word, int wordLength, int type) { argument
65 if (minScore >= score) {
73 sw = getFreeSuggestedWord(score, word, wordLength, type);
75 sw->setParams(score, word, wordLength, type);
82 AKLOGI("Push word. %d, %d", score, wordLength);
195 SuggestedWord *getFreeSuggestedWord(int score, unsigned short *word, argument
199 mSuggestedWords[i].setParams(score, word, wordLength, type);
208 const int score local
[all...]
H A Dproximity_info_state.cpp332 // Calculating a point score that indicates usefulness of the point.
362 float score = 0.0f; local
366 score += SAVE_DISTANCE_SCORE;
370 score += SKIP_DISTANCE_SCORE;
376 score += CHECK_LOCALMIN_DISTANCE_SCORE;
388 score += STRAIGHT_SKIP_SCORE;
393 score += CORNER_SCORE;
395 return score;
411 const float score = getPointScore(x, y, time, isLastPoint, nearest, local
413 if (score <
[all...]
H A Dunigram_dictionary.cpp212 AKLOGI("Max normalized score = %f", ns);
290 const int score = sw->mScore; local
294 correction->getPrimaryInputWord(), i, word, wordLength, score);
296 AKLOGI("--- TOP SUB WORDS for %d --- %d %f [%d]", i, score, ns,
411 // with the same score. For the moment we use -1 to make sure the shortcut will
532 int score = 0; local
535 &tempOutputWord, &score, &nextWordLength);
537 AKLOGI("NS(%d) = %f, Score = %d", currentWordIndex, ns, score);
539 // Two words correction won't be done if the score of the first word doesn't exceed the
545 freq = score >> (nextWordLengt
[all...]
H A Dcorrection.h115 const unsigned short *after, const int afterLength, const int score);
H A Dcorrection.cpp792 // Promote or demote the score according to the distance from the sweet spot
994 // In calcNormalizedScore the score will be demoted by (1 - 1 / length)
1008 // In calcNormalizedScore the score will be demoted by (1 - 1 / length) so we have to promote
1092 // original score
1095 // * (individual word's score which defined in the unigram dictionary,
1096 // and this score is defined in range [0, 255].)
1102 // capitalization, then treat it as if the score was 255.
1105 // So, maximum original score is powf(2, min(before.length(), after.length())) * 255 * 2 * 1.2
1109 // So, we can normalize original score by dividing powf(2, min(b.l(),a.l())) * 255 * 2.
1114 const int score) {
1112 calcNormalizedScore(const unsigned short *before, const int beforeLength, const unsigned short *after, const int afterLength, const int score) argument
[all...]
/packages/inputmethods/PinyinIME/jni/share/
H A Dspellingtable.cpp271 double score = log(raw_spellings_[pos].freq) * score_amplifier_; local
272 assert(score >= 0);
274 average_score += score;
276 // Because of calculation precision issue, score might be a little bigger
278 if (score > 255)
279 score = 255;
282 static_cast<char>((unsigned char)score);
H A Dspellingtrie.cpp323 dumb_node_->score = average_score_;
327 splitter_node_->score = average_score_;
333 // Root's score should be cleared.
334 root_->score = 0;
501 if (score_this < node_current->score)
502 node_current->score = score_this;
506 node_current->score = static_cast<unsigned char>(
510 if (node_current->score < min_son_score)
511 min_son_score = node_current->score;
586 if (score_this < node_current->score)
[all...]
H A Dngram.cpp235 float score = static_cast<float>( local
237 if (score > static_cast<float>(kMaxScore)) {
238 score = static_cast<float>(kMaxScore);
240 return score;
331 printf("code:%d, probability:%.9f, log score:%.3f, final score: %.3f\n",
H A Duserdict.cpp1828 int score = _get_lemma_score(wrd, spl, nchar);
1877 uint32 intf = extract_score_freq(score);
1888 uint64 last_mod = extract_score_lmt(score);
1983 score_offset_pairs[i].score = s;
1992 if (s < score_offset_pairs[0].score) {
1993 score_offset_pairs[0].score = s;
2012 int s = sop[i].score;
2014 sop[i].score = sop[j].score;
2016 sop[j].score
[all...]
H A Dmatrixsearch.cpp220 node->score = 0;
653 float score) {
721 .mtrx_nd_pos].score - score_from;
746 .mtrx_nd_pos].score - score_from;
761 // to add new items or update score of some existing items.
1178 printf("-----Prepare candidates, score:\n");
1527 lpi_items_[0].psb = 0; // 0 is bigger than normal lemma score.
1553 float score = mtrx_nd->score + lpi_items[pos].psb; local
1554 if (pos > 0 && score
652 add_lma_to_userdict(uint16 lma_fr, uint16 lma_to, float score) argument
[all...]
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/
H A DBinaryDictionary.java119 private static native float calcNormalizedScoreNative(char[] before, char[] after, int score); argument
172 final int score = SuggestedWordInfo.KIND_WHITELIST == mOutputTypes[j]
175 new String(mOutputChars, start, len), score, mOutputTypes[j], mDictType));
185 public static float calcNormalizedScore(String before, String after, int score) { argument
186 return calcNormalizedScoreNative(before.toCharArray(), after.toCharArray(), score);
H A DSuggestedWords.java138 public SuggestedWordInfo(final CharSequence word, final int score, final int kind, argument
141 mScore = score;
/packages/apps/Camera/jni/feature_stab/db_vlvm/
H A Ddb_framestitching.cpp28 inline void db_RotationFromMOuterProductSum(double R[9],double *score,double M[9]) argument
72 if(score)
74 /*Compute score=transpose(q)*N*q */
76 *score=db_ScalarProduct4(q,y);
H A Ddb_feature_matching.cpp2930 double score; local
2945 score=db_SignedSquareNormCorr11x11Aligned_Post_f(pir_l->patch,pir_r->patch,
2949 if((!(pir_l->pir)) || (score>pir_l->s))
2952 pir_l->s=score;
2955 if((!(pir_r->pir)) || (score>pir_r->s))
2958 pir_r->s=score;
2968 double score; local
2988 score=db_SignedSquareNormCorr21x21Aligned_Post_s(pir_l->patch,pir_r->patch,
2997 score=db_SignedSquareNormCorr11x11Aligned_Post_s(pir_l->patch,pir_r->patch,
3003 score
[all...]
/packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/
H A Ddb_framestitching.cpp28 inline void db_RotationFromMOuterProductSum(double R[9],double *score,double M[9]) argument
72 if(score)
74 /*Compute score=transpose(q)*N*q */
76 *score=db_ScalarProduct4(q,y);
H A Ddb_feature_matching.cpp2930 double score; local
2945 score=db_SignedSquareNormCorr11x11Aligned_Post_f(pir_l->patch,pir_r->patch,
2949 if((!(pir_l->pir)) || (score>pir_l->s))
2952 pir_l->s=score;
2955 if((!(pir_r->pir)) || (score>pir_r->s))
2958 pir_r->s=score;
2968 double score; local
2988 score=db_SignedSquareNormCorr21x21Aligned_Post_s(pir_l->patch,pir_r->patch,
2997 score=db_SignedSquareNormCorr11x11Aligned_Post_s(pir_l->patch,pir_r->patch,
3003 score
[all...]
/packages/apps/Gallery2/src/com/android/gallery3d/data/
H A DLocationClustering.java222 // The score we want to minimize is:
300 // step 5: calculate the final score
301 float score = totalDistance * FloatMath.sqrt(realK);
303 if (score < bestScore) {
304 bestScore = score;
309 if (score == 0) {
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/spellcheck/
H A DAndroidSpellCheckerService.java239 int wordLength, int score) {
240 final int positionIndex = Arrays.binarySearch(mScores, 0, mLength, score);
246 // In the future, we may want to keep track of the best suggestion score even if
252 // the score cutoff, since we need to know that to return a meaningful
255 // if (score > mBestScore) {
256 // mBestScore = score;
263 // We found a suggestion, but its score is too weak to be kept considering
268 // Compute the normalized score and skip this word if it's normalized score does not
272 BinaryDictionary.calcNormalizedScore(mOriginalText, wordString, score);
238 addWord(char[] word, int[] spaceIndices, int wordOffset, int wordLength, int score) argument
[all...]
/packages/inputmethods/PinyinIME/jni/include/
H A Dspellingtrie.h36 unsigned char score; member in struct:ime_pinyin::SpellingNode
62 // store score. For example, "zhuang" is the longgest item in Pinyin list,
64 // Structure: The string ended with '\0' + score char.
65 // An item with a lower score has a higher probability.
129 // parent is used to update its num_of_son and score.
168 // score_amplifier is used to convert a possibility value into score.
170 // assigned with this score.
H A Dmatrixsearch.h59 float score; member in struct:ime_pinyin::MatrixNode
236 // Lemma Items with possibility score, two purposes:
288 // The result is sorted in descendant order by the frequency score.
367 bool add_lma_to_userdict(uint16 lma_from, uint16 lma_num, float score);
H A Duserdict.h390 int score; member in struct:ime_pinyin::UserDict::UserDictScoreOffsetPair
/packages/inputmethods/LatinIME/native/jni/
H A Dcom_android_inputmethod_latin_BinaryDictionary.cpp225 jcharArray before, jcharArray after, jint score) {
234 static_cast<unsigned short *>(afterChars), afterLength, score);
224 latinime_BinaryDictionary_calcNormalizedScore(JNIEnv *env, jobject object, jcharArray before, jcharArray after, jint score) argument
/packages/apps/Camera/src/com/android/camera/ui/
H A DFaceView.java202 if (mFaces[i].score < 50) continue;

Completed in 657 milliseconds