Searched defs:word1 (Results 1 - 12 of 12) sorted by relevance

/packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/EN/
H A DUserDictionaryToolsListEN.java71 public int compare(WnnWord word1, WnnWord word2) { argument
72 return word1.stroke.compareTo(word2.stroke);
/packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/JAJP/
H A DUserDictionaryToolsListJAJP.java68 public int compare(WnnWord word1, WnnWord word2) { argument
69 return word1.stroke.compareTo(word2.stroke);
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/
H A DUserHistoryDictionaryBigramList.java44 public void addBigram(String word1, String word2) { argument
45 addBigram(word1, word2, FORGETTING_CURVE_INITIAL_VALUE);
51 public void addBigram(String word1, String word2, byte fcValue) { argument
53 Log.d(TAG, "--- add bigram: " + word1 + ", " + word2 + ", " + fcValue);
56 if (mBigramMap.containsKey(word1)) {
57 map = mBigramMap.get(word1);
60 mBigramMap.put(word1, map);
71 public void updateBigram(String word1, String word2, byte fcValue) { argument
73 Log.d(TAG, "--- update bigram: " + word1 + ", " + word2 + ", " + fcValue);
76 if (mBigramMap.containsKey(word1)) {
99 getBigrams(String word1) argument
107 removeBigram(String word1, String word2) argument
[all...]
H A DExpandableBinaryDictionary.java237 protected boolean isValidBigram(final CharSequence word1, final CharSequence word2) { argument
239 return mBinaryDictionary.isValidBigram(word1, word2);
242 protected boolean isValidBigramInner(final CharSequence word1, final CharSequence word2) { argument
245 return isValidBigramLocked(word1, word2);
253 protected boolean isValidBigramLocked(final CharSequence word1, final CharSequence word2) { argument
255 return mBinaryDictionary.isValidBigram(word1, word2);
H A DUserHistoryDictIOUtils.java47 public void setBigram(final String word1, final String word2, final int frequency); argument
51 public int getFrequency(final String word1, final String word2); argument
138 for (final String word1 : bigrams.keySet()) {
139 final HashMap<String, Byte> word1Bigrams = bigrams.getBigrams(word1);
141 final int freq = dict.getFrequency(word1, word2);
147 if (word1 == null) {
150 Log.d(TAG, "add bigram: " + word1
155 if (word1 == null) { // unigram
158 if (FusionDictionary.findWordInTree(fusionDict.mRoot, word1) == null) {
159 fusionDict.add(word1,
[all...]
H A DUserHistoryDictionary.java148 public int addToUserHistory(final String word1, String word2, boolean isValid) { argument
150 (word1 != null && word1.length() >= BinaryDictionary.MAX_WORD_LENGTH)) {
159 if (word2.equals(word1)) {
163 if (null == word1) {
167 word1, word2, new ForgettingCurveParams(isValid));
169 mBigramList.addBigram(word1, word2);
178 public boolean cancelAddingUserHistory(String word1, String word2) { argument
181 if (mBigramList.removeBigram(word1, word2)) {
182 return super.removeBigram(word1, word
363 getFrequency(String word1, String word2) argument
393 forceAddWordForTest(final String word1, final String word2, final boolean isValid) argument
[all...]
H A DBinaryDictionary.java113 private native boolean isValidBigramNative(long dict, int[] word1, int[] word2); argument
210 public boolean isValidBigram(CharSequence word1, CharSequence word2) { argument
211 if (TextUtils.isEmpty(word1) || TextUtils.isEmpty(word2)) return false;
212 int[] chars1 = StringUtils.toCodePointArray(word1.toString());
H A DExpandableDictionary.java323 protected boolean removeBigram(String word1, String word2) { argument
324 // Refer to addOrSetBigram() about word1.toLowerCase()
325 final Node firstWord = searchWord(mRoots, word1.toLowerCase(), 0, null);
354 protected NextWord getBigramWord(String word1, String word2) { argument
355 // Refer to addOrSetBigram() about word1.toLowerCase()
356 final Node firstWord = searchWord(mRoots, word1.toLowerCase(), 0, null);
527 public int setBigramAndGetFrequency(String word1, String word2, int frequency) { argument
528 return setBigramAndGetFrequency(word1, word2, frequency, null /* unused */);
531 public int setBigramAndGetFrequency(String word1, String word2, ForgettingCurveParams fcp) { argument
532 return setBigramAndGetFrequency(word1, word
543 setBigramAndGetFrequency( String word1, String word2, int frequency, ForgettingCurveParams fcp) argument
[all...]
/packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/
H A DUserHistoryDictIOUtilsTests.java55 public int getFrequency(String word1, String word2) { argument
56 if (word1 == null) return UNIGRAM_FREQUENCY;
69 private void addBigram(final String word1, final String word2, argument
71 addWord(word1, addedWords);
73 addedWords.get(word1).add(word2);
76 private void addBigramToBigramList(final String word1, final String word2, argument
79 bigramList.addBigram(null, word1);
80 bigramList.addBigram(word1, word2);
82 addBigram(word1, word2, addedWords);
218 public void setBigram(final String word1, fina
[all...]
/packages/inputmethods/LatinIME/native/jni/src/
H A Dbigram_dictionary.cpp209 bool BigramDictionary::isValidBigram(const int32_t *word1, int length1, const int32_t *word2, argument
212 int pos = getBigramListPositionForWord(word1, length1, false /* forceLowerCaseSearch */);
H A Ddictionary.cpp97 bool Dictionary::isValidBigram(const int32_t *word1, int length1, const int32_t *word2, argument
99 return mBigramDictionary->isValidBigram(word1, length1, word2, length2);
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/makedict/
H A DFusionDictionary.java350 * @param word1 the previous word of the context
354 public void setBigram(final String word1, final String word2, final int frequency) { argument
355 CharGroup charGroup = findWordInTree(mRoot, word1);

Completed in 110 milliseconds