-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy pathBeda_test.go
174 lines (163 loc) · 3.34 KB
/
Beda_test.go
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
package beda
import "testing"
type TestLehvenstein struct {
S1 string
S2 string
D int
}
func TestLevenshteinDistance(t *testing.T) {
testData := make([]*TestLehvenstein, 0)
testData = append(testData, &TestLehvenstein{
S1: "abc",
S2: "abd",
D: 1,
}, &TestLehvenstein{
S1: "abc",
S2: "abc",
D: 0,
}, &TestLehvenstein{
S1: "abc",
S2: "ade",
D: 2,
}, &TestLehvenstein{
S1: "abc",
S2: "def",
D: 3,
}, &TestLehvenstein{
S1: "abc",
S2: "abca",
D: 1,
}, &TestLehvenstein{
S1: "abc",
S2: "abcabc",
D: 3,
}, &TestLehvenstein{
S1: "abc",
S2: "ab",
D: 1,
}, &TestLehvenstein{
S1: "abc",
S2: "",
D: 3,
})
for _, td := range testData {
sd := NewStringDiff(td.S1, td.S2)
if sd.LevenshteinDistance() != td.D {
t.Error("Distance between", td.S1, "and", td.S2, "expected to", td.D, "but", sd.LevenshteinDistance())
}
}
}
type TestTrigram struct {
S1 string
S2 string
D float32
}
func TestTrigramCompare(t *testing.T) {
testData := make([]*TestTrigram, 0)
testData = append(testData, &TestTrigram{
S1: "Twitter v1",
S2: "Twitter v2",
D: 0.6666667,
}, &TestTrigram{
S1: "Twitter v1",
S2: "Twitter v1",
D: 1,
})
for _, td := range testData {
sd := NewStringDiff(td.S1, td.S2)
if sd.TrigramCompare() != td.D {
t.Error("trigram Compare between", td.S1, "and", td.S2, "expected to", td.D, "but", sd.TrigramCompare())
}
}
}
type TestJaroDistancce struct {
S1 string
S2 string
DJ float32
}
func TestJaroDistance(t *testing.T) {
testData := make([]*TestJaroDistancce, 0)
testData = append(testData, &TestJaroDistancce{
S1: "martha",
S2: "marhta",
DJ: 0.9444444,
}, &TestJaroDistancce{
S1: "martha",
S2: "martha",
DJ: 1,
})
for _, td := range testData {
sd := NewStringDiff(td.S1, td.S2)
if sd.JaroDistance() != td.DJ {
t.Error("Jaro Distance between", td.S1, "and", td.S2, "expected to", td.DJ, "but", sd.JaroDistance())
}
}
}
func TestJaroWinklerDistance(t *testing.T) {
testData := make([]*TestJaroDistancce, 0)
testData = append(testData, &TestJaroDistancce{
S1: "martha",
S2: "marhta",
DJ: 0.96111107,
}, &TestJaroDistancce{
S1: "martha",
S2: "martha",
DJ: 1,
})
for _, td := range testData {
sd := NewStringDiff(td.S1, td.S2)
if sd.JaroWinklerDistance(0.1) != td.DJ {
t.Error("Jaro Distance between", td.S1, "and", td.S2, "expected to", td.DJ, "but", sd.JaroWinklerDistance(0.1))
}
}
}
func TestDamerauLevenshteinDistance(t *testing.T) {
testData := make([]*TestLehvenstein, 0)
testData = append(testData, &TestLehvenstein{
S1: "abc",
S2: "abd",
D: 1,
}, &TestLehvenstein{
S1: "abc",
S2: "abc",
D: 0,
}, &TestLehvenstein{
S1: "abc",
S2: "ade",
D: 2,
}, &TestLehvenstein{
S1: "abc",
S2: "def",
D: 3,
}, &TestLehvenstein{
S1: "abc",
S2: "abca",
D: 1,
}, &TestLehvenstein{
S1: "abc",
S2: "abcabc",
D: 3,
}, &TestLehvenstein{
S1: "abc",
S2: "ab",
D: 1,
}, &TestLehvenstein{
S1: "abc",
S2: "",
D: 3,
}, &TestLehvenstein{ // test swap
S1: "abcde",
S2: "abced",
D: 1,
}, &TestLehvenstein{ // test swap
S1: "abcde",
S2: "ebcda",
D: 2,
})
for _, td := range testData {
sd := NewStringDiff(td.S1, td.S2)
if sd.DamerauLevenshteinDistance(1,1,1,1) != td.D {
t.Error("Distance between", td.S1, "and", td.S2, "expected to", td.D, "but", sd.DamerauLevenshteinDistance(1,1,1,1))
}
}
}