Searched defs:bigramProbability (Results 1 - 4 of 4) sorted by relevance
/packages/inputmethods/LatinIME/native/jni/src/dictionary/utils/ |
H A D | probability_utils.h | 41 const int unigramProbability, const int bigramProbability) { 50 + static_cast<int>(static_cast<float>(bigramProbability + 1) * stepSize); 40 computeProbabilityForBigram( const int unigramProbability, const int bigramProbability) argument
|
H A D | multi_bigram_map.cpp | 66 int bigramProbability = NOT_A_PROBABILITY; local 70 bigramProbability = bigramProbabilityIt->second; 73 return structurePolicy->getProbability(unigramProbability, bigramProbability); 93 const int bigramProbability = structurePolicy->getProbabilityOfWord(prevWordIds, nextWordId); local 94 if (bigramProbability != NOT_A_PROBABILITY) { 95 return bigramProbability;
|
/packages/inputmethods/LatinIME/native/jni/tests/dictionary/structure/v4/content/ |
H A D | language_model_dict_content_test.cpp | 96 const int bigramProbability = 20; local 104 const ProbabilityEntry bigramProbabilityEntry(flag, bigramProbability); 108 EXPECT_EQ(bigramProbability, languageModelDictContent.getWordAttributes(prevWordIds, wordId,
|
/packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/v2/ |
H A D | patricia_trie_policy.cpp | 308 const int bigramProbability = getProbabilityOfWord(prevWordIds, wordId); local 309 if (bigramProbability != NOT_A_PROBABILITY) { 310 return getWordAttributes(bigramProbability, ptNodeParams); 324 const int bigramProbability) const { 331 } else if (bigramProbability == NOT_A_PROBABILITY) { 335 bigramProbability);
|
Completed in 183 milliseconds