Enable count based dynamic ngram language model for v403.
Bug: 14425059 Change-Id: Icc15e14cfd77d37cd75f75318fd0fa36f9ca7a5bmain
parent
660b00477c
commit
bcb52d73e2
|
@ -81,6 +81,9 @@ void Dictionary::NgramListenerForPrediction::onVisitEntry(const int ngramProbabi
|
|||
}
|
||||
const WordAttributes wordAttributes = mDictStructurePolicy->getWordAttributesInContext(
|
||||
mPrevWordIds, targetWordId, nullptr /* multiBigramMap */);
|
||||
if (wordAttributes.getProbability() == NOT_A_PROBABILITY) {
|
||||
return;
|
||||
}
|
||||
mSuggestionResults->addPrediction(targetWordCodePoints, codePointCount,
|
||||
wordAttributes.getProbability());
|
||||
}
|
||||
|
|
|
@ -26,6 +26,8 @@ namespace latinime {
|
|||
*/
|
||||
class NgramListener {
|
||||
public:
|
||||
// ngramProbability is always 0 for v403 decaying dictionary.
|
||||
// TODO: Remove ngramProbability.
|
||||
virtual void onVisitEntry(const int ngramProbability, const int targetWordId) = 0;
|
||||
virtual ~NgramListener() {};
|
||||
|
||||
|
|
|
@ -19,11 +19,11 @@
|
|||
#include <algorithm>
|
||||
#include <cstring>
|
||||
|
||||
#include "suggest/policyimpl/dictionary/utils/forgetting_curve_utils.h"
|
||||
#include "suggest/policyimpl/dictionary/structure/v4/content/dynamic_language_model_probability_utils.h"
|
||||
#include "suggest/policyimpl/dictionary/utils/probability_utils.h"
|
||||
|
||||
namespace latinime {
|
||||
|
||||
const int LanguageModelDictContent::DUMMY_PROBABILITY_FOR_VALID_WORDS = 1;
|
||||
const int LanguageModelDictContent::TRIE_MAP_BUFFER_INDEX = 0;
|
||||
const int LanguageModelDictContent::GLOBAL_COUNTERS_BUFFER_INDEX = 1;
|
||||
|
||||
|
@ -39,7 +39,8 @@ bool LanguageModelDictContent::runGC(
|
|||
}
|
||||
|
||||
const WordAttributes LanguageModelDictContent::getWordAttributes(const WordIdArrayView prevWordIds,
|
||||
const int wordId, const HeaderPolicy *const headerPolicy) const {
|
||||
const int wordId, const bool mustMatchAllPrevWords,
|
||||
const HeaderPolicy *const headerPolicy) const {
|
||||
int bitmapEntryIndices[MAX_PREV_WORD_COUNT_FOR_N_GRAM + 1];
|
||||
bitmapEntryIndices[0] = mTrieMap.getRootBitmapEntryIndex();
|
||||
int maxPrevWordCount = 0;
|
||||
|
@ -53,7 +54,15 @@ const WordAttributes LanguageModelDictContent::getWordAttributes(const WordIdArr
|
|||
bitmapEntryIndices[i + 1] = nextBitmapEntryIndex;
|
||||
}
|
||||
|
||||
const ProbabilityEntry unigramProbabilityEntry = getProbabilityEntry(wordId);
|
||||
if (mHasHistoricalInfo && unigramProbabilityEntry.getHistoricalInfo()->getCount() == 0) {
|
||||
// The word should be treated as a invalid word.
|
||||
return WordAttributes();
|
||||
}
|
||||
for (int i = maxPrevWordCount; i >= 0; --i) {
|
||||
if (mustMatchAllPrevWords && prevWordIds.size() > static_cast<size_t>(i)) {
|
||||
break;
|
||||
}
|
||||
const TrieMap::Result result = mTrieMap.get(wordId, bitmapEntryIndices[i]);
|
||||
if (!result.mIsValid) {
|
||||
continue;
|
||||
|
@ -62,36 +71,39 @@ const WordAttributes LanguageModelDictContent::getWordAttributes(const WordIdArr
|
|||
ProbabilityEntry::decode(result.mValue, mHasHistoricalInfo);
|
||||
int probability = NOT_A_PROBABILITY;
|
||||
if (mHasHistoricalInfo) {
|
||||
const int rawProbability = ForgettingCurveUtils::decodeProbability(
|
||||
probabilityEntry.getHistoricalInfo(), headerPolicy);
|
||||
if (rawProbability == NOT_A_PROBABILITY) {
|
||||
// The entry should not be treated as a valid entry.
|
||||
continue;
|
||||
}
|
||||
const HistoricalInfo *const historicalInfo = probabilityEntry.getHistoricalInfo();
|
||||
int contextCount = 0;
|
||||
if (i == 0) {
|
||||
// unigram
|
||||
probability = rawProbability;
|
||||
contextCount = mGlobalCounters.getTotalCount();
|
||||
} else {
|
||||
const ProbabilityEntry prevWordProbabilityEntry = getNgramProbabilityEntry(
|
||||
prevWordIds.skip(1 /* n */).limit(i - 1), prevWordIds[0]);
|
||||
if (!prevWordProbabilityEntry.isValid()) {
|
||||
continue;
|
||||
}
|
||||
if (prevWordProbabilityEntry.representsBeginningOfSentence()) {
|
||||
probability = rawProbability;
|
||||
} else {
|
||||
const int prevWordRawProbability = ForgettingCurveUtils::decodeProbability(
|
||||
prevWordProbabilityEntry.getHistoricalInfo(), headerPolicy);
|
||||
probability = std::min(MAX_PROBABILITY - prevWordRawProbability
|
||||
+ rawProbability, MAX_PROBABILITY);
|
||||
if (prevWordProbabilityEntry.representsBeginningOfSentence()
|
||||
&& historicalInfo->getCount() == 1) {
|
||||
// BoS ngram requires multiple contextCount.
|
||||
continue;
|
||||
}
|
||||
contextCount = prevWordProbabilityEntry.getHistoricalInfo()->getCount();
|
||||
}
|
||||
const float rawProbability =
|
||||
DynamicLanguageModelProbabilityUtils::computeRawProbabilityFromCounts(
|
||||
historicalInfo->getCount(), contextCount, i + 1);
|
||||
const int encodedRawProbability =
|
||||
ProbabilityUtils::encodeRawProbability(rawProbability);
|
||||
const int decayedProbability =
|
||||
DynamicLanguageModelProbabilityUtils::getDecayedProbability(
|
||||
encodedRawProbability, *historicalInfo);
|
||||
probability = DynamicLanguageModelProbabilityUtils::backoff(
|
||||
decayedProbability, i + 1 /* n */);
|
||||
} else {
|
||||
probability = probabilityEntry.getProbability();
|
||||
}
|
||||
// TODO: Some flags in unigramProbabilityEntry should be overwritten by flags in
|
||||
// probabilityEntry.
|
||||
const ProbabilityEntry unigramProbabilityEntry = getProbabilityEntry(wordId);
|
||||
return WordAttributes(probability, unigramProbabilityEntry.isBlacklisted(),
|
||||
unigramProbabilityEntry.isNotAWord(),
|
||||
unigramProbabilityEntry.isPossiblyOffensive());
|
||||
|
@ -167,7 +179,8 @@ void LanguageModelDictContent::exportAllNgramEntriesRelatedToWordInner(
|
|||
ProbabilityEntry::decode(entry.value(), mHasHistoricalInfo);
|
||||
if (probabilityEntry.isValid()) {
|
||||
const WordAttributes wordAttributes = getWordAttributes(
|
||||
WordIdArrayView(*prevWordIds), wordId, headerPolicy);
|
||||
WordIdArrayView(*prevWordIds), wordId, true /* mustMatchAllPrevWords */,
|
||||
headerPolicy);
|
||||
outBummpedFullEntryInfo->emplace_back(*prevWordIds, wordId,
|
||||
wordAttributes, probabilityEntry);
|
||||
}
|
||||
|
@ -231,7 +244,7 @@ bool LanguageModelDictContent::updateAllEntriesOnInputWord(const WordIdArrayView
|
|||
return false;
|
||||
}
|
||||
mGlobalCounters.updateMaxValueOfCounters(
|
||||
updatedUnigramProbabilityEntry.getHistoricalInfo()->getCount());
|
||||
updatedNgramProbabilityEntry.getHistoricalInfo()->getCount());
|
||||
if (!originalNgramProbabilityEntry.isValid()) {
|
||||
entryCountersToUpdate->incrementNgramCount(i + 2);
|
||||
}
|
||||
|
@ -242,10 +255,9 @@ bool LanguageModelDictContent::updateAllEntriesOnInputWord(const WordIdArrayView
|
|||
const ProbabilityEntry LanguageModelDictContent::createUpdatedEntryFrom(
|
||||
const ProbabilityEntry &originalProbabilityEntry, const bool isValid,
|
||||
const HistoricalInfo historicalInfo, const HeaderPolicy *const headerPolicy) const {
|
||||
const HistoricalInfo updatedHistoricalInfo = ForgettingCurveUtils::createUpdatedHistoricalInfo(
|
||||
originalProbabilityEntry.getHistoricalInfo(), isValid ?
|
||||
DUMMY_PROBABILITY_FOR_VALID_WORDS : NOT_A_PROBABILITY,
|
||||
&historicalInfo, headerPolicy);
|
||||
const HistoricalInfo updatedHistoricalInfo = HistoricalInfo(historicalInfo.getTimestamp(),
|
||||
0 /* level */, originalProbabilityEntry.getHistoricalInfo()->getCount()
|
||||
+ historicalInfo.getCount());
|
||||
if (originalProbabilityEntry.isValid()) {
|
||||
return ProbabilityEntry(originalProbabilityEntry.getFlags(), &updatedHistoricalInfo);
|
||||
} else {
|
||||
|
@ -311,7 +323,7 @@ int LanguageModelDictContent::getBitmapEntryIndex(const WordIdArrayView prevWord
|
|||
|
||||
bool LanguageModelDictContent::updateAllProbabilityEntriesForGCInner(const int bitmapEntryIndex,
|
||||
const int prevWordCount, const HeaderPolicy *const headerPolicy,
|
||||
MutableEntryCounters *const outEntryCounters) {
|
||||
const bool needsToHalveCounters, MutableEntryCounters *const outEntryCounters) {
|
||||
for (const auto &entry : mTrieMap.getEntriesInSpecifiedLevel(bitmapEntryIndex)) {
|
||||
if (prevWordCount > MAX_PREV_WORD_COUNT_FOR_N_GRAM) {
|
||||
AKLOGE("Invalid prevWordCount. prevWordCount: %d, MAX_PREV_WORD_COUNT_FOR_N_GRAM: %d.",
|
||||
|
@ -328,33 +340,41 @@ bool LanguageModelDictContent::updateAllProbabilityEntriesForGCInner(const int b
|
|||
}
|
||||
continue;
|
||||
}
|
||||
if (mHasHistoricalInfo && !probabilityEntry.representsBeginningOfSentence()
|
||||
&& probabilityEntry.isValid()) {
|
||||
const HistoricalInfo historicalInfo = ForgettingCurveUtils::createHistoricalInfoToSave(
|
||||
probabilityEntry.getHistoricalInfo(), headerPolicy);
|
||||
if (ForgettingCurveUtils::needsToKeep(&historicalInfo, headerPolicy)) {
|
||||
// Update the entry.
|
||||
const ProbabilityEntry updatedEntry(probabilityEntry.getFlags(), &historicalInfo);
|
||||
if (!mTrieMap.put(entry.key(), updatedEntry.encode(mHasHistoricalInfo),
|
||||
bitmapEntryIndex)) {
|
||||
return false;
|
||||
}
|
||||
} else {
|
||||
if (mHasHistoricalInfo && probabilityEntry.isValid()) {
|
||||
const HistoricalInfo *originalHistoricalInfo = probabilityEntry.getHistoricalInfo();
|
||||
if (DynamicLanguageModelProbabilityUtils::shouldRemoveEntryDuringGC(
|
||||
*originalHistoricalInfo)) {
|
||||
// Remove the entry.
|
||||
if (!mTrieMap.remove(entry.key(), bitmapEntryIndex)) {
|
||||
return false;
|
||||
}
|
||||
continue;
|
||||
}
|
||||
if (needsToHalveCounters) {
|
||||
const int updatedCount = originalHistoricalInfo->getCount() / 2;
|
||||
if (updatedCount == 0) {
|
||||
// Remove the entry.
|
||||
if (!mTrieMap.remove(entry.key(), bitmapEntryIndex)) {
|
||||
return false;
|
||||
}
|
||||
continue;
|
||||
}
|
||||
const HistoricalInfo historicalInfoToSave(originalHistoricalInfo->getTimestamp(),
|
||||
originalHistoricalInfo->getLevel(), updatedCount);
|
||||
const ProbabilityEntry updatedEntry(probabilityEntry.getFlags(),
|
||||
&historicalInfoToSave);
|
||||
if (!mTrieMap.put(entry.key(), updatedEntry.encode(mHasHistoricalInfo),
|
||||
bitmapEntryIndex)) {
|
||||
return false;
|
||||
}
|
||||
}
|
||||
}
|
||||
if (!probabilityEntry.representsBeginningOfSentence()) {
|
||||
outEntryCounters->incrementNgramCount(prevWordCount + 1);
|
||||
}
|
||||
if (!entry.hasNextLevelMap()) {
|
||||
continue;
|
||||
}
|
||||
if (!updateAllProbabilityEntriesForGCInner(entry.getNextLevelBitmapEntryIndex(),
|
||||
prevWordCount + 1, headerPolicy, outEntryCounters)) {
|
||||
prevWordCount + 1, headerPolicy, needsToHalveCounters, outEntryCounters)) {
|
||||
return false;
|
||||
}
|
||||
}
|
||||
|
@ -408,11 +428,11 @@ bool LanguageModelDictContent::getEntryInfo(const HeaderPolicy *const headerPoli
|
|||
}
|
||||
const ProbabilityEntry probabilityEntry =
|
||||
ProbabilityEntry::decode(entry.value(), mHasHistoricalInfo);
|
||||
const int probability = (mHasHistoricalInfo) ?
|
||||
ForgettingCurveUtils::decodeProbability(probabilityEntry.getHistoricalInfo(),
|
||||
headerPolicy) : probabilityEntry.getProbability();
|
||||
outEntryInfo->emplace_back(probability,
|
||||
probabilityEntry.getHistoricalInfo()->getTimestamp(),
|
||||
const int priority = mHasHistoricalInfo
|
||||
? DynamicLanguageModelProbabilityUtils::getPriorityToPreventFromEviction(
|
||||
*probabilityEntry.getHistoricalInfo())
|
||||
: probabilityEntry.getProbability();
|
||||
outEntryInfo->emplace_back(priority, probabilityEntry.getHistoricalInfo()->getCount(),
|
||||
entry.key(), targetLevel, prevWordIds->data());
|
||||
}
|
||||
return true;
|
||||
|
@ -420,11 +440,11 @@ bool LanguageModelDictContent::getEntryInfo(const HeaderPolicy *const headerPoli
|
|||
|
||||
bool LanguageModelDictContent::EntryInfoToTurncate::Comparator::operator()(
|
||||
const EntryInfoToTurncate &left, const EntryInfoToTurncate &right) const {
|
||||
if (left.mProbability != right.mProbability) {
|
||||
return left.mProbability < right.mProbability;
|
||||
if (left.mPriority != right.mPriority) {
|
||||
return left.mPriority < right.mPriority;
|
||||
}
|
||||
if (left.mTimestamp != right.mTimestamp) {
|
||||
return left.mTimestamp > right.mTimestamp;
|
||||
if (left.mCount != right.mCount) {
|
||||
return left.mCount < right.mCount;
|
||||
}
|
||||
if (left.mKey != right.mKey) {
|
||||
return left.mKey < right.mKey;
|
||||
|
@ -441,10 +461,9 @@ bool LanguageModelDictContent::EntryInfoToTurncate::Comparator::operator()(
|
|||
return false;
|
||||
}
|
||||
|
||||
LanguageModelDictContent::EntryInfoToTurncate::EntryInfoToTurncate(const int probability,
|
||||
const int timestamp, const int key, const int prevWordCount, const int *const prevWordIds)
|
||||
: mProbability(probability), mTimestamp(timestamp), mKey(key),
|
||||
mPrevWordCount(prevWordCount) {
|
||||
LanguageModelDictContent::EntryInfoToTurncate::EntryInfoToTurncate(const int priority,
|
||||
const int count, const int key, const int prevWordCount, const int *const prevWordIds)
|
||||
: mPriority(priority), mCount(count), mKey(key), mPrevWordCount(prevWordCount) {
|
||||
memmove(mPrevWordIds, prevWordIds, mPrevWordCount * sizeof(mPrevWordIds[0]));
|
||||
}
|
||||
|
||||
|
|
|
@ -151,13 +151,14 @@ class LanguageModelDictContent {
|
|||
const LanguageModelDictContent *const originalContent);
|
||||
|
||||
const WordAttributes getWordAttributes(const WordIdArrayView prevWordIds, const int wordId,
|
||||
const HeaderPolicy *const headerPolicy) const;
|
||||
const bool mustMatchAllPrevWords, const HeaderPolicy *const headerPolicy) const;
|
||||
|
||||
ProbabilityEntry getProbabilityEntry(const int wordId) const {
|
||||
return getNgramProbabilityEntry(WordIdArrayView(), wordId);
|
||||
}
|
||||
|
||||
bool setProbabilityEntry(const int wordId, const ProbabilityEntry *const probabilityEntry) {
|
||||
mGlobalCounters.addToTotalCount(probabilityEntry->getHistoricalInfo()->getCount());
|
||||
return setNgramProbabilityEntry(WordIdArrayView(), wordId, probabilityEntry);
|
||||
}
|
||||
|
||||
|
@ -180,8 +181,15 @@ class LanguageModelDictContent {
|
|||
|
||||
bool updateAllProbabilityEntriesForGC(const HeaderPolicy *const headerPolicy,
|
||||
MutableEntryCounters *const outEntryCounters) {
|
||||
return updateAllProbabilityEntriesForGCInner(mTrieMap.getRootBitmapEntryIndex(),
|
||||
0 /* prevWordCount */, headerPolicy, outEntryCounters);
|
||||
if (!updateAllProbabilityEntriesForGCInner(mTrieMap.getRootBitmapEntryIndex(),
|
||||
0 /* prevWordCount */, headerPolicy, mGlobalCounters.needsToHalveCounters(),
|
||||
outEntryCounters)) {
|
||||
return false;
|
||||
}
|
||||
if (mGlobalCounters.needsToHalveCounters()) {
|
||||
mGlobalCounters.halveCounters();
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
// entryCounts should be created by updateAllProbabilityEntries.
|
||||
|
@ -206,11 +214,12 @@ class LanguageModelDictContent {
|
|||
DISALLOW_ASSIGNMENT_OPERATOR(Comparator);
|
||||
};
|
||||
|
||||
EntryInfoToTurncate(const int probability, const int timestamp, const int key,
|
||||
EntryInfoToTurncate(const int priority, const int count, const int key,
|
||||
const int prevWordCount, const int *const prevWordIds);
|
||||
|
||||
int mProbability;
|
||||
int mTimestamp;
|
||||
int mPriority;
|
||||
// TODO: Remove.
|
||||
int mCount;
|
||||
int mKey;
|
||||
int mPrevWordCount;
|
||||
int mPrevWordIds[MAX_PREV_WORD_COUNT_FOR_N_GRAM + 1];
|
||||
|
@ -219,8 +228,6 @@ class LanguageModelDictContent {
|
|||
DISALLOW_DEFAULT_CONSTRUCTOR(EntryInfoToTurncate);
|
||||
};
|
||||
|
||||
// TODO: Remove
|
||||
static const int DUMMY_PROBABILITY_FOR_VALID_WORDS;
|
||||
static const int TRIE_MAP_BUFFER_INDEX;
|
||||
static const int GLOBAL_COUNTERS_BUFFER_INDEX;
|
||||
|
||||
|
@ -233,7 +240,8 @@ class LanguageModelDictContent {
|
|||
int createAndGetBitmapEntryIndex(const WordIdArrayView prevWordIds);
|
||||
int getBitmapEntryIndex(const WordIdArrayView prevWordIds) const;
|
||||
bool updateAllProbabilityEntriesForGCInner(const int bitmapEntryIndex, const int prevWordCount,
|
||||
const HeaderPolicy *const headerPolicy, MutableEntryCounters *const outEntryCounters);
|
||||
const HeaderPolicy *const headerPolicy, const bool needsToHalveCounters,
|
||||
MutableEntryCounters *const outEntryCounters);
|
||||
bool turncateEntriesInSpecifiedLevel(const HeaderPolicy *const headerPolicy,
|
||||
const int maxEntryCount, const int targetLevel, int *const outEntryCount);
|
||||
bool getEntryInfo(const HeaderPolicy *const headerPolicy, const int targetLevel,
|
||||
|
|
|
@ -63,6 +63,10 @@ class LanguageModelDictContentGlobalCounters {
|
|||
mTotalCount += 1;
|
||||
}
|
||||
|
||||
void addToTotalCount(const int count) {
|
||||
mTotalCount += count;
|
||||
}
|
||||
|
||||
void updateMaxValueOfCounters(const int count) {
|
||||
mMaxValueOfCounters = std::max(count, mMaxValueOfCounters);
|
||||
}
|
||||
|
|
|
@ -110,7 +110,7 @@ const WordAttributes Ver4PatriciaTriePolicy::getWordAttributesInContext(
|
|||
return WordAttributes();
|
||||
}
|
||||
return mBuffers->getLanguageModelDictContent()->getWordAttributes(prevWordIds, wordId,
|
||||
mHeaderPolicy);
|
||||
false /* mustMatchAllPrevWords */, mHeaderPolicy);
|
||||
}
|
||||
|
||||
int Ver4PatriciaTriePolicy::getProbabilityOfWord(const WordIdArrayView prevWordIds,
|
||||
|
@ -118,18 +118,13 @@ int Ver4PatriciaTriePolicy::getProbabilityOfWord(const WordIdArrayView prevWordI
|
|||
if (wordId == NOT_A_WORD_ID || prevWordIds.contains(NOT_A_WORD_ID)) {
|
||||
return NOT_A_PROBABILITY;
|
||||
}
|
||||
const ProbabilityEntry probabilityEntry =
|
||||
mBuffers->getLanguageModelDictContent()->getNgramProbabilityEntry(prevWordIds, wordId);
|
||||
if (!probabilityEntry.isValid() || probabilityEntry.isBlacklisted()
|
||||
|| probabilityEntry.isNotAWord()) {
|
||||
const WordAttributes wordAttributes =
|
||||
mBuffers->getLanguageModelDictContent()->getWordAttributes(prevWordIds, wordId,
|
||||
true /* mustMatchAllPrevWords */, mHeaderPolicy);
|
||||
if (wordAttributes.isBlacklisted() || wordAttributes.isNotAWord()) {
|
||||
return NOT_A_PROBABILITY;
|
||||
}
|
||||
if (mHeaderPolicy->hasHistoricalInfoOfWords()) {
|
||||
return ForgettingCurveUtils::decodeProbability(probabilityEntry.getHistoricalInfo(),
|
||||
mHeaderPolicy);
|
||||
} else {
|
||||
return probabilityEntry.getProbability();
|
||||
}
|
||||
return wordAttributes.getProbability();
|
||||
}
|
||||
|
||||
BinaryDictionaryShortcutIterator Ver4PatriciaTriePolicy::getShortcutIterator(
|
||||
|
@ -152,9 +147,7 @@ void Ver4PatriciaTriePolicy::iterateNgramEntries(const WordIdArrayView prevWordI
|
|||
continue;
|
||||
}
|
||||
const int probability = probabilityEntry.hasHistoricalInfo() ?
|
||||
ForgettingCurveUtils::decodeProbability(
|
||||
probabilityEntry.getHistoricalInfo(), mHeaderPolicy) :
|
||||
probabilityEntry.getProbability();
|
||||
0 : probabilityEntry.getProbability();
|
||||
listener->onVisitEntry(probability, entry.getWordId());
|
||||
}
|
||||
}
|
||||
|
@ -386,14 +379,17 @@ bool Ver4PatriciaTriePolicy::updateEntriesForWordWithNgramContext(
|
|||
AKLOGE("Cannot add unigarm entry in updateEntriesForWordWithNgramContext().");
|
||||
return false;
|
||||
}
|
||||
if (!isValidWord) {
|
||||
return true;
|
||||
}
|
||||
wordId = getWordId(wordCodePoints, false /* tryLowerCaseSearch */);
|
||||
}
|
||||
|
||||
WordIdArray<MAX_PREV_WORD_COUNT_FOR_N_GRAM> prevWordIdArray;
|
||||
const WordIdArrayView prevWordIds = ngramContext->getPrevWordIds(this, &prevWordIdArray,
|
||||
false /* tryLowerCaseSearch */);
|
||||
if (prevWordIds.firstOrDefault(NOT_A_WORD_ID) == NOT_A_WORD_ID
|
||||
&& ngramContext->isNthPrevWordBeginningOfSentence(1 /* n */)) {
|
||||
if (ngramContext->isNthPrevWordBeginningOfSentence(1 /* n */)) {
|
||||
if (prevWordIds.firstOrDefault(NOT_A_WORD_ID) == NOT_A_WORD_ID) {
|
||||
const UnigramProperty beginningOfSentenceUnigramProperty(
|
||||
true /* representsBeginningOfSentence */,
|
||||
true /* isNotAWord */, false /* isPossiblyOffensive */, NOT_A_PROBABILITY,
|
||||
|
@ -406,6 +402,13 @@ bool Ver4PatriciaTriePolicy::updateEntriesForWordWithNgramContext(
|
|||
// Refresh word ids.
|
||||
ngramContext->getPrevWordIds(this, &prevWordIdArray, false /* tryLowerCaseSearch */);
|
||||
}
|
||||
// Update entries for beginning of sentence.
|
||||
if (!mBuffers->getMutableLanguageModelDictContent()->updateAllEntriesOnInputWord(
|
||||
prevWordIds.skip(1 /* n */), prevWordIds[0], true /* isVaild */, historicalInfo,
|
||||
mHeaderPolicy, &mEntryCounters)) {
|
||||
return false;
|
||||
}
|
||||
}
|
||||
if (!mBuffers->getMutableLanguageModelDictContent()->updateAllEntriesOnInputWord(prevWordIds,
|
||||
wordId, updateAsAValidWord, historicalInfo, mHeaderPolicy, &mEntryCounters)) {
|
||||
return false;
|
||||
|
@ -542,7 +545,7 @@ const WordProperty Ver4PatriciaTriePolicy::getWordProperty(
|
|||
}
|
||||
}
|
||||
const WordAttributes wordAttributes = languageModelDictContent->getWordAttributes(
|
||||
WordIdArrayView(), wordId, mHeaderPolicy);
|
||||
WordIdArrayView(), wordId, true /* mustMatchAllPrevWords */, mHeaderPolicy);
|
||||
const ProbabilityEntry probabilityEntry = languageModelDictContent->getProbabilityEntry(wordId);
|
||||
const HistoricalInfo *const historicalInfo = probabilityEntry.getHistoricalInfo();
|
||||
const UnigramProperty unigramProperty(probabilityEntry.representsBeginningOfSentence(),
|
||||
|
|
|
@ -59,6 +59,7 @@ public class BinaryDictionaryDecayingTests extends AndroidTestCase {
|
|||
super.setUp();
|
||||
mCurrentTime = 0;
|
||||
mDictFilesToBeDeleted.clear();
|
||||
setCurrentTimeForTestMode(mCurrentTime);
|
||||
}
|
||||
|
||||
@Override
|
||||
|
@ -71,8 +72,8 @@ public class BinaryDictionaryDecayingTests extends AndroidTestCase {
|
|||
super.tearDown();
|
||||
}
|
||||
|
||||
private static boolean supportsBeginningOfSentence(final int formatVersion) {
|
||||
return formatVersion > FormatSpec.VERSION401;
|
||||
private static boolean supportsCountBasedNgram(final int formatVersion) {
|
||||
return formatVersion >= FormatSpec.VERSION4_DEV;
|
||||
}
|
||||
|
||||
private static boolean supportsNgram(final int formatVersion) {
|
||||
|
@ -142,9 +143,6 @@ public class BinaryDictionaryDecayingTests extends AndroidTestCase {
|
|||
|
||||
private File createEmptyDictionaryWithAttributeMapAndGetFile(final int formatVersion,
|
||||
final HashMap<String, String> attributeMap) {
|
||||
if (formatVersion == FormatSpec.VERSION4
|
||||
|| formatVersion == FormatSpec.VERSION4_ONLY_FOR_TESTING
|
||||
|| formatVersion == FormatSpec.VERSION4_DEV) {
|
||||
try {
|
||||
final File dictFile = createEmptyVer4DictionaryAndGetFile(formatVersion,
|
||||
attributeMap);
|
||||
|
@ -153,9 +151,6 @@ public class BinaryDictionaryDecayingTests extends AndroidTestCase {
|
|||
} catch (final IOException e) {
|
||||
fail(e.toString());
|
||||
}
|
||||
} else {
|
||||
fail("Dictionary format version " + formatVersion + " is not supported.");
|
||||
}
|
||||
return null;
|
||||
}
|
||||
|
||||
|
@ -263,12 +258,10 @@ public class BinaryDictionaryDecayingTests extends AndroidTestCase {
|
|||
onInputWord(binaryDictionary, "a", false /* isValidWord */);
|
||||
assertTrue(binaryDictionary.isValidWord("a"));
|
||||
|
||||
onInputWord(binaryDictionary, "b", true /* isValidWord */);
|
||||
assertTrue(binaryDictionary.isValidWord("b"));
|
||||
|
||||
onInputWordWithPrevWord(binaryDictionary, "b", false /* isValidWord */, "a");
|
||||
assertFalse(isValidBigram(binaryDictionary, "a", "b"));
|
||||
onInputWordWithPrevWord(binaryDictionary, "b", false /* isValidWord */, "a");
|
||||
assertTrue(binaryDictionary.isValidWord("b"));
|
||||
assertTrue(isValidBigram(binaryDictionary, "a", "b"));
|
||||
|
||||
onInputWordWithPrevWord(binaryDictionary, "c", true /* isValidWord */, "a");
|
||||
|
@ -284,16 +277,12 @@ public class BinaryDictionaryDecayingTests extends AndroidTestCase {
|
|||
return;
|
||||
}
|
||||
|
||||
onInputWordWithPrevWords(binaryDictionary, "c", false /* isValidWord */, "b", "a");
|
||||
assertFalse(isValidTrigram(binaryDictionary, "a", "b", "c"));
|
||||
assertFalse(isValidBigram(binaryDictionary, "b", "c"));
|
||||
onInputWordWithPrevWords(binaryDictionary, "c", false /* isValidWord */, "b", "a");
|
||||
onInputWordWithPrevWords(binaryDictionary, "c", true /* isValidWord */, "b", "a");
|
||||
assertTrue(isValidTrigram(binaryDictionary, "a", "b", "c"));
|
||||
assertTrue(isValidBigram(binaryDictionary, "b", "c"));
|
||||
|
||||
onInputWordWithPrevWords(binaryDictionary, "d", true /* isValidWord */, "b", "a");
|
||||
assertTrue(isValidTrigram(binaryDictionary, "a", "b", "d"));
|
||||
assertTrue(isValidBigram(binaryDictionary, "b", "d"));
|
||||
onInputWordWithPrevWords(binaryDictionary, "d", false /* isValidWord */, "c", "b");
|
||||
assertFalse(isValidTrigram(binaryDictionary, "b", "c", "d"));
|
||||
assertFalse(isValidBigram(binaryDictionary, "c", "d"));
|
||||
|
||||
onInputWordWithPrevWords(binaryDictionary, "cd", true /* isValidWord */, "b", "a");
|
||||
assertTrue(isValidTrigram(binaryDictionary, "a", "b", "cd"));
|
||||
|
@ -312,6 +301,13 @@ public class BinaryDictionaryDecayingTests extends AndroidTestCase {
|
|||
onInputWord(binaryDictionary, "a", true /* isValidWord */);
|
||||
assertTrue(binaryDictionary.isValidWord("a"));
|
||||
forcePassingShortTime(binaryDictionary);
|
||||
if (supportsCountBasedNgram(formatVersion)) {
|
||||
// Count based ngram language model doesn't support decaying based on the elapsed time.
|
||||
assertTrue(binaryDictionary.isValidWord("a"));
|
||||
} else {
|
||||
assertFalse(binaryDictionary.isValidWord("a"));
|
||||
}
|
||||
forcePassingLongTime(binaryDictionary);
|
||||
assertFalse(binaryDictionary.isValidWord("a"));
|
||||
|
||||
onInputWord(binaryDictionary, "a", true /* isValidWord */);
|
||||
|
@ -327,6 +323,12 @@ public class BinaryDictionaryDecayingTests extends AndroidTestCase {
|
|||
onInputWordWithPrevWord(binaryDictionary, "b", true /* isValidWord */, "a");
|
||||
assertTrue(isValidBigram(binaryDictionary, "a", "b"));
|
||||
forcePassingShortTime(binaryDictionary);
|
||||
if (supportsCountBasedNgram(formatVersion)) {
|
||||
assertTrue(isValidBigram(binaryDictionary, "a", "b"));
|
||||
} else {
|
||||
assertFalse(isValidBigram(binaryDictionary, "a", "b"));
|
||||
}
|
||||
forcePassingLongTime(binaryDictionary);
|
||||
assertFalse(isValidBigram(binaryDictionary, "a", "b"));
|
||||
|
||||
onInputWord(binaryDictionary, "a", true /* isValidWord */);
|
||||
|
@ -349,7 +351,7 @@ public class BinaryDictionaryDecayingTests extends AndroidTestCase {
|
|||
onInputWordWithPrevWord(binaryDictionary, "bc", true /* isValidWord */, "ab");
|
||||
onInputWordWithPrevWords(binaryDictionary, "cd", true /* isValidWord */, "bc", "ab");
|
||||
assertTrue(isValidTrigram(binaryDictionary, "ab", "bc", "cd"));
|
||||
forcePassingShortTime(binaryDictionary);
|
||||
forcePassingLongTime(binaryDictionary);
|
||||
assertFalse(isValidTrigram(binaryDictionary, "ab", "bc", "cd"));
|
||||
|
||||
onInputWord(binaryDictionary, "ab", true /* isValidWord */);
|
||||
|
@ -540,7 +542,7 @@ public class BinaryDictionaryDecayingTests extends AndroidTestCase {
|
|||
assertTrue(bigramCountBeforeGC > bigramCountAfterGC);
|
||||
}
|
||||
}
|
||||
|
||||
forcePassingShortTime(binaryDictionary);
|
||||
assertTrue(Integer.parseInt(binaryDictionary.getPropertyForGettingStats(
|
||||
BinaryDictionary.BIGRAM_COUNT_QUERY)) > 0);
|
||||
assertTrue(Integer.parseInt(binaryDictionary.getPropertyForGettingStats(
|
||||
|
@ -666,14 +668,17 @@ public class BinaryDictionaryDecayingTests extends AndroidTestCase {
|
|||
assertEquals(toFormatVersion, binaryDictionary.getFormatVersion());
|
||||
assertTrue(binaryDictionary.isValidWord("aaa"));
|
||||
assertFalse(binaryDictionary.isValidWord("bbb"));
|
||||
if (supportsCountBasedNgram(toFormatVersion)) {
|
||||
assertTrue(binaryDictionary.getFrequency("aaa") < binaryDictionary.getFrequency("ccc"));
|
||||
onInputWord(binaryDictionary, "bbb", false /* isValidWord */);
|
||||
assertTrue(binaryDictionary.isValidWord("bbb"));
|
||||
}
|
||||
assertTrue(isValidBigram(binaryDictionary, "aaa", "abc"));
|
||||
assertFalse(isValidBigram(binaryDictionary, "aaa", "bbb"));
|
||||
if (supportsCountBasedNgram(toFormatVersion)) {
|
||||
onInputWordWithPrevWord(binaryDictionary, "bbb", false /* isValidWord */, "aaa");
|
||||
assertTrue(isValidBigram(binaryDictionary, "aaa", "bbb"));
|
||||
|
||||
}
|
||||
if (supportsNgram(toFormatVersion)) {
|
||||
assertTrue(isValidTrigram(binaryDictionary, "aaa", "abc", "xyz"));
|
||||
assertFalse(isValidTrigram(binaryDictionary, "aaa", "abc", "def"));
|
||||
|
@ -686,11 +691,9 @@ public class BinaryDictionaryDecayingTests extends AndroidTestCase {
|
|||
|
||||
public void testBeginningOfSentence() {
|
||||
for (final int formatVersion : DICT_FORMAT_VERSIONS) {
|
||||
if (supportsBeginningOfSentence(formatVersion)) {
|
||||
testBeginningOfSentence(formatVersion);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
private void testBeginningOfSentence(final int formatVersion) {
|
||||
setCurrentTimeForTestMode(mCurrentTime);
|
||||
|
@ -716,10 +719,8 @@ public class BinaryDictionaryDecayingTests extends AndroidTestCase {
|
|||
assertFalse(binaryDictionary.isValidNgram(beginningOfSentenceContext, "aaa"));
|
||||
assertFalse(binaryDictionary.isValidNgram(beginningOfSentenceContext, "bbb"));
|
||||
onInputWordWithBeginningOfSentenceContext(binaryDictionary, "aaa", true /* isValidWord */);
|
||||
assertFalse(binaryDictionary.isValidNgram(beginningOfSentenceContext, "aaa"));
|
||||
onInputWordWithBeginningOfSentenceContext(binaryDictionary, "aaa", true /* isValidWord */);
|
||||
onInputWordWithBeginningOfSentenceContext(binaryDictionary, "bbb", true /* isValidWord */);
|
||||
assertFalse(binaryDictionary.isValidNgram(beginningOfSentenceContext, "bbb"));
|
||||
onInputWordWithBeginningOfSentenceContext(binaryDictionary, "bbb", true /* isValidWord */);
|
||||
assertTrue(binaryDictionary.isValidNgram(beginningOfSentenceContext, "aaa"));
|
||||
assertTrue(binaryDictionary.isValidNgram(beginningOfSentenceContext, "bbb"));
|
||||
|
|
Loading…
Reference in New Issue