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

  /packages/inputmethods/LatinIME/native/jni/src/dictionary/utils/
probability_utils.h 30 static AK_FORCE_INLINE int backoff(const int unigramProbability) {
31 return unigramProbability;
36 // return unigramProbability > 8 ?
37 // unigramProbability - 8 : (0 == unigramProbability ? 0 : 8);
41 const int unigramProbability, const int bigramProbability) {
42 // We divide the range [unigramProbability..255] in 16.5 steps - in other words, we want
47 const float stepSize = static_cast<float>(MAX_PROBABILITY - unigramProbability)
49 return unigramProbability
multi_bigram_map.cpp 39 const int unigramProbability) {
41 return structurePolicy->getProbability(unigramProbability, NOT_A_PROBABILITY);
46 unigramProbability);
51 nextWordId, unigramProbability);
54 nextWordId, unigramProbability);
65 const int nextWordId, const int unigramProbability) const {
73 return structurePolicy->getProbability(unigramProbability, bigramProbability);
92 const WordIdArrayView prevWordIds, const int nextWordId, const int unigramProbability) {
97 return structurePolicy->getProbability(unigramProbability, NOT_A_PROBABILITY);
multi_bigram_map.h 43 const WordIdArrayView prevWordIds, const int nextWordId, const int unigramProbability);
64 const int nextWordId, const int unigramProbability) const;
78 const WordIdArrayView prevWordIds, const int nextWordId, const int unigramProbability);
forgetting_curve_utils.h 104 static int backoff(const int unigramProbability);
forgetting_curve_utils.cpp 149 /* static */ int ForgettingCurveUtils::backoff(const int unigramProbability) {
151 return unigramProbability;
  /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/
BinaryDictionaryTests.java 264 final int unigramProbability = 100;
267 addUnigramWord(binaryDictionary, "aaa", unigramProbability);
268 addUnigramWord(binaryDictionary, "abb", unigramProbability);
269 addUnigramWord(binaryDictionary, "bcc", unigramProbability);
299 addUnigramWord(binaryDictionary, "abcde", unigramProbability);
300 addUnigramWord(binaryDictionary, "fghij", unigramProbability);
302 addUnigramWord(binaryDictionary, "fgh", unigramProbability);
303 addUnigramWord(binaryDictionary, "abc", unigramProbability);
304 addUnigramWord(binaryDictionary, "f", unigramProbability);
331 final int unigramProbability = random.nextInt(0xFF)
    [all...]
  /packages/inputmethods/LatinIME/native/jni/src/dictionary/interface/
dictionary_structure_with_buffer_policy.h 64 virtual int getProbability(const int unigramProbability, const int bigramProbability) const = 0;
  /packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/v4/
ver4_patricia_trie_policy.h 73 int getProbability(const int unigramProbability, const int bigramProbability) const {
  /packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/backward/v402/
ver4_patricia_trie_policy.h 97 int getProbability(const int unigramProbability, const int bigramProbability) const;
ver4_patricia_trie_policy.cpp 147 int Ver4PatriciaTriePolicy::getProbability(const int unigramProbability,
151 if (unigramProbability == NOT_A_PROBABILITY) {
155 return ProbabilityUtils::backoff(unigramProbability);
  /packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/v2/
patricia_trie_policy.cpp 323 int PatriciaTriePolicy::getProbability(const int unigramProbability,
329 if (unigramProbability == NOT_A_PROBABILITY) {
332 return ProbabilityUtils::backoff(unigramProbability);
334 return ProbabilityUtils::computeProbabilityForBigram(unigramProbability,
patricia_trie_policy.h 70 int getProbability(const int unigramProbability, const int bigramProbability) const;

Completed in 158 milliseconds