Lines Matching refs:probability
65 // This retrieves code points and the probability of the word by its id.
78 * outUnigramProbability: a pointer to an int to write the probability into.
95 // The only reason we count PtNodes is because we want to reduce the probability of infinite
146 // first and possibly the probability.
214 // Now we only need to branch to the children address. Skip the probability if
303 const int probability = multiBigramMap->getBigramProbability(this /* structurePolicy */,
305 return getWordAttributes(probability, ptNodeParams);
317 const WordAttributes PatriciaTriePolicy::getWordAttributes(const int probability,
319 return WordAttributes(probability, false /* isBlacklisted */, ptNodeParams.isNotAWord(),
325 // Due to space constraints, the probability for bigrams is approximate - the lower the unigram
326 // probability, the worse the precision. The theoritical maximum error in resulting probability
348 // If this is not a word, it should behave as having no probability outside of the
407 int probability = NOT_A_PROBABILITY;
415 mergedNodeCodePoints, &probability, &childrenPos, &shortcutPos, &bigramPos,
450 const int probability = getProbability(word1Probability, bigramsIt.getProbability());
455 probability, HistoricalInfo());
