/packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/ |
H A D | dynamic_patricia_trie_writing_helper.h | 60 // Add a word to the dictionary. If the word already exists, update the probability. 62 const int *const wordCodePoints, const int codePointCount, const int probability, 66 bool addBigramWords(const int word0Pos, const int word1Pos, const int probability, 86 const int *const codePoints, const int codePointCount, const int probability, 105 const int probability, const int childrenPos, const int originalBigramListPos, 110 const int probability, int *const writingPos); 113 const int nodeCodePointCount, const int probability, int *const forwardLinkFieldPos); 116 const int probability, const int *const codePoints, bool *const outAddedNewUnigram); 119 const DynamicPatriciaTrieNodeReader *const parentNode, const int probability, 123 const int nodeCodePointCount, const int probability); [all...] |
H A D | dynamic_patricia_trie_writing_helper.cpp | 40 const int *const wordCodePoints, const int codePointCount, const int probability, 63 probability), 70 return setPtNodeProbability(nodeReader, probability, 76 getUpdatedProbability(NOT_A_PROBABILITY /* originalProbability */, probability), 93 getUpdatedProbability(NOT_A_PROBABILITY /* originalProbability */, probability), &pos); 97 const int probability, bool *const outAddedNewBigram) { 118 return mBigramPolicy->addNewBigramEntryToBigramList(word1Pos, probability, &bigramListPos, 124 if (!mBigramPolicy->writeNewBigramEntry(word1Pos, probability, &writingPos)) { 259 const int codePointCount, const int probability, const int childrenPos, 279 // Write probability whe 38 addUnigramWord( DynamicPatriciaTrieReadingHelper *const readingHelper, const int *const wordCodePoints, const int codePointCount, const int probability, bool *const outAddedNewUnigram) argument 96 addBigramWords(const int word0Pos, const int word1Pos, const int probability, bool *const outAddedNewBigram) argument 256 writePtNodeWithFullInfoToBuffer( BufferWithExtendableBuffer *const bufferToWrite, const bool isBlacklisted, const bool isNotAWord, const int parentPos, const int *const codePoints, const int codePointCount, const int probability, const int childrenPos, const int originalBigramListPos, const int originalShortcutListPos, int *const writingPos) argument 323 writePtNodeToBuffer( BufferWithExtendableBuffer *const bufferToWrite, const int parentPos, const int *const codePoints, const int codePointCount, const int probability, int *const writingPos) argument 333 writePtNodeToBufferByCopyingPtNodeInfo( BufferWithExtendableBuffer *const bufferToWrite, const DynamicPatriciaTrieNodeReader *const originalNode, const int parentPos, const int *const codePoints, const int codePointCount, const int probability, int *const writingPos) argument 344 createAndInsertNodeIntoPtNodeArray(const int parentPos, const int *const nodeCodePoints, const int nodeCodePointCount, const int probability, int *const forwardLinkFieldPos) argument 356 setPtNodeProbability( const DynamicPatriciaTrieNodeReader *const originalPtNode, const int probability, const int *const codePoints, bool *const outAddedNewUnigram) argument 386 createChildrenPtNodeArrayAndAChildPtNode( const DynamicPatriciaTrieNodeReader *const parentNode, const int probability, const int *const codePoints, const int codePointCount) argument 399 createNewPtNodeArrayWithAChildPtNode( const int parentPtNodePos, const int *const nodeCodePoints, const int nodeCodePointCount, const int probability) argument [all...] |
H A D | dynamic_patricia_trie_writing_utils.cpp | 105 BufferWithExtendableBuffer *const buffer, const int probability, 107 if (probability < 0 || probability > MAX_PROBABILITY) { 108 AKLOGI("probability cannot be written because the probability is invalid: %d", 109 probability); 113 return buffer->writeUintAndAdvancePosition(probability, PROBABILITY_FIELD_SIZE, 104 writeProbabilityAndAdvancePosition( BufferWithExtendableBuffer *const buffer, const int probability, int *const probabilityFieldPos) argument
|
H A D | dynamic_patricia_trie_writing_utils.h | 53 const int probability, int *const probabilityFieldPos);
|
H A D | dynamic_patricia_trie_policy.h | 83 bool addUnigramWord(const int *const word, const int length, const int probability); 86 const int length1, const int probability);
|
H A D | patricia_trie_policy.h | 80 bool addUnigramWord(const int *const word, const int length, const int probability) { argument 87 const int length1, const int probability) { 86 addBigramWords(const int *const word0, const int length0, const int *const word1, const int length1, const int probability) argument
|
H A D | dynamic_patricia_trie_policy.cpp | 61 // probability is NOT_A_PROBABILITY. In such case, we don't want to treat it as a 82 // First, read the terminal node and get its probability. 89 // Store terminal node probability. 218 const int probability) { 234 if (writingHelper.addUnigramWord(&readingHelper, word, length, probability, 246 const int *const word1, const int length1, const int probability) { 269 if (writingHelper.addBigramWords(word0Pos, word1Pos, probability, &addedNewBigram)) { 217 addUnigramWord(const int *const word, const int length, const int probability) argument 245 addBigramWords(const int *const word0, const int length0, const int *const word1, const int length1, const int probability) argument
|
/packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/bigram/ |
H A D | bigram_list_read_write_utils.h | 66 const int probability) { 67 return (flags & (~MASK_ATTRIBUTE_PROBABILITY)) | (probability & MASK_ATTRIBUTE_PROBABILITY); 71 const int targetPos, const int probability, const bool hasNext, int *const writingPos); 90 const int probability, const bool hasNext, BigramFlags *const outBigramFlags); 65 setProbabilityInFlags(const BigramFlags flags, const int probability) argument
|
H A D | dynamic_bigram_list_policy.h | 65 bool addNewBigramEntryToBigramList(const int bigramTargetPos, const int probability, 68 bool writeNewBigramEntry(const int bigramTargetPos, const int probability,
|
H A D | bigram_list_read_write_utils.cpp | 38 // Mask for attribute probability, stored on 4 bits inside the flags byte. 113 BufferWithExtendableBuffer *const buffer, const int targetPos, const int probability, 116 if (!createAndGetBigramFlags(*writingPos, targetPos, probability, hasNext, &flags)) { 139 const int targetPtNodePos, const int probability, const bool hasNext, 141 BigramFlags flags = probability & MASK_ATTRIBUTE_PROBABILITY; 112 createAndWriteBigramEntry( BufferWithExtendableBuffer *const buffer, const int targetPos, const int probability, const bool hasNext, int *const writingPos) argument 138 createAndGetBigramFlags(const int entryPos, const int targetPtNodePos, const int probability, const bool hasNext, BigramFlags *const outBigramFlags) argument
|
H A D | dynamic_bigram_list_policy.cpp | 232 const int probability, int *const bigramListPos, bool *const outAddedNewBigram) { 265 probability) : probability; 286 return writeNewBigramEntry(bigramTargetPos, probability, bigramListPos); 293 bool DynamicBigramListPolicy::writeNewBigramEntry(const int bigramTargetPos, const int probability, argument 297 ForgettingCurveUtils::getUpdatedEncodedProbability(NOT_A_PROBABILITY, probability) : 298 probability; 367 // Update bigram probability for decaying. 371 // Write new probability. 231 addNewBigramEntryToBigramList(const int bigramTargetPos, const int probability, int *const bigramListPos, bool *const outAddedNewBigram) argument
|
/packages/inputmethods/LatinIME/native/jni/src/suggest/core/dictionary/ |
H A D | bigram_dictionary.cpp | 42 void BigramDictionary::addWordBigram(int *word, int length, int probability, int *bigramProbability, argument 49 AKLOGI("Bigram: Found word = %s, freq = %d :", s, probability); 56 if (probability > bigramProbability[insertAt] || (bigramProbability[insertAt] == probability 72 bigramProbability[insertAt] = probability; 128 // Due to space constraints, the probability for bigrams is approximate - the lower the 129 // unigram probability, the worse the precision. The theoritical maximum error in 130 // resulting probability is 8 - although in the practice it's never bigger than 3 or 4 133 const int probability = mDictionaryStructurePolicy->getProbability( local 135 addWordBigram(bigramBuffer, codePointCount, probability, outBigramProbabilit [all...] |
H A D | bigram_dictionary.h | 38 void addWordBigram(int *word, int length, int probability, int *bigramProbability,
|
H A D | dictionary.h | 72 void addUnigramWord(const int *const word, const int length, const int probability); 75 const int length1, const int probability);
|
H A D | dictionary.cpp | 104 void Dictionary::addUnigramWord(const int *const word, const int length, const int probability) { argument 105 mDictionaryStructureWithBufferPolicy->addUnigramWord(word, length, probability); 109 const int length1, const int probability) { 111 probability); 108 addBigramWords(const int *const word0, const int length0, const int *const word1, const int length1, const int probability) argument
|
/packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/ |
H A D | BinaryDictionaryTests.java | 100 final int probability = 100; 101 binaryDictionary.addUnigramWord("aaa", probability); 103 binaryDictionary.addUnigramWord("aab", probability); 105 binaryDictionary.addUnigramWord("aac", probability); 107 binaryDictionary.addUnigramWord("aa", probability); 109 binaryDictionary.addUnigramWord("aaaa", probability); 111 binaryDictionary.addUnigramWord("a", probability); 117 assertEquals(probability, binaryDictionary.getFrequency("aab")); 118 assertEquals(probability, binaryDictionary.getFrequency("aac")); 119 assertEquals(probability, binaryDictionar [all...] |
/packages/inputmethods/LatinIME/native/jni/src/suggest/core/dicnode/ |
H A D | dic_node_vector.h | 66 const int probability, const bool isTerminal, const bool hasChildren, 71 mDicNodes.back().initAsChild(dicNode, pos, childrenPos, probability, isTerminal, 65 pushLeavingChild(const DicNode *const dicNode, const int pos, const int childrenPos, const int probability, const bool isTerminal, const bool hasChildren, const bool isBlacklistedOrNotAWord, const uint16_t mergedNodeCodePointCount, const int *const mergedNodeCodePoints) argument
|
H A D | dic_node_utils.cpp | 78 const int probability = getBigramNodeProbability(dictionaryStructurePolicy, node, local 81 const float cost = static_cast<float>(MAX_PROBABILITY - probability)
|
/packages/inputmethods/LatinIME/native/jni/src/suggest/core/policy/ |
H A D | dictionary_structure_with_buffer_policy.h | 67 const int probability) = 0; 71 const int length1, const int probability) = 0;
|
/packages/inputmethods/LatinIME/native/jni/src/suggest/core/dicnode/internal/ |
H A D | dic_node_properties.h | 40 void init(const int pos, const int childrenPos, const int nodeCodePoint, const int probability, argument 46 mProbability = probability;
|
/packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/typing/ |
H A D | typing_traversal.h | 171 const int probability = dicNode->getProbability(); local 172 if (probability < ScoringParams::THRESHOLD_NEXT_WORD_PROBABILITY) { 179 || probability >= ScoringParams::THRESHOLD_NEXT_WORD_PROBABILITY_FOR_CAPPED;
|
/packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/utils/ |
H A D | forgetting_curve_utils.cpp | 62 // Caveat: Unlike getProbability(), this method doesn't assume special bigram probability encoding 63 // (i.e. unigram probability + bigram probability delta). 149 const int probability = static_cast<int>(powf(static_cast<float>(MAX_COMPUTED_PROBABILITY), local 151 mTable[i] = min(MAX_COMPUTED_PROBABILITY, max(0, probability));
|
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/ |
H A D | BinaryDictionary.java | 136 private static native void addUnigramWordNative(long dict, int[] word, int probability); argument 138 int probability); 278 public void addUnigramWord(final String word, final int probability) { argument 283 addUnigramWordNative(mNativeDict, codePoints, probability); 287 public void addBigramWords(final String word0, final String word1, final int probability) { argument 293 addBigramWordsNative(mNativeDict, codePoints0, codePoints1, probability); 137 addBigramWordsNative(long dict, int[] word0, int[] word1, int probability) argument
|
/packages/inputmethods/LatinIME/native/jni/ |
H A D | com_android_inputmethod_latin_BinaryDictionary.cpp | 280 jintArray word, jint probability) { 288 dictionary->addUnigramWord(codePoints, wordLength, probability); 292 jintArray word0, jintArray word1, jint probability) { 304 word1Length, probability); 279 latinime_BinaryDictionary_addUnigramWord(JNIEnv *env, jclass clazz, jlong dict, jintArray word, jint probability) argument 291 latinime_BinaryDictionary_addBigramWords(JNIEnv *env, jclass clazz, jlong dict, jintArray word0, jintArray word1, jint probability) argument
|
/packages/inputmethods/LatinIME/native/jni/src/ |
H A D | defines.h | 103 const int probability) { 107 AKLOGI("%2d [ %s ] (%d)", rank, charBuf, probability); 326 // Max value for length, distance and probability which are used in weighting 102 dumpWordInfo(const int *word, const int length, const int rank, const int probability) argument
|