FusionDictionary.java revision 44c64f46a143623dd793facd889c8d6eab5e230c
1bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard/* 2bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Copyright (C) 2011 The Android Open Source Project 3bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 4bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Licensed under the Apache License, Version 2.0 (the "License"); you may not 5bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * use this file except in compliance with the License. You may obtain a copy of 6bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * the License at 7bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 8bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * http://www.apache.org/licenses/LICENSE-2.0 9bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 10bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Unless required by applicable law or agreed to in writing, software 11bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT 12bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the 13bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * License for the specific language governing permissions and limitations under 14bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * the License. 15bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 16bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 17cdc51fc6afc7fd374c5c9eeb0539cae5cf1de724Tom Ouyangpackage com.android.inputmethod.latin.makedict; 18bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 19bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalardimport java.util.ArrayList; 20bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalardimport java.util.Arrays; 21bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalardimport java.util.Collections; 22c734c2aca1830643d169fd292e0c9d4d9306af5aJean Chalardimport java.util.HashMap; 23bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalardimport java.util.Iterator; 24bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalardimport java.util.LinkedList; 25bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 26bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard/** 27bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * A dictionary that can fusion heads and tails of words for more compression. 28bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 29bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalardpublic class FusionDictionary implements Iterable<Word> { 30bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 31bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 32bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * A node of the dictionary, containing several CharGroups. 33bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 34bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * A node is but an ordered array of CharGroups, which essentially contain all the 35bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * real information. 36bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * This class also contains fields to cache size and address, to help with binary 37bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * generation. 38bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 39bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public static class Node { 40bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard ArrayList<CharGroup> mData; 41bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // To help with binary generation 42bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard int mCachedSize; 43bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard int mCachedAddress; 44bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public Node() { 45bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mData = new ArrayList<CharGroup>(); 46bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mCachedSize = Integer.MIN_VALUE; 47bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mCachedAddress = Integer.MIN_VALUE; 48bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 49bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public Node(ArrayList<CharGroup> data) { 50bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mData = data; 51bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mCachedSize = Integer.MIN_VALUE; 52bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mCachedAddress = Integer.MIN_VALUE; 53bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 54bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 55bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 56bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 57bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * A string with a frequency. 58bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 59bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * This represents an "attribute", that is either a bigram or a shortcut. 60bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 61bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public static class WeightedString { 62bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final String mWord; 637cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang int mFrequency; 64bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public WeightedString(String word, int frequency) { 65bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mWord = word; 66bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mFrequency = frequency; 67bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 689f0ea52a5db9710df6bef4672d8e193c48451df0Ken Wakasa 699f0ea52a5db9710df6bef4672d8e193c48451df0Ken Wakasa @Override 709f0ea52a5db9710df6bef4672d8e193c48451df0Ken Wakasa public int hashCode() { 719f0ea52a5db9710df6bef4672d8e193c48451df0Ken Wakasa return Arrays.hashCode(new Object[] { mWord, mFrequency }); 729f0ea52a5db9710df6bef4672d8e193c48451df0Ken Wakasa } 739f0ea52a5db9710df6bef4672d8e193c48451df0Ken Wakasa 749f0ea52a5db9710df6bef4672d8e193c48451df0Ken Wakasa @Override 759f0ea52a5db9710df6bef4672d8e193c48451df0Ken Wakasa public boolean equals(Object o) { 769f0ea52a5db9710df6bef4672d8e193c48451df0Ken Wakasa if (o == this) return true; 779f0ea52a5db9710df6bef4672d8e193c48451df0Ken Wakasa if (!(o instanceof WeightedString)) return false; 789f0ea52a5db9710df6bef4672d8e193c48451df0Ken Wakasa WeightedString w = (WeightedString)o; 799f0ea52a5db9710df6bef4672d8e193c48451df0Ken Wakasa return mWord.equals(w.mWord) && mFrequency == w.mFrequency; 809f0ea52a5db9710df6bef4672d8e193c48451df0Ken Wakasa } 81bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 82bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 83bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 84eec2e51e2cbc9e69739187557846a439ed74325eJean Chalard * A group of characters, with a frequency, shortcut targets, bigrams, and children. 85bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 86bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * This is the central class of the in-memory representation. A CharGroup is what can 87bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * be seen as a traditional "trie node", except it can hold several characters at the 88bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * same time. A CharGroup essentially represents one or several characters in the middle 89bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * of the trie trie; as such, it can be a terminal, and it can have children. 90bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * In this in-memory representation, whether the CharGroup is a terminal or not is represented 91bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * in the frequency, where NOT_A_TERMINAL (= -1) means this is not a terminal and any other 92bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * value is the frequency of this terminal. A terminal may have non-null shortcuts and/or 93bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * bigrams, but a non-terminal may not. Moreover, children, if present, are null. 94bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 95bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public static class CharGroup { 96bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public static final int NOT_A_TERMINAL = -1; 97bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final int mChars[]; 987cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang ArrayList<WeightedString> mShortcutTargets; 997cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang ArrayList<WeightedString> mBigrams; 1007cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang int mFrequency; // NOT_A_TERMINAL == mFrequency indicates this is not a terminal. 101bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard Node mChildren; 102bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // The two following members to help with binary generation 103bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard int mCachedSize; 104bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard int mCachedAddress; 105bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 106eec2e51e2cbc9e69739187557846a439ed74325eJean Chalard public CharGroup(final int[] chars, final ArrayList<WeightedString> shortcutTargets, 1078cf1a8d04f77aefed3a57f6994869e0f35b1a8b4Jean Chalard final ArrayList<WeightedString> bigrams, final int frequency) { 108bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mChars = chars; 109bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mFrequency = frequency; 110eec2e51e2cbc9e69739187557846a439ed74325eJean Chalard mShortcutTargets = shortcutTargets; 111bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mBigrams = bigrams; 112bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mChildren = null; 113bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 114bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 115eec2e51e2cbc9e69739187557846a439ed74325eJean Chalard public CharGroup(final int[] chars, final ArrayList<WeightedString> shortcutTargets, 1168cf1a8d04f77aefed3a57f6994869e0f35b1a8b4Jean Chalard final ArrayList<WeightedString> bigrams, final int frequency, final Node children) { 117bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mChars = chars; 118bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mFrequency = frequency; 119eec2e51e2cbc9e69739187557846a439ed74325eJean Chalard mShortcutTargets = shortcutTargets; 120bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mBigrams = bigrams; 121bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mChildren = children; 122bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 123bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 124bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public void addChild(CharGroup n) { 125bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (null == mChildren) { 126bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mChildren = new Node(); 127bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 128bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mChildren.mData.add(n); 129bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 130bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 131bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public boolean isTerminal() { 132bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard return NOT_A_TERMINAL != mFrequency; 133bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 134bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 135bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public boolean hasSeveralChars() { 136bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard assert(mChars.length > 0); 137bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard return 1 < mChars.length; 138bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 1397cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang 1407cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang /** 1417cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang * Adds a word to the bigram list. Updates the frequency if the word already 1427cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang * exists. 1437cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang */ 1447cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang public void addBigram(final String word, final int frequency) { 1457cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang if (mBigrams == null) { 1467cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang mBigrams = new ArrayList<WeightedString>(); 1477cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 1487cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang WeightedString bigram = getBigram(word); 1497cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang if (bigram != null) { 1507cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang bigram.mFrequency = frequency; 1517cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } else { 1527cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang bigram = new WeightedString(word, frequency); 1537cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang mBigrams.add(bigram); 1547cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 1557cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 1567cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang 1577cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang /** 1587cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang * Gets the shortcut target for the given word. Returns null if the word is not in the 1597cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang * shortcut list. 1607cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang */ 1617cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang public WeightedString getShortcut(final String word) { 1627cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang if (mShortcutTargets != null) { 1637cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang final int size = mShortcutTargets.size(); 1647cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang for (int i = 0; i < size; ++i) { 1657cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang WeightedString shortcut = mShortcutTargets.get(i); 1667cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang if (shortcut.mWord.equals(word)) { 1677cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang return shortcut; 1687cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 1697cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 1707cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 1717cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang return null; 1727cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 1737cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang 1747cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang /** 1757cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang * Gets the bigram for the given word. 1767cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang * Returns null if the word is not in the bigrams list. 1777cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang */ 1787cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang public WeightedString getBigram(final String word) { 1797cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang if (mBigrams != null) { 1807cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang final int size = mBigrams.size(); 1817cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang for (int i = 0; i < size; ++i) { 1827cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang WeightedString bigram = mBigrams.get(i); 1837cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang if (bigram.mWord.equals(word)) { 1847cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang return bigram; 1857cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 1867cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 1877cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 1887cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang return null; 1897cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 1907cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang 1917cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang /** 1927cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang * Updates the CharGroup with the given properties. Adds the shortcut and bigram lists to 1937cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang * the existing ones if any. Note: unigram, bigram, and shortcut frequencies are only 1947cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang * updated if they are higher than the existing ones. 1957cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang */ 1967cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang public void update(int frequency, ArrayList<WeightedString> shortcutTargets, 1978cf1a8d04f77aefed3a57f6994869e0f35b1a8b4Jean Chalard ArrayList<WeightedString> bigrams) { 1987cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang if (frequency > mFrequency) { 1997cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang mFrequency = frequency; 2007cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 2017cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang if (shortcutTargets != null) { 2027cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang if (mShortcutTargets == null) { 2037cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang mShortcutTargets = shortcutTargets; 2047cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } else { 2057cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang final int size = shortcutTargets.size(); 2067cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang for (int i = 0; i < size; ++i) { 2077cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang final WeightedString shortcut = shortcutTargets.get(i); 2087cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang final WeightedString existingShortcut = getShortcut(shortcut.mWord); 2097cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang if (existingShortcut == null) { 2107cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang mShortcutTargets.add(shortcut); 2117cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } else if (existingShortcut.mFrequency < shortcut.mFrequency) { 2127cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang existingShortcut.mFrequency = shortcut.mFrequency; 2137cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 2147cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 2157cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 2167cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 2177cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang if (bigrams != null) { 2187cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang if (mBigrams == null) { 2197cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang mBigrams = bigrams; 2207cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } else { 2217cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang final int size = bigrams.size(); 2227cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang for (int i = 0; i < size; ++i) { 2237cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang final WeightedString bigram = bigrams.get(i); 2247cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang final WeightedString existingBigram = getBigram(bigram.mWord); 2257cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang if (existingBigram == null) { 2267cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang mBigrams.add(bigram); 2277cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } else if (existingBigram.mFrequency < bigram.mFrequency) { 2287cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang existingBigram.mFrequency = bigram.mFrequency; 2297cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 2307cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 2317cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 2327cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 2337cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 234bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 235bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 236bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 237bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Options global to the dictionary. 238bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 239bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * There are no options at the moment, so this class is empty. 240bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 241bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public static class DictionaryOptions { 242f420df28233c26e555d203185fb292e83b94b8c3Jean Chalard public final boolean mGermanUmlautProcessing; 243f420df28233c26e555d203185fb292e83b94b8c3Jean Chalard public final boolean mFrenchLigatureProcessing; 244f420df28233c26e555d203185fb292e83b94b8c3Jean Chalard public final HashMap<String, String> mAttributes; 245f420df28233c26e555d203185fb292e83b94b8c3Jean Chalard public DictionaryOptions(final HashMap<String, String> attributes, 246f420df28233c26e555d203185fb292e83b94b8c3Jean Chalard final boolean germanUmlautProcessing, final boolean frenchLigatureProcessing) { 247c734c2aca1830643d169fd292e0c9d4d9306af5aJean Chalard mAttributes = attributes; 248f420df28233c26e555d203185fb292e83b94b8c3Jean Chalard mGermanUmlautProcessing = germanUmlautProcessing; 249f420df28233c26e555d203185fb292e83b94b8c3Jean Chalard mFrenchLigatureProcessing = frenchLigatureProcessing; 250c734c2aca1830643d169fd292e0c9d4d9306af5aJean Chalard } 251bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 252bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 253bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public final DictionaryOptions mOptions; 254bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public final Node mRoot; 255bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 256bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public FusionDictionary(final Node root, final DictionaryOptions options) { 257bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mRoot = root; 258bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mOptions = options; 259bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 260bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 261c734c2aca1830643d169fd292e0c9d4d9306af5aJean Chalard public void addOptionAttribute(final String key, final String value) { 262c734c2aca1830643d169fd292e0c9d4d9306af5aJean Chalard mOptions.mAttributes.put(key, value); 263c734c2aca1830643d169fd292e0c9d4d9306af5aJean Chalard } 264c734c2aca1830643d169fd292e0c9d4d9306af5aJean Chalard 265bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 266bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Helper method to convert a String to an int array. 267bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 268bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard static private int[] getCodePoints(String word) { 269bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final int wordLength = word.length(); 270bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard int[] array = new int[word.codePointCount(0, wordLength)]; 2719242a2bcf8a6b07bb045a8356711bed1493c251eJean Chalard for (int i = 0; i < wordLength; i = word.offsetByCodePoints(i, 1)) { 272bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard array[i] = word.codePointAt(i); 273bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 274bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard return array; 275bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 276bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 277bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 278c599f2e9d6ab839f38183aa178684ff0e94178a3Jean Chalard * Helper method to add all words in a list as 0-frequency entries 279c599f2e9d6ab839f38183aa178684ff0e94178a3Jean Chalard * 280c599f2e9d6ab839f38183aa178684ff0e94178a3Jean Chalard * These words are added when shortcuts targets or bigrams are not found in the dictionary 281c599f2e9d6ab839f38183aa178684ff0e94178a3Jean Chalard * yet. The same words may be added later with an actual frequency - this is handled by 282c599f2e9d6ab839f38183aa178684ff0e94178a3Jean Chalard * the private version of add(). 283c599f2e9d6ab839f38183aa178684ff0e94178a3Jean Chalard */ 284c599f2e9d6ab839f38183aa178684ff0e94178a3Jean Chalard private void addNeutralWords(final ArrayList<WeightedString> words) { 285c599f2e9d6ab839f38183aa178684ff0e94178a3Jean Chalard if (null != words) { 286c599f2e9d6ab839f38183aa178684ff0e94178a3Jean Chalard for (WeightedString word : words) { 287c599f2e9d6ab839f38183aa178684ff0e94178a3Jean Chalard final CharGroup t = findWordInTree(mRoot, word.mWord); 288c599f2e9d6ab839f38183aa178684ff0e94178a3Jean Chalard if (null == t) { 28944c64f46a143623dd793facd889c8d6eab5e230cJean Chalard add(getCodePoints(word.mWord), 0, null); 290c599f2e9d6ab839f38183aa178684ff0e94178a3Jean Chalard } 291c599f2e9d6ab839f38183aa178684ff0e94178a3Jean Chalard } 292c599f2e9d6ab839f38183aa178684ff0e94178a3Jean Chalard } 293c599f2e9d6ab839f38183aa178684ff0e94178a3Jean Chalard } 294c599f2e9d6ab839f38183aa178684ff0e94178a3Jean Chalard 295c599f2e9d6ab839f38183aa178684ff0e94178a3Jean Chalard /** 296bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Helper method to add a word as a string. 297bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 298bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * This method adds a word to the dictionary with the given frequency. Optional 299bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * lists of bigrams and shortcuts can be passed here. For each word inside, 300bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * they will be added to the dictionary as necessary. 301bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 302bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * @param word the word to add. 303bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * @param frequency the frequency of the word, in the range [0..255]. 304eec2e51e2cbc9e69739187557846a439ed74325eJean Chalard * @param shortcutTargets a list of shortcut targets for this word, or null. 305bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * @param bigrams a list of bigrams, or null. 306bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 307eec2e51e2cbc9e69739187557846a439ed74325eJean Chalard public void add(final String word, final int frequency, 30844c64f46a143623dd793facd889c8d6eab5e230cJean Chalard final ArrayList<WeightedString> shortcutTargets) { 30944c64f46a143623dd793facd889c8d6eab5e230cJean Chalard add(getCodePoints(word), frequency, shortcutTargets); 310bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 311bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 312bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 313bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Sanity check for a node. 314bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 315bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * This method checks that all CharGroups in a node are ordered as expected. 316bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * If they are, nothing happens. If they aren't, an exception is thrown. 317bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 318bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard private void checkStack(Node node) { 319bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard ArrayList<CharGroup> stack = node.mData; 320bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard int lastValue = -1; 321bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard for (int i = 0; i < stack.size(); ++i) { 322bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard int currentValue = stack.get(i).mChars[0]; 323bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (currentValue <= lastValue) 324bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard throw new RuntimeException("Invalid stack"); 325bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard else 326bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard lastValue = currentValue; 327bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 328bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 329bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 330bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 3317cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang * Helper method to add a new bigram to the dictionary. 3327cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang * 3337cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang * @param word1 the previous word of the context 3347cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang * @param word2 the next word of the context 3357cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang * @param frequency the bigram frequency 3367cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang */ 3377cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang public void setBigram(final String word1, final String word2, final int frequency) { 3387cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang CharGroup charGroup = findWordInTree(mRoot, word1); 3397cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang if (charGroup != null) { 3407cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang final CharGroup charGroup2 = findWordInTree(mRoot, word2); 3417cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang if (charGroup2 == null) { 3427cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang // TODO: refactor with the identical code in addNeutralWords 34344c64f46a143623dd793facd889c8d6eab5e230cJean Chalard add(getCodePoints(word2), 0, null); 3447cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 3457cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang charGroup.addBigram(word2, frequency); 3467cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } else { 3477cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang throw new RuntimeException("First word of bigram not found"); 3487cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 3497cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 3507cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang 3517cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang /** 352bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Add a word to this dictionary. 353bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 35444c64f46a143623dd793facd889c8d6eab5e230cJean Chalard * The shortcuts, if any, have to be in the dictionary already. If they aren't, 355bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * an exception is thrown. 356bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 357bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * @param word the word, as an int array. 358bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * @param frequency the frequency of the word, in the range [0..255]. 359eec2e51e2cbc9e69739187557846a439ed74325eJean Chalard * @param shortcutTargets an optional list of shortcut targets for this word (null if none). 360bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 361eec2e51e2cbc9e69739187557846a439ed74325eJean Chalard private void add(final int[] word, final int frequency, 36244c64f46a143623dd793facd889c8d6eab5e230cJean Chalard final ArrayList<WeightedString> shortcutTargets) { 363bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard assert(frequency >= 0 && frequency <= 255); 364bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard Node currentNode = mRoot; 365bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard int charIndex = 0; 366bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 367bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard CharGroup currentGroup = null; 368bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard int differentCharIndex = 0; // Set by the loop to the index of the char that differs 369bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard int nodeIndex = findIndexOfChar(mRoot, word[charIndex]); 370bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard while (CHARACTER_NOT_FOUND != nodeIndex) { 371bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard currentGroup = currentNode.mData.get(nodeIndex); 372cad25fc8a754d6f145bc846f17f270220b15c055Jean Chalard differentCharIndex = compareArrays(currentGroup.mChars, word, charIndex); 373bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (ARRAYS_ARE_EQUAL != differentCharIndex 374bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard && differentCharIndex < currentGroup.mChars.length) break; 375bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (null == currentGroup.mChildren) break; 376bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard charIndex += currentGroup.mChars.length; 377bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (charIndex >= word.length) break; 378bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard currentNode = currentGroup.mChildren; 379bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard nodeIndex = findIndexOfChar(currentNode, word[charIndex]); 380bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 381bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 382bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (-1 == nodeIndex) { 383bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // No node at this point to accept the word. Create one. 384bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final int insertionIndex = findInsertionIndex(currentNode, word[charIndex]); 385bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final CharGroup newGroup = new CharGroup( 386eec2e51e2cbc9e69739187557846a439ed74325eJean Chalard Arrays.copyOfRange(word, charIndex, word.length), 38744c64f46a143623dd793facd889c8d6eab5e230cJean Chalard shortcutTargets, null /* bigrams */, frequency); 388bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard currentNode.mData.add(insertionIndex, newGroup); 389bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard checkStack(currentNode); 390bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } else { 391bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // There is a word with a common prefix. 392bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (differentCharIndex == currentGroup.mChars.length) { 393bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (charIndex + differentCharIndex >= word.length) { 394bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // The new word is a prefix of an existing word, but the node on which it 3957cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang // should end already exists as is. Since the old CharNode was not a terminal, 3967cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang // make it one by filling in its frequency and other attributes 39744c64f46a143623dd793facd889c8d6eab5e230cJean Chalard currentGroup.update(frequency, shortcutTargets, null); 398bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } else { 399bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // The new word matches the full old word and extends past it. 400bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // We only have to create a new node and add it to the end of this. 401bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final CharGroup newNode = new CharGroup( 402bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard Arrays.copyOfRange(word, charIndex + differentCharIndex, word.length), 40344c64f46a143623dd793facd889c8d6eab5e230cJean Chalard shortcutTargets, null /* bigrams */, frequency); 404bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard currentGroup.mChildren = new Node(); 405bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard currentGroup.mChildren.mData.add(newNode); 406bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 407bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } else { 408bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (0 == differentCharIndex) { 4097cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang // Exact same word. Update the frequency if higher. This will also add the 41044c64f46a143623dd793facd889c8d6eab5e230cJean Chalard // new shortcuts to the existing shortcut list if it already exists. 41144c64f46a143623dd793facd889c8d6eab5e230cJean Chalard currentGroup.update(frequency, shortcutTargets, null); 412bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } else { 413bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // Partial prefix match only. We have to replace the current node with a node 414bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // containing the current prefix and create two new ones for the tails. 415bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard Node newChildren = new Node(); 416bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final CharGroup newOldWord = new CharGroup( 417bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard Arrays.copyOfRange(currentGroup.mChars, differentCharIndex, 418eec2e51e2cbc9e69739187557846a439ed74325eJean Chalard currentGroup.mChars.length), currentGroup.mShortcutTargets, 4198cf1a8d04f77aefed3a57f6994869e0f35b1a8b4Jean Chalard currentGroup.mBigrams, currentGroup.mFrequency, currentGroup.mChildren); 420bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard newChildren.mData.add(newOldWord); 421bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 422bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final CharGroup newParent; 423bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (charIndex + differentCharIndex >= word.length) { 424bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard newParent = new CharGroup( 425bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard Arrays.copyOfRange(currentGroup.mChars, 0, differentCharIndex), 42644c64f46a143623dd793facd889c8d6eab5e230cJean Chalard shortcutTargets, null /* bigrams */, frequency, newChildren); 427bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } else { 428bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard newParent = new CharGroup( 429bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard Arrays.copyOfRange(currentGroup.mChars, 0, differentCharIndex), 43044c64f46a143623dd793facd889c8d6eab5e230cJean Chalard null /* shortcutTargets */, null /* bigrams */, -1, newChildren); 43144c64f46a143623dd793facd889c8d6eab5e230cJean Chalard final CharGroup newWord = new CharGroup(Arrays.copyOfRange(word, 43244c64f46a143623dd793facd889c8d6eab5e230cJean Chalard charIndex + differentCharIndex, word.length), 43344c64f46a143623dd793facd889c8d6eab5e230cJean Chalard shortcutTargets, null /* bigrams */, frequency); 434bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final int addIndex = word[charIndex + differentCharIndex] 435bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard > currentGroup.mChars[differentCharIndex] ? 1 : 0; 436bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard newChildren.mData.add(addIndex, newWord); 437bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 438bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard currentNode.mData.set(nodeIndex, newParent); 439bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 440bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard checkStack(currentNode); 441bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 442bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 443bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 444bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 445bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 446bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Custom comparison of two int arrays taken to contain character codes. 447bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 448bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * This method compares the two arrays passed as an argument in a lexicographic way, 449bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * with an offset in the dst string. 450bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * This method does NOT test for the first character. It is taken to be equal. 451bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * I repeat: this method starts the comparison at 1 <> dstOffset + 1. 452bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * The index where the strings differ is returned. ARRAYS_ARE_EQUAL = 0 is returned if the 453bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * strings are equal. This works BECAUSE we don't look at the first character. 454bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 455bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * @param src the left-hand side string of the comparison. 456bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * @param dst the right-hand side string of the comparison. 457bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * @param dstOffset the offset in the right-hand side string. 458bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * @return the index at which the strings differ, or ARRAYS_ARE_EQUAL = 0 if they don't. 459bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 460bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard private static int ARRAYS_ARE_EQUAL = 0; 461bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard private static int compareArrays(final int[] src, final int[] dst, int dstOffset) { 462bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // We do NOT test the first char, because we come from a method that already 463bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // tested it. 464bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard for (int i = 1; i < src.length; ++i) { 465bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (dstOffset + i >= dst.length) return i; 466bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (src[i] != dst[dstOffset + i]) return i; 467bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 468bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (dst.length > src.length) return src.length; 469bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard return ARRAYS_ARE_EQUAL; 470bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 471bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 472bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 473bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Helper class that compares and sorts two chargroups according to their 474bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * first element only. I repeat: ONLY the first element is considered, the rest 475bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * is ignored. 476bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * This comparator imposes orderings that are inconsistent with equals. 477bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 4782aa02b84a4fcfaf5554c278d2b25cf9414eecf8bKen Wakasa static private class CharGroupComparator implements java.util.Comparator<CharGroup> { 4792aa02b84a4fcfaf5554c278d2b25cf9414eecf8bKen Wakasa public int compare(CharGroup c1, CharGroup c2) { 480bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (c1.mChars[0] == c2.mChars[0]) return 0; 481bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard return c1.mChars[0] < c2.mChars[0] ? -1 : 1; 482bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 483bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 484bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final static private CharGroupComparator CHARGROUP_COMPARATOR = new CharGroupComparator(); 485bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 486bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 487bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Finds the insertion index of a character within a node. 488bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 489bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard private static int findInsertionIndex(final Node node, int character) { 4902aa02b84a4fcfaf5554c278d2b25cf9414eecf8bKen Wakasa final ArrayList<CharGroup> data = node.mData; 49144c64f46a143623dd793facd889c8d6eab5e230cJean Chalard final CharGroup reference = new CharGroup(new int[] { character }, 49244c64f46a143623dd793facd889c8d6eab5e230cJean Chalard null /* shortcutTargets */, null /* bigrams */, 0); 493bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard int result = Collections.binarySearch(data, reference, CHARGROUP_COMPARATOR); 494bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard return result >= 0 ? result : -result - 1; 495bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 496bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 497bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 498bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Find the index of a char in a node, if it exists. 499bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 500bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * @param node the node to search in. 501bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * @param character the character to search for. 502bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * @return the position of the character if it's there, or CHARACTER_NOT_FOUND = -1 else. 503bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 504bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard private static int CHARACTER_NOT_FOUND = -1; 505bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard private static int findIndexOfChar(final Node node, int character) { 506bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final int insertionIndex = findInsertionIndex(node, character); 507bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (node.mData.size() <= insertionIndex) return CHARACTER_NOT_FOUND; 508bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard return character == node.mData.get(insertionIndex).mChars[0] ? insertionIndex 509bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard : CHARACTER_NOT_FOUND; 510bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 511bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 512bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 513bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Helper method to find a word in a given branch. 514bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 515bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public static CharGroup findWordInTree(Node node, final String s) { 516bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard int index = 0; 517bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final StringBuilder checker = new StringBuilder(); 518bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 519bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard CharGroup currentGroup; 520bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard do { 521bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard int indexOfGroup = findIndexOfChar(node, s.codePointAt(index)); 522bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (CHARACTER_NOT_FOUND == indexOfGroup) return null; 523bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard currentGroup = node.mData.get(indexOfGroup); 524bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard checker.append(new String(currentGroup.mChars, 0, currentGroup.mChars.length)); 525bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard index += currentGroup.mChars.length; 526bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (index < s.length()) { 527bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard node = currentGroup.mChildren; 528bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 529bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } while (null != node && index < s.length()); 530bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 531bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (!s.equals(checker.toString())) return null; 532bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard return currentGroup; 533bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 534bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 535bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 536eddfbb68dcff55c85b3d5b82d406f543bd038825Jean Chalard * Helper method to find out whether a word is in the dict or not. 537eddfbb68dcff55c85b3d5b82d406f543bd038825Jean Chalard */ 538eddfbb68dcff55c85b3d5b82d406f543bd038825Jean Chalard public boolean hasWord(final String s) { 539eddfbb68dcff55c85b3d5b82d406f543bd038825Jean Chalard if (null == s || "".equals(s)) { 540eddfbb68dcff55c85b3d5b82d406f543bd038825Jean Chalard throw new RuntimeException("Can't search for a null or empty string"); 541eddfbb68dcff55c85b3d5b82d406f543bd038825Jean Chalard } 542eddfbb68dcff55c85b3d5b82d406f543bd038825Jean Chalard return null != findWordInTree(mRoot, s); 543eddfbb68dcff55c85b3d5b82d406f543bd038825Jean Chalard } 544eddfbb68dcff55c85b3d5b82d406f543bd038825Jean Chalard 545eddfbb68dcff55c85b3d5b82d406f543bd038825Jean Chalard /** 546bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Recursively count the number of character groups in a given branch of the trie. 547bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 548bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * @param node the parent node. 549bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * @return the number of char groups in all the branch under this node. 550bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 551bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public static int countCharGroups(final Node node) { 552bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final int nodeSize = node.mData.size(); 553bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard int size = nodeSize; 554bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard for (int i = nodeSize - 1; i >= 0; --i) { 555bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard CharGroup group = node.mData.get(i); 556bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (null != group.mChildren) 557bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard size += countCharGroups(group.mChildren); 558bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 559bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard return size; 560bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 561bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 562bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 563bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Recursively count the number of nodes in a given branch of the trie. 564bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 565bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * @param node the node to count. 566bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * @result the number of nodes in this branch. 567bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 568bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public static int countNodes(final Node node) { 569bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard int size = 1; 570bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard for (int i = node.mData.size() - 1; i >= 0; --i) { 571bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard CharGroup group = node.mData.get(i); 572bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (null != group.mChildren) 573bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard size += countNodes(group.mChildren); 574bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 575bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard return size; 576bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 577bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 578bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // Historically, the tails of the words were going to be merged to save space. 579bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // However, that would prevent the code to search for a specific address in log(n) 580bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // time so this was abandoned. 581bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // The code is still of interest as it does add some compression to any dictionary 582bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // that has no need for attributes. Implementations that does not read attributes should be 583bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // able to read a dictionary with merged tails. 584bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // Also, the following code does support frequencies, as in, it will only merges 585bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // tails that share the same frequency. Though it would result in the above loss of 586bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // performance while searching by address, it is still technically possible to merge 587bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // tails that contain attributes, but this code does not take that into account - it does 588bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // not compare attributes and will merge terminals with different attributes regardless. 589bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public void mergeTails() { 590bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard MakedictLog.i("Do not merge tails"); 591bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard return; 592bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 593bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// MakedictLog.i("Merging nodes. Number of nodes : " + countNodes(root)); 594bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// MakedictLog.i("Number of groups : " + countCharGroups(root)); 595bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// 596bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// final HashMap<String, ArrayList<Node>> repository = 597bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// new HashMap<String, ArrayList<Node>>(); 598bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// mergeTailsInner(repository, root); 599bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// 600bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// MakedictLog.i("Number of different pseudohashes : " + repository.size()); 601bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// int size = 0; 602bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// for (ArrayList<Node> a : repository.values()) { 603bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// size += a.size(); 604bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// } 605bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// MakedictLog.i("Number of nodes after merge : " + (1 + size)); 606bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// MakedictLog.i("Recursively seen nodes : " + countNodes(root)); 607bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 608bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 609bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // The following methods are used by the deactivated mergeTails() 610bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// private static boolean isEqual(Node a, Node b) { 611bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// if (null == a && null == b) return true; 612bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// if (null == a || null == b) return false; 613bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// if (a.data.size() != b.data.size()) return false; 614bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// final int size = a.data.size(); 615bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// for (int i = size - 1; i >= 0; --i) { 616bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// CharGroup aGroup = a.data.get(i); 617bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// CharGroup bGroup = b.data.get(i); 618bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// if (aGroup.frequency != bGroup.frequency) return false; 619bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// if (aGroup.alternates == null && bGroup.alternates != null) return false; 620bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// if (aGroup.alternates != null && !aGroup.equals(bGroup.alternates)) return false; 621bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// if (!Arrays.equals(aGroup.chars, bGroup.chars)) return false; 622bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// if (!isEqual(aGroup.children, bGroup.children)) return false; 623bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// } 624bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// return true; 625bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// } 626bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 627bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// static private HashMap<String, ArrayList<Node>> mergeTailsInner( 628bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// final HashMap<String, ArrayList<Node>> map, final Node node) { 629bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// final ArrayList<CharGroup> branches = node.data; 630bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// final int nodeSize = branches.size(); 631bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// for (int i = 0; i < nodeSize; ++i) { 632bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// CharGroup group = branches.get(i); 633bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// if (null != group.children) { 634bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// String pseudoHash = getPseudoHash(group.children); 635bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// ArrayList<Node> similarList = map.get(pseudoHash); 636bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// if (null == similarList) { 637bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// similarList = new ArrayList<Node>(); 638bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// map.put(pseudoHash, similarList); 639bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// } 640bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// boolean merged = false; 641bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// for (Node similar : similarList) { 642bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// if (isEqual(group.children, similar)) { 643bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// group.children = similar; 644bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// merged = true; 645bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// break; 646bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// } 647bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// } 648bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// if (!merged) { 649bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// similarList.add(group.children); 650bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// } 651bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// mergeTailsInner(map, group.children); 652bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// } 653bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// } 654bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// return map; 655bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// } 656bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 657bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// private static String getPseudoHash(final Node node) { 658bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// StringBuilder s = new StringBuilder(); 659bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// for (CharGroup g : node.data) { 660bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// s.append(g.frequency); 661bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// for (int ch : g.chars){ 662bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// s.append(Character.toChars(ch)); 663bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// } 664bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// } 665bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// return s.toString(); 666bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// } 667bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 668bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 669bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Iterator to walk through a dictionary. 670bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 671bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * This is purely for convenience. 672bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 673bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public static class DictionaryIterator implements Iterator<Word> { 674bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 675bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard private static class Position { 676bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public Iterator<CharGroup> pos; 677bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public int length; 678bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public Position(ArrayList<CharGroup> groups) { 679bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard pos = groups.iterator(); 680bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard length = 0; 681bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 682bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 683bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final StringBuilder mCurrentString; 684bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final LinkedList<Position> mPositions; 685bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 686bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public DictionaryIterator(ArrayList<CharGroup> root) { 687bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mCurrentString = new StringBuilder(); 688bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mPositions = new LinkedList<Position>(); 689bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final Position rootPos = new Position(root); 690bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mPositions.add(rootPos); 691bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 692bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 693bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard @Override 694bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public boolean hasNext() { 695bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard for (Position p : mPositions) { 696bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (p.pos.hasNext()) { 697bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard return true; 698bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 699bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 700bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard return false; 701bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 702bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 703bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard @Override 704bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public Word next() { 705bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard Position currentPos = mPositions.getLast(); 706bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mCurrentString.setLength(mCurrentString.length() - currentPos.length); 707bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 708bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard do { 709bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (currentPos.pos.hasNext()) { 710bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final CharGroup currentGroup = currentPos.pos.next(); 711bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard currentPos.length = currentGroup.mChars.length; 712bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard for (int i : currentGroup.mChars) 713bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mCurrentString.append(Character.toChars(i)); 714bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (null != currentGroup.mChildren) { 715bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard currentPos = new Position(currentGroup.mChildren.mData); 716bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mPositions.addLast(currentPos); 717bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 718bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (currentGroup.mFrequency >= 0) 719bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard return new Word(mCurrentString.toString(), currentGroup.mFrequency, 7208cf1a8d04f77aefed3a57f6994869e0f35b1a8b4Jean Chalard currentGroup.mShortcutTargets, currentGroup.mBigrams); 721bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } else { 722bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mPositions.removeLast(); 723bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard currentPos = mPositions.getLast(); 724bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mCurrentString.setLength(mCurrentString.length() - mPositions.getLast().length); 725bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 726bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } while(true); 727bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 728bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 729bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard @Override 730bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public void remove() { 731bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard throw new UnsupportedOperationException("Unsupported yet"); 732bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 733bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 734bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 735bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 736bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 737bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Method to return an iterator. 738bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 739bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * This method enables Java's enhanced for loop. With this you can have a FusionDictionary x 740bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * and say : for (Word w : x) {} 741bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 742bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard @Override 743bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public Iterator<Word> iterator() { 744bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard return new DictionaryIterator(mRoot.mData); 745bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 746bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard} 747