/packages/inputmethods/LatinIME/native/jni/src/utils/ |
H A D | autocorrection_threshold_utils.cpp | 45 // score = (int)((original score) * SUGGEST_INTERFACE_OUTPUT_SCALE) 46 // Undo the scaling here to recover the original score. 47 // normalizedScore = ((float)score) / SUGGEST_INTERFACE_OUTPUT_SCALE 50 // original score 53 // * (individual word's score which defined in the unigram dictionary, 54 // and this score is defined in range [0, 255].) 60 // capitalization, then treat it as if the score was 255. 63 // So, maximum original score is powf(2, min(before.length(), after.length())) * 255 * 2 * 1.2 67 // So, we can normalize original score b 69 calcNormalizedScore(const int *before, const int beforeLength, const int *after, const int afterLength, const int score) argument [all...] |
H A D | autocorrection_threshold_utils.h | 27 const int *after, const int afterLength, const int score);
|
/packages/providers/ContactsProvider/src/com/android/providers/contacts/aggregation/util/ |
H A D | ContactMatcher.java | 34 // 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/suggest/policyimpl/typing/ |
H A D | typing_scoring.h | 58 const float score = ScoringParams::TYPING_BASE_OUTPUT_SCORE local 61 return static_cast<int>(score * SUGGEST_INTERFACE_OUTPUT_SCALE);
|
/packages/inputmethods/PinyinIME/jni/share/ |
H A D | spellingtable.cpp | 271 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 D | spellingtrie.cpp | 323 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 D | ngram.cpp | 235 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 D | userdict.cpp | 1828 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 D | matrixsearch.cpp | 220 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/apps/Camera/jni/feature_stab/db_vlvm/ |
H A D | db_framestitching.cpp | 28 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 D | db_feature_matching.cpp | 2930 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/Camera2/jni/feature_stab/db_vlvm/ |
H A D | db_framestitching.cpp | 28 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);
|
/packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
H A D | db_framestitching.cpp | 28 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);
|
/packages/apps/Gallery2/src/com/android/gallery3d/data/ |
H A D | LocationClustering.java | 222 // 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/ |
H A D | BinaryDictionary.java | 134 private static native float calcNormalizedScoreNative(int[] before, int[] after, int score); argument 221 final int score = SuggestedWordInfo.KIND_WHITELIST == kind 226 score, kind, this /* sourceDict */, 239 final int score) { 241 StringUtils.toCodePointArray(after), score); 238 calcNormalizedScore(final String before, final String after, final int score) argument
|
H A D | SuggestedWords.java | 208 * @param score A measure of how likely this suggestion is. 214 public SuggestedWordInfo(final String word, final int score, final int kind, argument 218 mScore = score;
|
/packages/inputmethods/PinyinIME/jni/include/ |
H A D | spellingtrie.h | 36 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 D | matrixsearch.h | 59 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 D | userdict.h | 390 int score; member in struct:ime_pinyin::UserDict::UserDictScoreOffsetPair
|
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/spellcheck/ |
H A D | AndroidSpellCheckerService.java | 264 int wordLength, int score) { 265 final int positionIndex = Arrays.binarySearch(mScores, 0, mLength, score); 271 // In the future, we may want to keep track of the best suggestion score even if 277 // the score cutoff, since we need to know that to return a meaningful 280 // if (score > mBestScore) { 281 // mBestScore = score; 288 // We found a suggestion, but its score is too weak to be kept considering 304 mScores[insertIndex] = score; 362 Log.i(TAG, "Best suggestion : " + bestSuggestion + ", score " + bestScore); 363 Log.i(TAG, "Normalized score 263 addWord(char[] word, int[] spaceIndices, int wordOffset, int wordLength, int score) argument [all...] |
/packages/inputmethods/LatinIME/native/jni/src/suggest/core/layout/ |
H A D | proximity_info_state_utils.cpp | 357 // Calculating a point score that indicates usefulness of the point. 377 float score = 0.0f; local 382 score += ProximityInfoParams::NOT_LOCALMIN_DISTANCE_SCORE; 385 score += ProximityInfoParams::LOCALMIN_DISTANCE_AND_NEAR_TO_KEY_SCORE; 398 score += ProximityInfoParams::CORNER_SCORE; 400 return score; 422 const float score = getPointScore(mostCommonKeyWidth, x, y, time, isLastPoint, nearest, local 425 if (score < 0) {
|
/packages/inputmethods/LatinIME/native/jni/ |
H A D | com_android_inputmethod_latin_BinaryDictionary.cpp | 256 jintArray before, jintArray after, jint score) { 264 afterCodePoints, afterLength, score); 255 latinime_BinaryDictionary_calcNormalizedScore(JNIEnv *env, jclass clazz, jintArray before, jintArray after, jint score) argument
|
/packages/apps/Camera/src/com/android/camera/ui/ |
H A D | FaceView.java | 202 if (mFaces[i].score < 50) continue;
|
/packages/apps/Camera2/src/com/android/camera/ui/ |
H A D | FaceView.java | 208 if (mFaces[i].score < 50) continue;
|
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/research/ |
H A D | ResearchLogger.java | 1261 "suggestion", "x", "y", "isBatchMode", "score", "kind", "sourceDict"); 1269 * @param score the internal score of the suggestion, as output by the dictionary 1275 final int score, final int kind, final String sourceDict) { 1288 Constants.SUGGESTION_STRIP_COORDINATE, isBatchMode, score, kind, sourceDict); 1273 latinIME_pickSuggestionManually(final String replacedWord, final int index, final String suggestion, final boolean isBatchMode, final int score, final int kind, final String sourceDict) argument
|