commit e5daf6608affeb5be000c1c5dad69772ec247a6e
author Satoshi Kataoka <satok@google.com> Wed May 01 18:37:23 2013 -0700
committer Android Git Automerger <android-git-automerger@android.com> Wed May 01 18:37:23 2013 -0700
tree 077210a74323ccdeaa5d6f18ee3ae48d4d38e3e3
parent ace3f3c5d56f5b4a58e8dc400fec1bb8c7b17a63
parent 6845427e5d48fe48f837cd96a52c209be5f40357

am 6845427e: DO NOT MERGE: Return possible suggestions in Google Spell Checker

* commit '6845427e5d48fe48f837cd96a52c209be5f40357':
  DO NOT MERGE: Return possible suggestions in Google Spell Checker

java/src/com/android/inputmethod/latin/BinaryDictionary.java

diff --git a/java/src/com/android/inputmethod/latin/BinaryDictionary.java b/java/src/com/android/inputmethod/latin/BinaryDictionary.java
index 18e7122..dbc2b90 100644
--- a/java/src/com/android/inputmethod/latin/BinaryDictionary.java
+++ b/java/src/com/android/inputmethod/latin/BinaryDictionary.java
@@ -141,7 +141,6 @@
                 mOutputTypes);
         final ArrayList<SuggestedWordInfo> suggestions = CollectionUtils.newArrayList();
         for (int j = 0; j < count; ++j) {
-            if (composerSize > 0 && mOutputScores[j] < 1) break;
             final int start = j * MAX_WORD_LENGTH;
             int len = 0;
             while (len < MAX_WORD_LENGTH && mOutputCodePoints[start + len] != 0) {

java/src/com/android/inputmethod/latin/spellcheck/AndroidSpellCheckerService.java

diff --git a/java/src/com/android/inputmethod/latin/spellcheck/AndroidSpellCheckerService.java b/java/src/com/android/inputmethod/latin/spellcheck/AndroidSpellCheckerService.java
index 2d0a89b..1667059 100644
--- a/java/src/com/android/inputmethod/latin/spellcheck/AndroidSpellCheckerService.java
+++ b/java/src/com/android/inputmethod/latin/spellcheck/AndroidSpellCheckerService.java
@@ -267,16 +267,7 @@
                 return true;
             }
 
-            // Compute the normalized score and skip this word if it's normalized score does not
-            // make the threshold.
             final String wordString = new String(word, wordOffset, wordLength);
-            final float normalizedScore =
-                    BinaryDictionary.calcNormalizedScore(mOriginalText, wordString, score);
-            if (normalizedScore < mSuggestionThreshold) {
-                if (DBG) Log.i(TAG, wordString + " does not make the score threshold");
-                return true;
-            }
-
             if (mLength < mMaxLength) {
                 final int copyLen = mLength - insertIndex;
                 ++mLength;