| 1 | /** |
| 2 | * |
| 3 | */ |
| 4 | package net.digitaltsunami.word.trie; |
| 5 | |
| 6 | /** |
| 7 | * @author dhagberg |
| 8 | * |
| 9 | */ |
| 10 | public class WeightedCharTrieNodeFactory implements CharTrieNodeFactory { |
| 11 | private ExpectedValueWeightTable charFreqTable; |
| 12 | |
| 13 | public WeightedCharTrieNodeFactory(ExpectedValueWeightTable expectedWeights) { |
| 14 | this.charFreqTable = expectedWeights; |
| 15 | } |
| 16 | |
| 17 | /* |
| 18 | * (non-Javadoc) |
| 19 | * |
| 20 | * @see net.digitaltsunami.word.trie.CharTrieNodeFactory#createNode(char) |
| 21 | */ |
| 22 | @Override |
| 23 | public CharTrieNode createNode(char c) { |
| 24 | return new WeightedCharTrieNode(c); |
| 25 | } |
| 26 | |
| 27 | /* |
| 28 | * (non-Javadoc) |
| 29 | * |
| 30 | * @see net.digitaltsunami.word.trie.CharTrieNodeFactory#createRootNode() |
| 31 | */ |
| 32 | @Override |
| 33 | public CharTrieNode createRootNode() { |
| 34 | return new WeightedCharTrieNode(true); |
| 35 | } |
| 36 | |
| 37 | /* |
| 38 | * (non-Javadoc) |
| 39 | * |
| 40 | * @see |
| 41 | * net.digitaltsunami.word.trie.CharTrieNodeFactory#addChild(net.digitaltsunami |
| 42 | * .word.trie.CharTrieNode, char) |
| 43 | */ |
| 44 | @Override |
| 45 | public CharTrieNode addChild(CharTrieNode parentNode, char c) { |
| 46 | float weight = charFreqTable.getExpectedValue(parentNode.getValue(), c); |
| 47 | return ((WeightedCharTrieNode) parentNode).addChild(c, weight); |
| 48 | } |
| 49 | |
| 50 | /* |
| 51 | * (non-Javadoc) |
| 52 | * |
| 53 | * @see |
| 54 | * net.digitaltsunami.word.trie.CharTrieNodeFactory#addChildTerminus(net |
| 55 | * .digitaltsunami.word.trie.CharTrieNode, char) |
| 56 | */ |
| 57 | @Override |
| 58 | public CharTrieTerminusNode addChildTerminus(CharTrieNode parentNode, char c) { |
| 59 | float weight = charFreqTable.getExpectedValue(parentNode.getValue(), c); |
| 60 | LinkedCharTrieNode newNode = (LinkedCharTrieNode) ((WeightedCharTrieNode) parentNode) |
| 61 | .addChild(c, weight); |
| 62 | newNode.setTerminus(true); |
| 63 | return newNode; |
| 64 | } |
| 65 | |
| 66 | /* |
| 67 | * (non-Javadoc) |
| 68 | * |
| 69 | * @see |
| 70 | * net.digitaltsunami.word.trie.CharTrieNodeFactory#addChildTerminus(net |
| 71 | * .digitaltsunami.word.trie.CharTrieNode, char, java.lang.String) |
| 72 | */ |
| 73 | @Override |
| 74 | public CharTrieTerminusNode addChildTerminus(CharTrieNode parentNode, char c, String term) { |
| 75 | float weight = charFreqTable.getExpectedValue(parentNode.getValue(), c); |
| 76 | LinkedCharTrieNode newNode = (LinkedCharTrieNode) ((WeightedCharTrieNode) parentNode) |
| 77 | .addChild(c, weight); |
| 78 | newNode.setTerminus(true); |
| 79 | return newNode; |
| 80 | } |
| 81 | |
| 82 | /* |
| 83 | * (non-Javadoc) |
| 84 | * |
| 85 | * @see |
| 86 | * net.digitaltsunami.word.trie.CharTrieNodeFactory#convertToTerminus(net |
| 87 | * .digitaltsunami.word.trie.CharTrieNode) |
| 88 | */ |
| 89 | @Override |
| 90 | public CharTrieTerminusNode convertToTerminus(CharTrieNode currentNode) { |
| 91 | ((LinkedCharTrieNode) currentNode).setTerminus(true); |
| 92 | return (LinkedCharTrieNode) currentNode; |
| 93 | } |
| 94 | |
| 95 | /* |
| 96 | * (non-Javadoc) |
| 97 | * |
| 98 | * @see |
| 99 | * net.digitaltsunami.word.trie.CharTrieNodeFactory#convertToTerminus(net |
| 100 | * .digitaltsunami.word.trie.CharTrieNode, java.lang.String) |
| 101 | */ |
| 102 | @Override |
| 103 | public CharTrieTerminusNode convertToTerminus(CharTrieNode currentNode, String originalTerm) { |
| 104 | ((LinkedCharTrieNode) currentNode).setTerminus(true); |
| 105 | return (LinkedCharTrieNode) currentNode; |
| 106 | } |
| 107 | |
| 108 | } |