-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathlevenshtein_test.go
153 lines (117 loc) · 2.51 KB
/
levenshtein_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
package benchmarks
import (
"testing"
agnivade "github.com/agnivade/levenshtein"
arbovm "github.com/arbovm/levenshtein"
dgryski "github.com/dgryski/trifles/leven"
honzab "github.com/honzab/levenshtein"
kse "github.com/kse/levenshtein"
philpearl "github.com/philpearl/levenshtein"
texttheater "github.com/texttheater/golang-levenshtein/levenshtein"
)
func BenchmarkLevenshtein_philpearl(b *testing.B) {
s1 := "frederick"
s2 := "fredelstick"
total := 0
b.ReportAllocs()
b.ResetTimer()
c := &philpearl.Context{}
for i := 0; i < b.N; i++ {
total += c.Distance(s1, s2)
}
if total == 0 {
b.Logf("total is %d", total)
}
}
func BenchmarkLevenshtein_long(b *testing.B) {
s1 := "frederick"
s2 := "fredelstick"
total := 0
b.ReportAllocs()
b.ResetTimer()
for i := 0; i < b.N; i++ {
total += levDist(s1, s2)
}
if total == 0 {
b.Logf("total is %d", total)
}
}
func BenchmarkLevenshtein_dgryski(b *testing.B) {
s1 := "frederick"
s2 := "fredelstick"
total := 0
b.ReportAllocs()
b.ResetTimer()
for i := 0; i < b.N; i++ {
total += dgryski.Levenshtein([]rune(s1), []rune(s2))
}
if total == 0 {
b.Logf("total is %d", total)
}
}
func BenchmarkLevenshtein_texttheater(b *testing.B) {
s1 := []rune("frederick")
s2 := []rune("fredelstick")
total := 0
b.ReportAllocs()
b.ResetTimer()
for i := 0; i < b.N; i++ {
total += texttheater.DistanceForStrings(s1, s2, texttheater.DefaultOptions)
}
if total == 0 {
b.Logf("total is %d", total)
}
}
func BenchmarkLevenshtein_kse(b *testing.B) {
s1 := []byte("frederick")
s2 := []byte("fredelstick")
total := 0
lev := kse.New(1, 1, 1)
b.ReportAllocs()
b.ResetTimer()
for i := 0; i < b.N; i++ {
total += lev.Dist(s1, s2)
}
if total == 0 {
b.Logf("total is %d", total)
}
}
func BenchmarkLevenshtein_honzab(b *testing.B) {
s1 := "frederick"
s2 := "fredelstick"
total := 0
b.ReportAllocs()
b.ResetTimer()
for i := 0; i < b.N; i++ {
total += honzab.Distance(s1, s2)
}
if total == 0 {
b.Logf("total is %d", total)
}
}
func BenchmarkLevenshtein_arbovm(b *testing.B) {
s1 := "frederick"
s2 := "fredelstick"
total := 0
b.ReportAllocs()
b.ResetTimer()
for i := 0; i < b.N; i++ {
total += arbovm.Distance(s1, s2)
}
if total == 0 {
b.Logf("total is %d", total)
}
}
func BenchmarkLevenshtein_agnivade(b *testing.B) {
s1 := "frederick"
s2 := "fredelstick"
total := 0
b.ReportAllocs()
b.ResetTimer()
for i := 0; i < b.N; i++ {
total += agnivade.ComputeDistance(s1, s2)
}
if total == 0 {
b.Logf("total is %d", total)
}
}