diff options
| author |   Jean Chalard <jchalard@google.com> | 2012-10-18 07:28:18 +0900 |
|---|---|---|
| committer | Jean Chalard <jchalard@google.com> | 2012-10-18 07:28:18 +0900 |
| commit | d03e065b861bd1cdb90bc70f18b7d7a3815b7a4d (patch) | |
| tree | 77f1024d89bd41735a24096bc666362e6453fddd | |
| parent | dbba676c00cd5479e292a91c5672d920b9137759 (diff) | |
| download | latinime-d03e065b861bd1cdb90bc70f18b7d7a3815b7a4d.tar.gz latinime-d03e065b861bd1cdb90bc70f18b7d7a3815b7a4d.tar.xz latinime-d03e065b861bd1cdb90bc70f18b7d7a3815b7a4d.zip | |
Don't consider non-words for split word suggestion
Bug: 7368683
Change-Id: Iecd8348be788e5a749dafabdf7eddc4a14d901e0
| -rw-r--r-- | native/jni/src/unigram_dictionary.cpp | 3 |
1 files changed, 2 insertions, 1 deletions
diff --git a/native/jni/src/unigram_dictionary.cpp b/native/jni/src/unigram_dictionary.cpp index 49d044fbc..e3649bd4b 100644 --- a/native/jni/src/unigram_dictionary.cpp +++ b/native/jni/src/unigram_dictionary.cpp @@ -798,7 +798,8 @@ int UnigramDictionary::getMostFrequentWordLikeInner(const uint16_t *const inWord // into inputIndex if there is a match. const bool isAlike = testCharGroupForContinuedLikeness(flags, root, pos, inWord, inputIndex, inputSize, newWord, &inputIndex, &pos); - if (isAlike && (BinaryFormat::FLAG_IS_TERMINAL & flags) && (inputIndex == inputSize)) { + if (isAlike && (!(BinaryFormat::FLAG_IS_NOT_A_WORD & flags)) + && (BinaryFormat::FLAG_IS_TERMINAL & flags) && (inputIndex == inputSize)) { const int frequency = BinaryFormat::readFrequencyWithoutMovingPointer(root, pos); onTerminalWordLike(frequency, newWord, inputIndex, outWord, &maxFreq); } |