MFB.java
5.79 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
package is2.data;
import java.io.DataInputStream;
import java.io.DataOutputStream;
import java.io.IOException;
import java.util.HashMap;
import java.util.Map.Entry;
import is2.util.DB;
/**
* Map Features, do not map long to integer
*
* @author Bernd Bohnet, 20.09.2009
*/
final public class MFB implements IEncoderPlus {
/** The features and its values */
static private final HashMap<String, HashMap<String, Integer>> m_featureSets = new HashMap<String, HashMap<String, Integer>>();
/** The feature class and the number of values */
static private final HashMap<String, Integer> m_featureCounters = new HashMap<String, Integer>();
/** The number of bits needed to encode a feature */
static final HashMap<String, Integer> m_featureBits = new HashMap<String, Integer>();
/** Integer counter for long2int */
static private int count = 0;
/** Stop growing */
public boolean stop = false;
final public static String NONE = "<None>";
public MFB() {
}
public int size() {
return count;
}
/**
* Register an attribute class, if it not exists and add a possible value
*
* @param type
* @param type2
*/
@Override
final public int register(String a, String v) {
synchronized (m_featureCounters) {
HashMap<String, Integer> fs = getFeatureSet().get(a);
if (fs == null) {
fs = new HashMap<String, Integer>();
getFeatureSet().put(a, fs);
fs.put(NONE, 0);
getFeatureCounter().put(a, 1);
}
Integer i = fs.get(v);
if (i == null) {
Integer c = getFeatureCounter().get(a);
fs.put(v, c);
c++;
getFeatureCounter().put(a, c);
return c - 1;
} else
return i;
}
}
/**
* Calculates the number of bits needed to encode a feature
*/
public void calculateBits() {
for (Entry<String, Integer> e : getFeatureCounter().entrySet()) {
int bits = (int) Math.ceil((Math.log(e.getValue() + 1) / Math.log(2)));
m_featureBits.put(e.getKey(), bits);
}
// System.out.println("total number of needed bits "+total);
}
@Override
public String toString() {
StringBuffer content = new StringBuffer();
for (Entry<String, Integer> e : getFeatureCounter().entrySet()) {
content.append(e.getKey() + " " + e.getValue());
content.append(':');
// HashMap<String,Integer> vs = getFeatureSet().get(e.getKey());
content.append(getFeatureBits(e.getKey()));
/*
* if (vs.size()<120) for(Entry<String,Integer> e2 : vs.entrySet())
* { content.append(e2.getKey()+" ("+e2.getValue()+") "); }
*/
content.append('\n');
}
return content.toString();
}
static final public short getFeatureBits(String a) {
if (m_featureBits.get(a) == null)
return 0;
return (short) m_featureBits.get(a).intValue();
}
/**
* Get the integer place holder of the string value v of the type a
*
* @param t
* the type
* @param v
* the value
* @return the integer place holder of v
*/
@Override
final public int getValue(String t, String v) {
if (m_featureSets.get(t) == null)
return -1;
Integer vi = m_featureSets.get(t).get(v);
if (vi == null)
return -1; // stop &&
return vi.intValue();
}
/**
* Static version of getValue
*
* @see getValue
*/
static final public int getValueS(String a, String v) {
if (m_featureSets.get(a) == null)
return -1;
Integer vi = m_featureSets.get(a).get(v);
if (vi == null)
return -1; // stop &&
return vi.intValue();
}
public int hasValue(String a, String v) {
Integer vi = m_featureSets.get(a).get(v);
if (vi == null)
return -1;
return vi.intValue();
}
public static String printBits(int k) {
StringBuffer s = new StringBuffer();
for (int i = 0; i < 31; i++) {
s.append((k & 0x00000001) == 1 ? '1' : '0');
k = k >> 1;
}
s.reverse();
return s.toString();
}
/**
* Maps a long to a integer value. This is very useful to save memory for
* sparse data long values
*
* @param l
* @return the integer
*/
static public int misses = 0;
static public int good = 0;
/**
* Write the data
*
* @param dos
* @throws IOException
*/
static public void writeData(DataOutputStream dos) throws IOException {
dos.writeInt(getFeatureSet().size());
// DB.println("write"+getFeatureSet().size());
for (Entry<String, HashMap<String, Integer>> e : getFeatureSet().entrySet()) {
dos.writeUTF(e.getKey());
dos.writeInt(e.getValue().size());
for (Entry<String, Integer> e2 : e.getValue().entrySet()) {
if (e2.getKey() == null)
DB.println("key " + e2.getKey() + " value " + e2.getValue() + " e -key " + e.getKey());
dos.writeUTF(e2.getKey());
dos.writeInt(e2.getValue());
}
}
}
public void read(DataInputStream din) throws IOException {
int size = din.readInt();
for (int i = 0; i < size; i++) {
String k = din.readUTF();
int size2 = din.readInt();
HashMap<String, Integer> h = new HashMap<String, Integer>();
getFeatureSet().put(k, h);
for (int j = 0; j < size2; j++) {
h.put(din.readUTF(), din.readInt());
}
getFeatureCounter().put(k, size2);
}
count = size;
// stop();
calculateBits();
}
/**
* Clear the data
*/
static public void clearData() {
getFeatureSet().clear();
m_featureBits.clear();
getFeatureSet().clear();
}
@Override
public HashMap<String, Integer> getFeatureCounter() {
return m_featureCounters;
}
static public HashMap<String, HashMap<String, Integer>> getFeatureSet() {
return m_featureSets;
}
static public String[] reverse(HashMap<String, Integer> v) {
String[] set = new String[v.size()];
for (Entry<String, Integer> e : v.entrySet()) {
set[e.getValue()] = e.getKey();
}
return set;
}
}