FusionDictionary.java revision 66f338983bb9cb04a0d94a4729330b1c8ff01c93
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 3147db0be7cbdb8abafc18c1e49b71f6dac0d46994Jean Chalard private static final boolean DBG = MakedictLog.DBG; 3247db0be7cbdb8abafc18c1e49b71f6dac0d46994Jean Chalard 33bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 34bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * A node of the dictionary, containing several CharGroups. 35bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 36bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * A node is but an ordered array of CharGroups, which essentially contain all the 37bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * real information. 38bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * This class also contains fields to cache size and address, to help with binary 39bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * generation. 40bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 41bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public static class Node { 42bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard ArrayList<CharGroup> mData; 43bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // To help with binary generation 44bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard int mCachedSize; 45bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard int mCachedAddress; 46bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public Node() { 47bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mData = new ArrayList<CharGroup>(); 48bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mCachedSize = Integer.MIN_VALUE; 49bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mCachedAddress = Integer.MIN_VALUE; 50bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 51bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public Node(ArrayList<CharGroup> data) { 52bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mData = data; 53bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mCachedSize = Integer.MIN_VALUE; 54bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mCachedAddress = Integer.MIN_VALUE; 55bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 56bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 57bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 58bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 59bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * A string with a frequency. 60bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 61bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * This represents an "attribute", that is either a bigram or a shortcut. 62bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 63bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public static class WeightedString { 6454e84a00fc032ba566cbda41feafa71de77e1c43Jean Chalard public final String mWord; 6554e84a00fc032ba566cbda41feafa71de77e1c43Jean Chalard public int mFrequency; 66bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public WeightedString(String word, int frequency) { 67bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mWord = word; 68bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mFrequency = frequency; 69bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 709f0ea52a5db9710df6bef4672d8e193c48451df0Ken Wakasa 719f0ea52a5db9710df6bef4672d8e193c48451df0Ken Wakasa @Override 729f0ea52a5db9710df6bef4672d8e193c48451df0Ken Wakasa public int hashCode() { 739f0ea52a5db9710df6bef4672d8e193c48451df0Ken Wakasa return Arrays.hashCode(new Object[] { mWord, mFrequency }); 749f0ea52a5db9710df6bef4672d8e193c48451df0Ken Wakasa } 759f0ea52a5db9710df6bef4672d8e193c48451df0Ken Wakasa 769f0ea52a5db9710df6bef4672d8e193c48451df0Ken Wakasa @Override 779f0ea52a5db9710df6bef4672d8e193c48451df0Ken Wakasa public boolean equals(Object o) { 789f0ea52a5db9710df6bef4672d8e193c48451df0Ken Wakasa if (o == this) return true; 799f0ea52a5db9710df6bef4672d8e193c48451df0Ken Wakasa if (!(o instanceof WeightedString)) return false; 809f0ea52a5db9710df6bef4672d8e193c48451df0Ken Wakasa WeightedString w = (WeightedString)o; 819f0ea52a5db9710df6bef4672d8e193c48451df0Ken Wakasa return mWord.equals(w.mWord) && mFrequency == w.mFrequency; 829f0ea52a5db9710df6bef4672d8e193c48451df0Ken Wakasa } 83bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 84bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 85bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 86eec2e51e2cbc9e69739187557846a439ed74325eJean Chalard * A group of characters, with a frequency, shortcut targets, bigrams, and children. 87bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 88bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * This is the central class of the in-memory representation. A CharGroup is what can 89bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * be seen as a traditional "trie node", except it can hold several characters at the 90bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * same time. A CharGroup essentially represents one or several characters in the middle 91bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * of the trie trie; as such, it can be a terminal, and it can have children. 92bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * In this in-memory representation, whether the CharGroup is a terminal or not is represented 93bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * in the frequency, where NOT_A_TERMINAL (= -1) means this is not a terminal and any other 94bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * value is the frequency of this terminal. A terminal may have non-null shortcuts and/or 95bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * bigrams, but a non-terminal may not. Moreover, children, if present, are null. 96bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 97bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public static class CharGroup { 98bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public static final int NOT_A_TERMINAL = -1; 99bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final int mChars[]; 1007cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang ArrayList<WeightedString> mShortcutTargets; 1017cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang ArrayList<WeightedString> mBigrams; 1027cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang int mFrequency; // NOT_A_TERMINAL == mFrequency indicates this is not a terminal. 103bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard Node mChildren; 104bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // The two following members to help with binary generation 105bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard int mCachedSize; 106bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard int mCachedAddress; 107bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 108eec2e51e2cbc9e69739187557846a439ed74325eJean Chalard public CharGroup(final int[] chars, final ArrayList<WeightedString> shortcutTargets, 1098cf1a8d04f77aefed3a57f6994869e0f35b1a8b4Jean Chalard final ArrayList<WeightedString> bigrams, final int frequency) { 110bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mChars = chars; 111bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mFrequency = frequency; 112eec2e51e2cbc9e69739187557846a439ed74325eJean Chalard mShortcutTargets = shortcutTargets; 113bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mBigrams = bigrams; 114bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mChildren = null; 115bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 116bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 117eec2e51e2cbc9e69739187557846a439ed74325eJean Chalard public CharGroup(final int[] chars, final ArrayList<WeightedString> shortcutTargets, 1188cf1a8d04f77aefed3a57f6994869e0f35b1a8b4Jean Chalard final ArrayList<WeightedString> bigrams, final int frequency, final Node children) { 119bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mChars = chars; 120bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mFrequency = frequency; 121eec2e51e2cbc9e69739187557846a439ed74325eJean Chalard mShortcutTargets = shortcutTargets; 122bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mBigrams = bigrams; 123bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mChildren = children; 124bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 125bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 126bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public void addChild(CharGroup n) { 127bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (null == mChildren) { 128bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mChildren = new Node(); 129bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 130bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mChildren.mData.add(n); 131bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 132bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 133bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public boolean isTerminal() { 134bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard return NOT_A_TERMINAL != mFrequency; 135bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 136bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 137bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public boolean hasSeveralChars() { 138bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard assert(mChars.length > 0); 139bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard return 1 < mChars.length; 140bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 1417cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang 1427cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang /** 1437cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang * Adds a word to the bigram list. Updates the frequency if the word already 1447cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang * exists. 1457cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang */ 1467cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang public void addBigram(final String word, final int frequency) { 1477cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang if (mBigrams == null) { 1487cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang mBigrams = new ArrayList<WeightedString>(); 1497cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 1507cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang WeightedString bigram = getBigram(word); 1517cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang if (bigram != null) { 1527cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang bigram.mFrequency = frequency; 1537cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } else { 1547cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang bigram = new WeightedString(word, frequency); 1557cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang mBigrams.add(bigram); 1567cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 1577cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 1587cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang 1597cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang /** 1607cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang * Gets the shortcut target for the given word. Returns null if the word is not in the 1617cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang * shortcut list. 1627cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang */ 1637cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang public WeightedString getShortcut(final String word) { 16447db0be7cbdb8abafc18c1e49b71f6dac0d46994Jean Chalard // TODO: Don't do a linear search 1657cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang if (mShortcutTargets != null) { 1667cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang final int size = mShortcutTargets.size(); 1677cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang for (int i = 0; i < size; ++i) { 1687cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang WeightedString shortcut = mShortcutTargets.get(i); 1697cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang if (shortcut.mWord.equals(word)) { 1707cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang return shortcut; 1717cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 1727cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 1737cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 1747cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang return null; 1757cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 1767cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang 1777cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang /** 1787cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang * Gets the bigram for the given word. 1797cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang * Returns null if the word is not in the bigrams list. 1807cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang */ 1817cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang public WeightedString getBigram(final String word) { 18247db0be7cbdb8abafc18c1e49b71f6dac0d46994Jean Chalard // TODO: Don't do a linear search 1837cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang if (mBigrams != null) { 1847cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang final int size = mBigrams.size(); 1857cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang for (int i = 0; i < size; ++i) { 1867cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang WeightedString bigram = mBigrams.get(i); 1877cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang if (bigram.mWord.equals(word)) { 1887cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang return bigram; 1897cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 1907cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 1917cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 1927cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang return null; 1937cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 1947cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang 1957cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang /** 1967cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang * Updates the CharGroup with the given properties. Adds the shortcut and bigram lists to 1977cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang * the existing ones if any. Note: unigram, bigram, and shortcut frequencies are only 1987cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang * updated if they are higher than the existing ones. 1997cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang */ 2007cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang public void update(int frequency, ArrayList<WeightedString> shortcutTargets, 2018cf1a8d04f77aefed3a57f6994869e0f35b1a8b4Jean Chalard ArrayList<WeightedString> bigrams) { 2027cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang if (frequency > mFrequency) { 2037cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang mFrequency = frequency; 2047cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 2057cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang if (shortcutTargets != null) { 2067cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang if (mShortcutTargets == null) { 2077cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang mShortcutTargets = shortcutTargets; 2087cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } else { 2097cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang final int size = shortcutTargets.size(); 2107cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang for (int i = 0; i < size; ++i) { 2117cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang final WeightedString shortcut = shortcutTargets.get(i); 2127cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang final WeightedString existingShortcut = getShortcut(shortcut.mWord); 2137cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang if (existingShortcut == null) { 2147cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang mShortcutTargets.add(shortcut); 2157cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } else if (existingShortcut.mFrequency < shortcut.mFrequency) { 2167cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang existingShortcut.mFrequency = shortcut.mFrequency; 2177cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 2187cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 2197cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 2207cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 2217cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang if (bigrams != null) { 2227cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang if (mBigrams == null) { 2237cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang mBigrams = bigrams; 2247cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } else { 2257cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang final int size = bigrams.size(); 2267cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang for (int i = 0; i < size; ++i) { 2277cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang final WeightedString bigram = bigrams.get(i); 2287cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang final WeightedString existingBigram = getBigram(bigram.mWord); 2297cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang if (existingBigram == null) { 2307cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang mBigrams.add(bigram); 2317cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } else if (existingBigram.mFrequency < bigram.mFrequency) { 2327cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang existingBigram.mFrequency = bigram.mFrequency; 2337cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 2347cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 2357cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 2367cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 2377cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 238bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 239bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 240bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 241bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Options global to the dictionary. 242bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 243bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * There are no options at the moment, so this class is empty. 244bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 245bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public static class DictionaryOptions { 246f420df28233c26e555d203185fb292e83b94b8c3Jean Chalard public final boolean mGermanUmlautProcessing; 247f420df28233c26e555d203185fb292e83b94b8c3Jean Chalard public final boolean mFrenchLigatureProcessing; 248f420df28233c26e555d203185fb292e83b94b8c3Jean Chalard public final HashMap<String, String> mAttributes; 249f420df28233c26e555d203185fb292e83b94b8c3Jean Chalard public DictionaryOptions(final HashMap<String, String> attributes, 250f420df28233c26e555d203185fb292e83b94b8c3Jean Chalard final boolean germanUmlautProcessing, final boolean frenchLigatureProcessing) { 251c734c2aca1830643d169fd292e0c9d4d9306af5aJean Chalard mAttributes = attributes; 252f420df28233c26e555d203185fb292e83b94b8c3Jean Chalard mGermanUmlautProcessing = germanUmlautProcessing; 253f420df28233c26e555d203185fb292e83b94b8c3Jean Chalard mFrenchLigatureProcessing = frenchLigatureProcessing; 254c734c2aca1830643d169fd292e0c9d4d9306af5aJean Chalard } 255bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 256bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 257bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public final DictionaryOptions mOptions; 258bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public final Node mRoot; 259bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 260bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public FusionDictionary(final Node root, final DictionaryOptions options) { 261bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mRoot = root; 262bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mOptions = options; 263bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 264bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 265c734c2aca1830643d169fd292e0c9d4d9306af5aJean Chalard public void addOptionAttribute(final String key, final String value) { 266c734c2aca1830643d169fd292e0c9d4d9306af5aJean Chalard mOptions.mAttributes.put(key, value); 267c734c2aca1830643d169fd292e0c9d4d9306af5aJean Chalard } 268c734c2aca1830643d169fd292e0c9d4d9306af5aJean Chalard 269bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 270bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Helper method to convert a String to an int array. 271bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 27247db0be7cbdb8abafc18c1e49b71f6dac0d46994Jean Chalard static private int[] getCodePoints(final String word) { 27347db0be7cbdb8abafc18c1e49b71f6dac0d46994Jean Chalard // TODO: this is a copy-paste of the contents of StringUtils.toCodePointArray, 27447db0be7cbdb8abafc18c1e49b71f6dac0d46994Jean Chalard // which is not visible from the makedict package. Factor this code. 27547db0be7cbdb8abafc18c1e49b71f6dac0d46994Jean Chalard final char[] characters = word.toCharArray(); 27647db0be7cbdb8abafc18c1e49b71f6dac0d46994Jean Chalard final int length = characters.length; 27747db0be7cbdb8abafc18c1e49b71f6dac0d46994Jean Chalard final int[] codePoints = new int[Character.codePointCount(characters, 0, length)]; 27847db0be7cbdb8abafc18c1e49b71f6dac0d46994Jean Chalard int codePoint = Character.codePointAt(characters, 0); 27947db0be7cbdb8abafc18c1e49b71f6dac0d46994Jean Chalard int dsti = 0; 28047db0be7cbdb8abafc18c1e49b71f6dac0d46994Jean Chalard for (int srci = Character.charCount(codePoint); 28147db0be7cbdb8abafc18c1e49b71f6dac0d46994Jean Chalard srci < length; srci += Character.charCount(codePoint), ++dsti) { 28247db0be7cbdb8abafc18c1e49b71f6dac0d46994Jean Chalard codePoints[dsti] = codePoint; 28347db0be7cbdb8abafc18c1e49b71f6dac0d46994Jean Chalard codePoint = Character.codePointAt(characters, srci); 284c599f2e9d6ab839f38183aa178684ff0e94178a3Jean Chalard } 28547db0be7cbdb8abafc18c1e49b71f6dac0d46994Jean Chalard codePoints[dsti] = codePoint; 28647db0be7cbdb8abafc18c1e49b71f6dac0d46994Jean Chalard return codePoints; 287c599f2e9d6ab839f38183aa178684ff0e94178a3Jean Chalard } 288c599f2e9d6ab839f38183aa178684ff0e94178a3Jean Chalard 289c599f2e9d6ab839f38183aa178684ff0e94178a3Jean Chalard /** 290bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Helper method to add a word as a string. 291bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 292bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * This method adds a word to the dictionary with the given frequency. Optional 293bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * lists of bigrams and shortcuts can be passed here. For each word inside, 294bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * they will be added to the dictionary as necessary. 295bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 296bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * @param word the word to add. 297bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * @param frequency the frequency of the word, in the range [0..255]. 298eec2e51e2cbc9e69739187557846a439ed74325eJean Chalard * @param shortcutTargets a list of shortcut targets for this word, or null. 299bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 300eec2e51e2cbc9e69739187557846a439ed74325eJean Chalard public void add(final String word, final int frequency, 30144c64f46a143623dd793facd889c8d6eab5e230cJean Chalard final ArrayList<WeightedString> shortcutTargets) { 30244c64f46a143623dd793facd889c8d6eab5e230cJean Chalard add(getCodePoints(word), frequency, shortcutTargets); 303bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 304bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 305bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 306bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Sanity check for a node. 307bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 308bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * This method checks that all CharGroups in a node are ordered as expected. 309bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * If they are, nothing happens. If they aren't, an exception is thrown. 310bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 311bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard private void checkStack(Node node) { 312bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard ArrayList<CharGroup> stack = node.mData; 313bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard int lastValue = -1; 314bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard for (int i = 0; i < stack.size(); ++i) { 315bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard int currentValue = stack.get(i).mChars[0]; 316bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (currentValue <= lastValue) 317bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard throw new RuntimeException("Invalid stack"); 318bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard else 319bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard lastValue = currentValue; 320bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 321bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 322bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 323bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 3247cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang * Helper method to add a new bigram to the dictionary. 3257cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang * 3267cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang * @param word1 the previous word of the context 3277cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang * @param word2 the next word of the context 3287cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang * @param frequency the bigram frequency 3297cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang */ 3307cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang public void setBigram(final String word1, final String word2, final int frequency) { 3317cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang CharGroup charGroup = findWordInTree(mRoot, word1); 3327cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang if (charGroup != null) { 3337cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang final CharGroup charGroup2 = findWordInTree(mRoot, word2); 3347cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang if (charGroup2 == null) { 33544c64f46a143623dd793facd889c8d6eab5e230cJean Chalard add(getCodePoints(word2), 0, null); 3367cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 3377cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang charGroup.addBigram(word2, frequency); 3387cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } else { 3397cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang throw new RuntimeException("First word of bigram not found"); 3407cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 3417cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang } 3427cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang 3437cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang /** 344bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Add a word to this dictionary. 345bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 34644c64f46a143623dd793facd889c8d6eab5e230cJean Chalard * The shortcuts, if any, have to be in the dictionary already. If they aren't, 347bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * an exception is thrown. 348bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 349bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * @param word the word, as an int array. 350bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * @param frequency the frequency of the word, in the range [0..255]. 351eec2e51e2cbc9e69739187557846a439ed74325eJean Chalard * @param shortcutTargets an optional list of shortcut targets for this word (null if none). 352bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 353eec2e51e2cbc9e69739187557846a439ed74325eJean Chalard private void add(final int[] word, final int frequency, 35444c64f46a143623dd793facd889c8d6eab5e230cJean Chalard final ArrayList<WeightedString> shortcutTargets) { 355bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard assert(frequency >= 0 && frequency <= 255); 356bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard Node currentNode = mRoot; 357bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard int charIndex = 0; 358bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 359bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard CharGroup currentGroup = null; 360bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard int differentCharIndex = 0; // Set by the loop to the index of the char that differs 361bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard int nodeIndex = findIndexOfChar(mRoot, word[charIndex]); 362bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard while (CHARACTER_NOT_FOUND != nodeIndex) { 363bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard currentGroup = currentNode.mData.get(nodeIndex); 364cad25fc8a754d6f145bc846f17f270220b15c055Jean Chalard differentCharIndex = compareArrays(currentGroup.mChars, word, charIndex); 365bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (ARRAYS_ARE_EQUAL != differentCharIndex 366bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard && differentCharIndex < currentGroup.mChars.length) break; 367bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (null == currentGroup.mChildren) break; 368bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard charIndex += currentGroup.mChars.length; 369bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (charIndex >= word.length) break; 370bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard currentNode = currentGroup.mChildren; 371bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard nodeIndex = findIndexOfChar(currentNode, word[charIndex]); 372bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 373bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 374bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (-1 == nodeIndex) { 375bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // No node at this point to accept the word. Create one. 376bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final int insertionIndex = findInsertionIndex(currentNode, word[charIndex]); 377bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final CharGroup newGroup = new CharGroup( 378eec2e51e2cbc9e69739187557846a439ed74325eJean Chalard Arrays.copyOfRange(word, charIndex, word.length), 37944c64f46a143623dd793facd889c8d6eab5e230cJean Chalard shortcutTargets, null /* bigrams */, frequency); 380bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard currentNode.mData.add(insertionIndex, newGroup); 38147db0be7cbdb8abafc18c1e49b71f6dac0d46994Jean Chalard if (DBG) checkStack(currentNode); 382bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } else { 383bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // There is a word with a common prefix. 384bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (differentCharIndex == currentGroup.mChars.length) { 385bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (charIndex + differentCharIndex >= word.length) { 386bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // The new word is a prefix of an existing word, but the node on which it 3877cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang // should end already exists as is. Since the old CharNode was not a terminal, 3887cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang // make it one by filling in its frequency and other attributes 38944c64f46a143623dd793facd889c8d6eab5e230cJean Chalard currentGroup.update(frequency, shortcutTargets, null); 390bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } else { 391bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // The new word matches the full old word and extends past it. 392bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // We only have to create a new node and add it to the end of this. 393bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final CharGroup newNode = new CharGroup( 394bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard Arrays.copyOfRange(word, charIndex + differentCharIndex, word.length), 39544c64f46a143623dd793facd889c8d6eab5e230cJean Chalard shortcutTargets, null /* bigrams */, frequency); 396bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard currentGroup.mChildren = new Node(); 397bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard currentGroup.mChildren.mData.add(newNode); 398bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 399bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } else { 400bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (0 == differentCharIndex) { 4017cfe20efbeb4a94b15291aee95d0559ae2449c45Tom Ouyang // Exact same word. Update the frequency if higher. This will also add the 40244c64f46a143623dd793facd889c8d6eab5e230cJean Chalard // new shortcuts to the existing shortcut list if it already exists. 40344c64f46a143623dd793facd889c8d6eab5e230cJean Chalard currentGroup.update(frequency, shortcutTargets, null); 404bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } else { 405bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // Partial prefix match only. We have to replace the current node with a node 406bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // containing the current prefix and create two new ones for the tails. 407bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard Node newChildren = new Node(); 408bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final CharGroup newOldWord = new CharGroup( 409bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard Arrays.copyOfRange(currentGroup.mChars, differentCharIndex, 410eec2e51e2cbc9e69739187557846a439ed74325eJean Chalard currentGroup.mChars.length), currentGroup.mShortcutTargets, 4118cf1a8d04f77aefed3a57f6994869e0f35b1a8b4Jean Chalard currentGroup.mBigrams, currentGroup.mFrequency, currentGroup.mChildren); 412bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard newChildren.mData.add(newOldWord); 413bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 414bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final CharGroup newParent; 415bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (charIndex + differentCharIndex >= word.length) { 416bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard newParent = new CharGroup( 417bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard Arrays.copyOfRange(currentGroup.mChars, 0, differentCharIndex), 41844c64f46a143623dd793facd889c8d6eab5e230cJean Chalard shortcutTargets, null /* bigrams */, frequency, newChildren); 419bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } else { 420bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard newParent = new CharGroup( 421bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard Arrays.copyOfRange(currentGroup.mChars, 0, differentCharIndex), 42244c64f46a143623dd793facd889c8d6eab5e230cJean Chalard null /* shortcutTargets */, null /* bigrams */, -1, newChildren); 42344c64f46a143623dd793facd889c8d6eab5e230cJean Chalard final CharGroup newWord = new CharGroup(Arrays.copyOfRange(word, 42444c64f46a143623dd793facd889c8d6eab5e230cJean Chalard charIndex + differentCharIndex, word.length), 42544c64f46a143623dd793facd889c8d6eab5e230cJean Chalard shortcutTargets, null /* bigrams */, frequency); 426bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final int addIndex = word[charIndex + differentCharIndex] 427bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard > currentGroup.mChars[differentCharIndex] ? 1 : 0; 428bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard newChildren.mData.add(addIndex, newWord); 429bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 430bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard currentNode.mData.set(nodeIndex, newParent); 431bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 43247db0be7cbdb8abafc18c1e49b71f6dac0d46994Jean Chalard if (DBG) checkStack(currentNode); 433bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 434bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 435bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 436bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 43793ebf74bae44728e0d5f7e738ea28376187a876eTadashi G. Takaoka private static int ARRAYS_ARE_EQUAL = 0; 43893ebf74bae44728e0d5f7e738ea28376187a876eTadashi G. Takaoka 439bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 440bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Custom comparison of two int arrays taken to contain character codes. 441bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 442bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * This method compares the two arrays passed as an argument in a lexicographic way, 443bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * with an offset in the dst string. 444bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * This method does NOT test for the first character. It is taken to be equal. 445bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * I repeat: this method starts the comparison at 1 <> dstOffset + 1. 446bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * The index where the strings differ is returned. ARRAYS_ARE_EQUAL = 0 is returned if the 447bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * strings are equal. This works BECAUSE we don't look at the first character. 448bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 449bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * @param src the left-hand side string of the comparison. 450bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * @param dst the right-hand side string of the comparison. 451bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * @param dstOffset the offset in the right-hand side string. 452bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * @return the index at which the strings differ, or ARRAYS_ARE_EQUAL = 0 if they don't. 453bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 454bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard private static int compareArrays(final int[] src, final int[] dst, int dstOffset) { 455bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // We do NOT test the first char, because we come from a method that already 456bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // tested it. 457bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard for (int i = 1; i < src.length; ++i) { 458bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (dstOffset + i >= dst.length) return i; 459bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (src[i] != dst[dstOffset + i]) return i; 460bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 461bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (dst.length > src.length) return src.length; 462bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard return ARRAYS_ARE_EQUAL; 463bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 464bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 465bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 466bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Helper class that compares and sorts two chargroups according to their 467bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * first element only. I repeat: ONLY the first element is considered, the rest 468bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * is ignored. 469bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * This comparator imposes orderings that are inconsistent with equals. 470bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 4712aa02b84a4fcfaf5554c278d2b25cf9414eecf8bKen Wakasa static private class CharGroupComparator implements java.util.Comparator<CharGroup> { 47293ebf74bae44728e0d5f7e738ea28376187a876eTadashi G. Takaoka @Override 4732aa02b84a4fcfaf5554c278d2b25cf9414eecf8bKen Wakasa public int compare(CharGroup c1, CharGroup c2) { 474bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (c1.mChars[0] == c2.mChars[0]) return 0; 475bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard return c1.mChars[0] < c2.mChars[0] ? -1 : 1; 476bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 477bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 478bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final static private CharGroupComparator CHARGROUP_COMPARATOR = new CharGroupComparator(); 479bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 480bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 481bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Finds the insertion index of a character within a node. 482bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 483bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard private static int findInsertionIndex(final Node node, int character) { 4842aa02b84a4fcfaf5554c278d2b25cf9414eecf8bKen Wakasa final ArrayList<CharGroup> data = node.mData; 48544c64f46a143623dd793facd889c8d6eab5e230cJean Chalard final CharGroup reference = new CharGroup(new int[] { character }, 48644c64f46a143623dd793facd889c8d6eab5e230cJean Chalard null /* shortcutTargets */, null /* bigrams */, 0); 487bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard int result = Collections.binarySearch(data, reference, CHARGROUP_COMPARATOR); 488bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard return result >= 0 ? result : -result - 1; 489bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 490bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 49193ebf74bae44728e0d5f7e738ea28376187a876eTadashi G. Takaoka private static int CHARACTER_NOT_FOUND = -1; 49293ebf74bae44728e0d5f7e738ea28376187a876eTadashi G. Takaoka 493bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 494bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Find the index of a char in a node, if it exists. 495bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 496bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * @param node the node to search in. 497bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * @param character the character to search for. 498bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * @return the position of the character if it's there, or CHARACTER_NOT_FOUND = -1 else. 499bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 500bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard private static int findIndexOfChar(final Node node, int character) { 501bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final int insertionIndex = findInsertionIndex(node, character); 502bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (node.mData.size() <= insertionIndex) return CHARACTER_NOT_FOUND; 503bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard return character == node.mData.get(insertionIndex).mChars[0] ? insertionIndex 504bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard : CHARACTER_NOT_FOUND; 505bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 506bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 507bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 508bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Helper method to find a word in a given branch. 509bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 510bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public static CharGroup findWordInTree(Node node, final String s) { 511bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard int index = 0; 51212efad3d15147f255f6e01600c40e9fdb1224d84Jean Chalard final StringBuilder checker = DBG ? new StringBuilder() : null; 513bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 514bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard CharGroup currentGroup; 515bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard do { 516bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard int indexOfGroup = findIndexOfChar(node, s.codePointAt(index)); 517bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (CHARACTER_NOT_FOUND == indexOfGroup) return null; 518bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard currentGroup = node.mData.get(indexOfGroup); 51966f338983bb9cb04a0d94a4729330b1c8ff01c93Yuichiro Hanada 52066f338983bb9cb04a0d94a4729330b1c8ff01c93Yuichiro Hanada if (s.length() - index < currentGroup.mChars.length) return null; 52166f338983bb9cb04a0d94a4729330b1c8ff01c93Yuichiro Hanada int newIndex = index; 52266f338983bb9cb04a0d94a4729330b1c8ff01c93Yuichiro Hanada while (newIndex < s.length() && newIndex - index < currentGroup.mChars.length) { 52366f338983bb9cb04a0d94a4729330b1c8ff01c93Yuichiro Hanada if (currentGroup.mChars[newIndex - index] != s.codePointAt(newIndex)) return null; 52466f338983bb9cb04a0d94a4729330b1c8ff01c93Yuichiro Hanada newIndex++; 52566f338983bb9cb04a0d94a4729330b1c8ff01c93Yuichiro Hanada } 52666f338983bb9cb04a0d94a4729330b1c8ff01c93Yuichiro Hanada index = newIndex; 52766f338983bb9cb04a0d94a4729330b1c8ff01c93Yuichiro Hanada 52812efad3d15147f255f6e01600c40e9fdb1224d84Jean Chalard if (DBG) checker.append(new String(currentGroup.mChars, 0, currentGroup.mChars.length)); 529bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (index < s.length()) { 530bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard node = currentGroup.mChildren; 531bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 532bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } while (null != node && index < s.length()); 533bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 53466f338983bb9cb04a0d94a4729330b1c8ff01c93Yuichiro Hanada if (index < s.length()) return null; 53512efad3d15147f255f6e01600c40e9fdb1224d84Jean Chalard if (DBG && !s.equals(checker.toString())) return null; 536bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard return currentGroup; 537bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 538bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 539bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 540eddfbb68dcff55c85b3d5b82d406f543bd038825Jean Chalard * Helper method to find out whether a word is in the dict or not. 541eddfbb68dcff55c85b3d5b82d406f543bd038825Jean Chalard */ 542eddfbb68dcff55c85b3d5b82d406f543bd038825Jean Chalard public boolean hasWord(final String s) { 543eddfbb68dcff55c85b3d5b82d406f543bd038825Jean Chalard if (null == s || "".equals(s)) { 544eddfbb68dcff55c85b3d5b82d406f543bd038825Jean Chalard throw new RuntimeException("Can't search for a null or empty string"); 545eddfbb68dcff55c85b3d5b82d406f543bd038825Jean Chalard } 546eddfbb68dcff55c85b3d5b82d406f543bd038825Jean Chalard return null != findWordInTree(mRoot, s); 547eddfbb68dcff55c85b3d5b82d406f543bd038825Jean Chalard } 548eddfbb68dcff55c85b3d5b82d406f543bd038825Jean Chalard 549eddfbb68dcff55c85b3d5b82d406f543bd038825Jean Chalard /** 550bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Recursively count the number of character groups in a given branch of the trie. 551bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 552bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * @param node the parent node. 553bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * @return the number of char groups in all the branch under this node. 554bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 555bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public static int countCharGroups(final Node node) { 556bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final int nodeSize = node.mData.size(); 557bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard int size = nodeSize; 558bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard for (int i = nodeSize - 1; i >= 0; --i) { 559bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard CharGroup group = node.mData.get(i); 560bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (null != group.mChildren) 561bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard size += countCharGroups(group.mChildren); 562bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 563bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard return size; 564bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 565bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 566bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 567bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Recursively count the number of nodes in a given branch of the trie. 568bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 569bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * @param node the node to count. 57020a6dea1cabfd8822824f7dca828d898e5b91cbcJean Chalard * @return the number of nodes in this branch. 571bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 572bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public static int countNodes(final Node node) { 573bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard int size = 1; 574bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard for (int i = node.mData.size() - 1; i >= 0; --i) { 575bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard CharGroup group = node.mData.get(i); 576bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (null != group.mChildren) 577bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard size += countNodes(group.mChildren); 578bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 579bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard return size; 580bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 581bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 58220a6dea1cabfd8822824f7dca828d898e5b91cbcJean Chalard // Recursively find out whether there are any bigrams. 58320a6dea1cabfd8822824f7dca828d898e5b91cbcJean Chalard // This can be pretty expensive especially if there aren't any (we return as soon 58420a6dea1cabfd8822824f7dca828d898e5b91cbcJean Chalard // as we find one, so it's much cheaper if there are bigrams) 58520a6dea1cabfd8822824f7dca828d898e5b91cbcJean Chalard private static boolean hasBigramsInternal(final Node node) { 58620a6dea1cabfd8822824f7dca828d898e5b91cbcJean Chalard if (null == node) return false; 58720a6dea1cabfd8822824f7dca828d898e5b91cbcJean Chalard for (int i = node.mData.size() - 1; i >= 0; --i) { 58820a6dea1cabfd8822824f7dca828d898e5b91cbcJean Chalard CharGroup group = node.mData.get(i); 58920a6dea1cabfd8822824f7dca828d898e5b91cbcJean Chalard if (null != group.mBigrams) return true; 59020a6dea1cabfd8822824f7dca828d898e5b91cbcJean Chalard if (hasBigramsInternal(group.mChildren)) return true; 59120a6dea1cabfd8822824f7dca828d898e5b91cbcJean Chalard } 59220a6dea1cabfd8822824f7dca828d898e5b91cbcJean Chalard return false; 59320a6dea1cabfd8822824f7dca828d898e5b91cbcJean Chalard } 59420a6dea1cabfd8822824f7dca828d898e5b91cbcJean Chalard 59520a6dea1cabfd8822824f7dca828d898e5b91cbcJean Chalard /** 59620a6dea1cabfd8822824f7dca828d898e5b91cbcJean Chalard * Finds out whether there are any bigrams in this dictionary. 59720a6dea1cabfd8822824f7dca828d898e5b91cbcJean Chalard * 59820a6dea1cabfd8822824f7dca828d898e5b91cbcJean Chalard * @return true if there is any bigram, false otherwise. 59920a6dea1cabfd8822824f7dca828d898e5b91cbcJean Chalard */ 60020a6dea1cabfd8822824f7dca828d898e5b91cbcJean Chalard // TODO: this is expensive especially for large dictionaries without any bigram. 60120a6dea1cabfd8822824f7dca828d898e5b91cbcJean Chalard // The up side is, this is always accurate and correct and uses no memory. We should 60220a6dea1cabfd8822824f7dca828d898e5b91cbcJean Chalard // find a more efficient way of doing this, without compromising too much on memory 60320a6dea1cabfd8822824f7dca828d898e5b91cbcJean Chalard // and ease of use. 60420a6dea1cabfd8822824f7dca828d898e5b91cbcJean Chalard public boolean hasBigrams() { 60520a6dea1cabfd8822824f7dca828d898e5b91cbcJean Chalard return hasBigramsInternal(mRoot); 60620a6dea1cabfd8822824f7dca828d898e5b91cbcJean Chalard } 60720a6dea1cabfd8822824f7dca828d898e5b91cbcJean Chalard 608bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // Historically, the tails of the words were going to be merged to save space. 609bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // However, that would prevent the code to search for a specific address in log(n) 610bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // time so this was abandoned. 611bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // The code is still of interest as it does add some compression to any dictionary 612bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // that has no need for attributes. Implementations that does not read attributes should be 613bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // able to read a dictionary with merged tails. 614bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // Also, the following code does support frequencies, as in, it will only merges 615bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // tails that share the same frequency. Though it would result in the above loss of 616bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // performance while searching by address, it is still technically possible to merge 617bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // tails that contain attributes, but this code does not take that into account - it does 618bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // not compare attributes and will merge terminals with different attributes regardless. 619bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public void mergeTails() { 620bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard MakedictLog.i("Do not merge tails"); 621bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard return; 622bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 623bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// MakedictLog.i("Merging nodes. Number of nodes : " + countNodes(root)); 624bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// MakedictLog.i("Number of groups : " + countCharGroups(root)); 625bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// 626bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// final HashMap<String, ArrayList<Node>> repository = 627bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// new HashMap<String, ArrayList<Node>>(); 628bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// mergeTailsInner(repository, root); 629bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// 630bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// MakedictLog.i("Number of different pseudohashes : " + repository.size()); 631bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// int size = 0; 632bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// for (ArrayList<Node> a : repository.values()) { 633bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// size += a.size(); 634bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// } 635bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// MakedictLog.i("Number of nodes after merge : " + (1 + size)); 636bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// MakedictLog.i("Recursively seen nodes : " + countNodes(root)); 637bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 638bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 639bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard // The following methods are used by the deactivated mergeTails() 640bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// private static boolean isEqual(Node a, Node b) { 641bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// if (null == a && null == b) return true; 642bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// if (null == a || null == b) return false; 643bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// if (a.data.size() != b.data.size()) return false; 644bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// final int size = a.data.size(); 645bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// for (int i = size - 1; i >= 0; --i) { 646bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// CharGroup aGroup = a.data.get(i); 647bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// CharGroup bGroup = b.data.get(i); 648bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// if (aGroup.frequency != bGroup.frequency) return false; 649bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// if (aGroup.alternates == null && bGroup.alternates != null) return false; 650bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// if (aGroup.alternates != null && !aGroup.equals(bGroup.alternates)) return false; 651bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// if (!Arrays.equals(aGroup.chars, bGroup.chars)) return false; 652bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// if (!isEqual(aGroup.children, bGroup.children)) return false; 653bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// } 654bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// return true; 655bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// } 656bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 657bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// static private HashMap<String, ArrayList<Node>> mergeTailsInner( 658bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// final HashMap<String, ArrayList<Node>> map, final Node node) { 659bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// final ArrayList<CharGroup> branches = node.data; 660bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// final int nodeSize = branches.size(); 661bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// for (int i = 0; i < nodeSize; ++i) { 662bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// CharGroup group = branches.get(i); 663bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// if (null != group.children) { 664bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// String pseudoHash = getPseudoHash(group.children); 665bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// ArrayList<Node> similarList = map.get(pseudoHash); 666bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// if (null == similarList) { 667bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// similarList = new ArrayList<Node>(); 668bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// map.put(pseudoHash, similarList); 669bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// } 670bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// boolean merged = false; 671bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// for (Node similar : similarList) { 672bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// if (isEqual(group.children, similar)) { 673bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// group.children = similar; 674bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// merged = true; 675bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// break; 676bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// } 677bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// } 678bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// if (!merged) { 679bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// similarList.add(group.children); 680bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// } 681bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// mergeTailsInner(map, group.children); 682bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// } 683bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// } 684bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// return map; 685bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// } 686bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 687bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// private static String getPseudoHash(final Node node) { 688bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// StringBuilder s = new StringBuilder(); 689bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// for (CharGroup g : node.data) { 690bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// s.append(g.frequency); 691bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// for (int ch : g.chars){ 692bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// s.append(Character.toChars(ch)); 693bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// } 694bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// } 695bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// return s.toString(); 696bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard// } 697bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 698bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 699bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Iterator to walk through a dictionary. 700bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 701bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * This is purely for convenience. 702bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 703bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public static class DictionaryIterator implements Iterator<Word> { 704bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 705bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard private static class Position { 706bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public Iterator<CharGroup> pos; 707bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public int length; 708bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public Position(ArrayList<CharGroup> groups) { 709bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard pos = groups.iterator(); 710bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard length = 0; 711bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 712bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 713bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final StringBuilder mCurrentString; 714bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final LinkedList<Position> mPositions; 715bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 716bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public DictionaryIterator(ArrayList<CharGroup> root) { 717bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mCurrentString = new StringBuilder(); 718bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mPositions = new LinkedList<Position>(); 719bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final Position rootPos = new Position(root); 720bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mPositions.add(rootPos); 721bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 722bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 723bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard @Override 724bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public boolean hasNext() { 725bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard for (Position p : mPositions) { 726bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (p.pos.hasNext()) { 727bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard return true; 728bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 729bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 730bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard return false; 731bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 732bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 733bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard @Override 734bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public Word next() { 735bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard Position currentPos = mPositions.getLast(); 736bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mCurrentString.setLength(mCurrentString.length() - currentPos.length); 737bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 738bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard do { 739bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (currentPos.pos.hasNext()) { 740bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard final CharGroup currentGroup = currentPos.pos.next(); 741bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard currentPos.length = currentGroup.mChars.length; 742bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard for (int i : currentGroup.mChars) 743bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mCurrentString.append(Character.toChars(i)); 744bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (null != currentGroup.mChildren) { 745bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard currentPos = new Position(currentGroup.mChildren.mData); 746bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mPositions.addLast(currentPos); 747bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 748bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard if (currentGroup.mFrequency >= 0) 749bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard return new Word(mCurrentString.toString(), currentGroup.mFrequency, 7508cf1a8d04f77aefed3a57f6994869e0f35b1a8b4Jean Chalard currentGroup.mShortcutTargets, currentGroup.mBigrams); 751bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } else { 752bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mPositions.removeLast(); 753bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard currentPos = mPositions.getLast(); 754bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard mCurrentString.setLength(mCurrentString.length() - mPositions.getLast().length); 755bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 756bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } while(true); 757bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 758bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 759bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard @Override 760bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public void remove() { 761bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard throw new UnsupportedOperationException("Unsupported yet"); 762bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 763bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 764bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 765bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard 766bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard /** 767bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * Method to return an iterator. 768bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * 769bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * This method enables Java's enhanced for loop. With this you can have a FusionDictionary x 770bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard * and say : for (Word w : x) {} 771bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard */ 772bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard @Override 773bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard public Iterator<Word> iterator() { 774bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard return new DictionaryIterator(mRoot.mData); 775bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard } 776bfbbee8c5757aef4a20879547c16af0a4d1bf4c7Jean Chalard} 777