| /packages/inputmethods/LatinIME/tests/data/ |
| bigramlist.xml | 21 <bigrams>
36 </bigrams>
|
| /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/makedict/ |
| PtNodeInfo.java | 37 final ArrayList<PendingAttribute> bigrams) {
45 mBigrams = bigrams;
|
| 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...] |
| BinaryDictDecoderEncoderTests.java | 158 final SparseArray<List<Integer>> bigrams) {
159 for (int i = 0; i < bigrams.size(); ++i) {
160 final int w1 = bigrams.keyAt(i);
161 for (int w2 : bigrams.valueAt(i)) {
199 final SparseArray<List<Integer>> bigrams,
210 for (int i = 0; i < bigrams.size(); ++i) {
211 final int w1 = bigrams.keyAt(i);
212 for (final int w2 : bigrams.valueAt(i)) {
243 final SparseArray<List<Integer>> bigrams,
260 checkDictionary(dict, words, bigrams, shortcutMap)
[all...] |
| FusionDictionary.java | 69 * PtNode is a group of characters, with probability information, shortcut targets, bigrams,
79 * shortcuts and/or bigrams, but a non-terminal may not. Moreover, children, if present,
104 final ArrayList<WeightedString> bigrams, final ProbabilityInfo probabilityInfo,
110 mBigrams = bigrams;
117 final ArrayList<WeightedString> bigrams, final ProbabilityInfo probabilityInfo,
123 mBigrams = bigrams;
217 * Returns null if the word is not in the bigrams list.
240 final ArrayList<WeightedString> bigrams,
260 if (bigrams != null) {
262 mBigrams = bigrams;
[all...] |
| AbstractDictDecoder.java | 46 final TreeMap<Integer, ArrayList<PendingAttribute>> bigrams)
51 BinaryDictIOUtils.readUnigramsAndBigramsBinary(this, words, frequencies, bigrams);
|
| 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);
|
| Ver2DictEncoder.java | 200 * @param bigrams the bigram attributes list.
203 private void writeBigrams(final ArrayList<WeightedString> bigrams,
205 if (bigrams == null) return;
207 final Iterator<WeightedString> bigramIterator = bigrams.iterator();
|
| DictDecoder.java | 79 * Reads unigrams and bigrams from the binary file.
84 * @param bigrams the map to store the address as a key and the list of address as a value.
91 final TreeMap<Integer, ArrayList<PendingAttribute>> bigrams)
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/dictionary/ |
| bloom_filter.h | 53 // Size, in bits, of the bloom filter index for bigrams
55 // where k is the number of hash functions, n the number of bigrams, and m the number of
57 // At the moment 100 is the maximum number of bigrams for a word with the current main
|
| multi_bigram_map.cpp | 26 // usage. Also, there are diminishing returns since the most frequently used bigrams are
28 // that these bigrams are reset for each new composing word.
31 // Most common previous word contexts currently have 100 bigrams
35 // Also caches the bigrams if there is space remaining and they have not been cached already.
|
| multi_bigram_map.h | 32 // algorithm needs to look up the set of bigrams for every word pair that occurs in every
40 // Also caches the bigrams if there is space remaining and they have not been cached already.
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/policy/ |
| dictionary_bigrams_structure_policy.h | 25 * This class abstracts structure of bigrams.
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/dictionary/property/ |
| word_property.h | 38 const std::vector<BigramProperty> *const bigrams)
39 : mCodePoints(*codePoints), mUnigramProperty(*unigramProperty), mBigrams(*bigrams) {}
|
| word_property.cpp | 44 // Output bigrams.
|
| /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) {
|
| DictionaryMaker.java | 102 throw new RuntimeException("Separate bigrams/shortcut files are only supported"
103 + " with XML input (other formats include bigrams and shortcuts already)");
131 + "[-s <unigrams.xml> [-b <bigrams.xml>] [-c <shortcuts_and_whitelist.xml>] "
138 + " Source can be an XML file, with an optional XML bigrams file, or a\n"
306 * @param bigramXmlFilename the name of the bigram XML file. Pass null if there are no bigrams.
319 final BufferedInputStream bigrams = getBufferedFileInputStream(bigramXmlFilename);
321 return XmlDictInputOutput.readDictionaryXml(unigrams, shortcuts, bigrams);
|
| XmlDictInputOutput.java | 284 * @param bigrams the file to read the bigrams from, or null.
288 final BufferedInputStream shortcuts, final BufferedInputStream bigrams)
294 if (null != bigrams) parser.parse(bigrams, bigramHandler);
321 * which has no support for bigrams or shortcuts/whitelist.
332 * The output format is the "second" format, which supports bigrams and shortcuts/whitelist.
|
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/makedict/ |
| WordProperty.java | 49 final ArrayList<WeightedString> bigrams,
54 mBigrams = bigrams;
58 mHasBigrams = bigrams != null && !bigrams.isEmpty();
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/dicnode/ |
| dic_node_utils.h | 47 // Max number of bigrams to look up
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/structure/pt_common/bigram/ |
| bigram_list_read_write_utils.h | 45 // Bigrams reading methods
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/structure/backward/v402/bigram/ |
| ver4_bigram_list_policy.cpp | 64 // 1. The word has no bigrams yet.
65 // 2. The word has bigrams, and there is the target in the list.
66 // 3. The word has bigrams, and there is an invalid entry that can be reclaimed.
67 // 4. The word has bigrams. We have to append new bigram entry to the list.
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/structure/v4/bigram/ |
| ver4_bigram_list_policy.cpp | 54 // 1. The word has no bigrams yet.
55 // 2. The word has bigrams, and there is the target in the list.
56 // 3. The word has bigrams, and there is an invalid entry that can be reclaimed.
57 // 4. The word has bigrams. We have to append new bigram entry to the list.
|
| /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...] |
