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

/packages/providers/ContactsProvider/src/com/android/providers/contacts/
H A DContactMatcher.java30 // Best possible match score
33 // Suggest to aggregate contacts if their match score is equal or greater than this threshold
36 // Automatically aggregate contacts if their match score is equal or greater than this threshold
39 // Automatically aggregate contacts if the match score is equal or greater than this threshold
74 * "full name", the score may be 99. If we are looking for a "nickname" but
75 * find "first name", the score may be 50 (see specific scores defined
79 * similar the two strings are, the score will be somewhere between 40 and 70, with the exact
80 * match producing the score of 70. The score may also be 0 if the similarity (distance)
128 * Populates the cells of the score matri
184 updatePrimaryScore(int score) argument
191 updateSecondaryScore(int score) argument
321 updatePrimaryScore(long contactId, int score) argument
325 updateSecondaryScore(long contactId, 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/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

Completed in 30 milliseconds