| /packages/inputmethods/LatinIME/tools/dicttool/src/com/android/inputmethod/latin/dicttool/ |
| Info.java | 93 final ArrayList<WeightedString> bigrams = ptNode.getBigrams(); local
94 if (null == bigrams || bigrams.isEmpty()) {
95 System.out.println(" No bigrams");
97 for (final WeightedString bigram : bigrams) {
|
| CombinedInputOutput.java | 101 ArrayList<WeightedString> bigrams = new ArrayList<>(); local
110 for (WeightedString s : bigrams) {
115 if (!bigrams.isEmpty()) bigrams = new ArrayList<>();
185 bigrams.add(new WeightedString(secondWordOfBigram, bigramProbabilityInfo));
193 for (WeightedString s : bigrams) {
|
| /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/makedict/ |
| Ver2DictDecoder.java | 80 final ArrayList<PendingAttribute> bigrams, final int baseAddress) {
103 throw new RuntimeException("Has bigrams with no address");
105 bigrams.add(new PendingAttribute(
239 final ArrayList<PendingAttribute> bigrams; local
241 bigrams = new ArrayList<>();
242 addressPointer += PtNodeReader.readBigramAddresses(mDictBuffer, bigrams,
244 if (bigrams.size() >= FormatSpec.MAX_BIGRAMS_IN_A_PTNODE) {
245 throw new RuntimeException("Too many bigrams in a PtNode (" + bigrams.size()
249 bigrams = null
[all...] |
| BinaryDictIOUtils.java | 90 final Map<Integer, ArrayList<PendingAttribute>> bigrams) {
129 bigrams.put(ptNodeInfo.mOriginalAddress, ptNodeInfo.mBigrams);
148 * Reads unigrams and bigrams from the binary file.
154 * @param bigrams the map to store the address as a key and the list of address as a value.
160 final Map<Integer, ArrayList<PendingAttribute>> bigrams) throws IOException,
165 frequencies, bigrams);
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/structure/backward/v402/ |
| ver4_patricia_trie_policy.cpp | 449 std::vector<BigramProperty> bigrams; local
480 bigrams.emplace_back(&word1, probability,
506 return WordProperty(&codePointVector, &unigramProperty, &bigrams);
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/structure/v2/ |
| patricia_trie_policy.cpp | 229 AKLOGE("Cannot skip bigrams. BufSize: %d, pos: %d.", mDictBufferSize,
253 AKLOGE("Cannot skip bigrams. BufSize: %d, pos: %d.", mDictBufferSize, pos);
286 // Due to space constraints, the probability for bigrams is approximate - the lower the unigram
289 // that sometimes, we'll see some bigrams interverted here, but it can't get too bad.
393 std::vector<BigramProperty> bigrams; local
409 bigrams.emplace_back(&word1, probability,
436 return WordProperty(&codePointVector, &unigramProperty, &bigrams);
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/structure/v4/ |
| ver4_patricia_trie_policy.cpp | 461 std::vector<BigramProperty> bigrams; local
492 bigrams.emplace_back(&word1, probability,
518 return WordProperty(&codePointVector, &unigramProperty, &bigrams);
|
| /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/ |
| BinaryDictionaryTests.java | 870 final HashSet<Pair<String, String>> bigrams = new HashSet<>(); local
1004 final HashMap<String, HashSet<String>> bigrams = new HashMap<>(); local
1107 final HashMap<String, HashSet<String>> bigrams = new HashMap<>(); local
1396 final ArrayList<Pair<String, String>> bigrams = new ArrayList<>(); local
[all...] |
| BinaryDictionaryDecayingTests.java | 245 // Add bigrams of not valid unigrams.
461 final ArrayList<Pair<String, String>> bigrams = new ArrayList<>(); local
476 bigrams.add(bigram);
482 final Pair<String, String> bigram = bigrams.get(random.nextInt(bigrams.size()));
[all...] |
