-
Notifications
You must be signed in to change notification settings - Fork 5
/
Scores.java
62 lines (55 loc) · 1.47 KB
/
Scores.java
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
package org.genericsystem.cv;
import java.util.HashMap;
import java.util.Map;
import java.util.Map.Entry;
//TODO compute score / bestText on every add ?
public class Scores {
private final Map<String, Integer> ocrs = new HashMap<>();
public void put(String s) {
Integer count = ocrs.get(s);
ocrs.put(s, 1 + (count != null ? count : 0));
}
public double getBestScore() {
String bestText = "";
int bestScore = 0;
int allOcrs = 0;
for (Entry<String, Integer> entry : ocrs.entrySet()) {
allOcrs += entry.getValue();
if (bestScore < entry.getValue()) {
bestScore = entry.getValue();
bestText = entry.getKey();
}
}
return Integer.valueOf(bestScore).doubleValue() / allOcrs;
}
public String getBestText() {
String bestText = "";
int bestScore = 0;
int allOcrs = 0;
for (Entry<String, Integer> entry : ocrs.entrySet()) {
allOcrs += entry.getValue();
if (bestScore < entry.getValue()) {
bestScore = entry.getValue();
bestText = entry.getKey();
}
}
return bestText;
}
public String getBestText2() {
String bestText = "";
int shorterDistance = Integer.MAX_VALUE;
for (Entry<String, Integer> entry : ocrs.entrySet()) {
if (!entry.getKey().equals("")) {
int d = 0;
for (Entry<String, Integer> entry2 : ocrs.entrySet()) {
d += Levenshtein.distance(entry.getKey(), entry2.getKey());
}
if (d < shorterDistance) {
bestText = entry.getKey();
shorterDistance = d;
}
}
}
return bestText;
}
}