Supress overflow at mulitplying demotion rate
Change-Id: I2003c5f88a5062b11e2f21522095bb94b1eb4efdmain
parent
61e2f85e3f
commit
f7425bb15b
|
@ -269,6 +269,14 @@ void UnigramDictionary::getSuggestionCandidates(const int skipPos,
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
inline static void multiplyRate(const int rate, int *freq) {
|
||||||
|
if (rate > 1000000) {
|
||||||
|
*freq = (*freq / 100) * rate;
|
||||||
|
} else {
|
||||||
|
*freq = *freq * rate / 100;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
bool UnigramDictionary::getMissingSpaceWords(const int inputLength, const int missingSpacePos) {
|
bool UnigramDictionary::getMissingSpaceWords(const int inputLength, const int missingSpacePos) {
|
||||||
if (missingSpacePos <= 0 || missingSpacePos >= inputLength
|
if (missingSpacePos <= 0 || missingSpacePos >= inputLength
|
||||||
|| inputLength >= MAX_WORD_LENGTH) return false;
|
|| inputLength >= MAX_WORD_LENGTH) return false;
|
||||||
|
@ -294,7 +302,7 @@ bool UnigramDictionary::getMissingSpaceWords(const int inputLength, const int mi
|
||||||
|
|
||||||
int pairFreq = ((firstFreq + secondFreq) / 2);
|
int pairFreq = ((firstFreq + secondFreq) / 2);
|
||||||
for (int i = 0; i < inputLength; ++i) pairFreq *= TYPED_LETTER_MULTIPLIER;
|
for (int i = 0; i < inputLength; ++i) pairFreq *= TYPED_LETTER_MULTIPLIER;
|
||||||
pairFreq = pairFreq * WORDS_WITH_MISSING_SPACE_CHARACTER_DEMOTION_RATE / 100;
|
multiplyRate(WORDS_WITH_MISSING_SPACE_CHARACTER_DEMOTION_RATE, &pairFreq);
|
||||||
addWord(word, newWordLength, pairFreq);
|
addWord(word, newWordLength, pairFreq);
|
||||||
return true;
|
return true;
|
||||||
}
|
}
|
||||||
|
@ -345,14 +353,13 @@ inline int UnigramDictionary::calculateFinalFreq(const int inputIndex, const int
|
||||||
const bool sameLength) {
|
const bool sameLength) {
|
||||||
// TODO: Demote by edit distance
|
// TODO: Demote by edit distance
|
||||||
int finalFreq = freq * snr;
|
int finalFreq = freq * snr;
|
||||||
if (skipPos >= 0) finalFreq = finalFreq * WORDS_WITH_MISSING_CHARACTER_DEMOTION_RATE / 100;
|
if (skipPos >= 0) multiplyRate(WORDS_WITH_MISSING_CHARACTER_DEMOTION_RATE, &finalFreq);
|
||||||
if (transposedPos >= 0) finalFreq = finalFreq
|
if (transposedPos >= 0) multiplyRate(
|
||||||
* WORDS_WITH_TRANSPOSED_CHARACTERS_DEMOTION_RATE / 100;
|
WORDS_WITH_TRANSPOSED_CHARACTERS_DEMOTION_RATE, &finalFreq);
|
||||||
if (excessivePos >= 0) {
|
if (excessivePos >= 0) {
|
||||||
finalFreq = finalFreq * WORDS_WITH_EXCESSIVE_CHARACTER_DEMOTION_RATE / 100;
|
multiplyRate(WORDS_WITH_EXCESSIVE_CHARACTER_DEMOTION_RATE, &finalFreq);
|
||||||
if (!existsAdjacentProximityChars(inputIndex, mInputLength)) {
|
if (!existsAdjacentProximityChars(inputIndex, mInputLength)) {
|
||||||
finalFreq = finalFreq
|
multiplyRate(WORDS_WITH_EXCESSIVE_CHARACTER_OUT_OF_PROXIMITY_DEMOTION_RATE, &finalFreq);
|
||||||
* WORDS_WITH_EXCESSIVE_CHARACTER_OUT_OF_PROXIMITY_DEMOTION_RATE / 100;
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
if (sameLength && skipPos < 0) finalFreq *= FULL_WORD_MULTIPLIER;
|
if (sameLength && skipPos < 0) finalFreq *= FULL_WORD_MULTIPLIER;
|
||||||
|
|
Loading…
Reference in New Issue