forked from eskriett/spell
-
Notifications
You must be signed in to change notification settings - Fork 0
/
spell_test.go
312 lines (278 loc) · 6.71 KB
/
spell_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
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
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
package spell_test
import (
"errors"
"fmt"
"os"
"sort"
"testing"
"github.com/eskriett/spell"
"github.com/eskriett/strmet"
)
func BenchmarkSpell_Lookup(b *testing.B) {
s, err := newWithExample()
if err != nil {
b.Fatal(err)
}
for n := 0; n < b.N; n++ {
if _, err := s.Lookup("exampl"); err != nil {
b.Fatal(err)
}
}
}
func ExampleSpell_AddEntry() {
// Create a new speller
s := spell.New()
// Add a new word, "example" to the dictionary
_, _ = s.AddEntry(spell.Entry{
Frequency: 10,
Word: "example",
})
// Overwrite the data for word "example"
_, _ = s.AddEntry(spell.Entry{
Frequency: 100,
Word: "example",
})
// Output the frequency for word "example"
entry, _ := s.GetEntry("example")
fmt.Printf("Output for word 'example' is: %v\n",
entry.Frequency)
// Output:
// Output for word 'example' is: 100
}
func ExampleSpell_Lookup() {
// Create a new speller
s := spell.New()
_, _ = s.AddEntry(spell.Entry{
Frequency: 1,
Word: "example",
})
// Perform a default lookup for example
suggestions, _ := s.Lookup("eample")
fmt.Printf("Suggestions are: %v\n", suggestions)
// Output:
// Suggestions are: [example]
}
func ExampleSpell_Lookup_configureEditDistance() {
// Create a new speller
s := spell.New()
_, _ = s.AddEntry(spell.Entry{
Frequency: 1,
Word: "example",
})
// Lookup exact matches, i.e. edit distance = 0
suggestions, _ := s.Lookup("eample", spell.EditDistance(0))
fmt.Printf("Suggestions are: %v\n", suggestions)
// Output:
// Suggestions are: []
}
func ExampleSpell_Lookup_configureDistanceFunc() {
// Create a new speller
s := spell.New()
_, _ = s.AddEntry(spell.Entry{
Frequency: 1,
Word: "example",
})
// Configure the Lookup to use Levenshtein distance rather than the default
// Damerau Levenshtein calculation
_, _ = s.Lookup("example", spell.DistanceFunc(func(r1, r2 []rune, maxDist int) int {
// Call the Levenshtein function from github.com/eskriett/strmet
return strmet.LevenshteinRunes(r1, r2, maxDist)
}))
}
func ExampleSpell_Lookup_configureSortFunc() {
// Create a new speller
s := spell.New()
_, _ = s.AddEntry(spell.Entry{
Frequency: 1,
Word: "example",
})
// Configure suggestions to be sorted solely by their frequency
_, _ = s.Lookup("example", spell.SortFunc(func(sl spell.SuggestionList) {
sort.Slice(sl, func(i, j int) bool {
return sl[i].Frequency < sl[j].Frequency
})
}))
}
func ExampleSpell_Segment() {
// Create a new speller
s := spell.New()
_, _ = s.AddEntry(spell.Entry{Frequency: 1, Word: "the"})
_, _ = s.AddEntry(spell.Entry{Frequency: 1, Word: "quick"})
_, _ = s.AddEntry(spell.Entry{Frequency: 1, Word: "brown"})
_, _ = s.AddEntry(spell.Entry{Frequency: 1, Word: "fox"})
// Segment a string with word concatenated together
segmentResult, _ := s.Segment("thequickbrownfox")
fmt.Println(segmentResult)
// Output:
// the quick brown fox
}
func newWithExample() (*spell.Spell, error) {
s := spell.New()
ok, err := s.AddEntry(spell.Entry{
Frequency: 1,
Word: "example",
})
if err != nil {
return s, err
}
if !ok {
return s, errors.New("failed to insert entry")
}
return s, nil
}
func TestAddEntry(t *testing.T) {
_, err := newWithExample()
if err != nil {
t.Fatal(err)
}
}
func TestLookup(t *testing.T) {
s, err := newWithExample()
if err != nil {
t.Fatal(err)
}
suggestions, err := s.Lookup("eample")
if err != nil {
t.Fatal(err)
}
if len(suggestions) != 1 {
t.Fatal("did not get exactly one match")
}
if suggestions[0].Word != "example" {
t.Fatal(fmt.Sprintf("Expected example, got %s", suggestions[0].Word))
}
// Test Unicode strings
suggestions, err = s.Lookup("ex𝐚mple")
if err != nil {
t.Fatal(err)
}
if len(suggestions) != 1 {
t.Fatal("did not get exactly one match")
}
if suggestions[0].Word != "example" {
t.Fatal(fmt.Sprintf("Expected example, got %s", suggestions[0].Word))
}
ok, err := s.AddEntry(spell.Entry{
Frequency: 1,
Word: "ex𝐚mple",
})
if err != nil {
t.Fatal(err)
}
if !ok {
t.Fatal("Failed to add unicode entry")
}
suggestions, err = s.Lookup("ex𝐚mple")
if err != nil {
t.Fatal(err)
}
if suggestions[0].Word != "ex𝐚mple" {
t.Fatal(fmt.Sprintf("Expected ex𝐚mple, got %s", suggestions[0].Word))
}
}
func TestLookup_multipleDictionaries(t *testing.T) {
s, err := newWithExample()
if err != nil {
t.Fatal(err)
}
// Test adding a word to a different dictionary
ok, err := s.AddEntry(spell.Entry{
Word: "française",
}, spell.DictionaryName("french"))
if err != nil {
t.Fatal(err)
}
if !ok {
t.Fatal("Failed to add entry to different dictionary")
}
// Shouldn't get word from default dictionary
suggestions, err := s.Lookup("française")
if err != nil {
t.Fatal(err)
}
if len(suggestions) != 0 {
t.Fatal("Should get no results for word in different dictionary")
}
suggestions, err = s.Lookup("française", spell.DictionaryOpts(spell.DictionaryName("french")))
if err != nil {
t.Fatal(err)
}
if suggestions[0].Word != "française" {
t.Fatal(fmt.Sprintf("Expected ex𝐚mple, got %s", suggestions[0].Word))
}
}
func TestRemoveEntry(t *testing.T) {
s, err := newWithExample()
if err != nil {
t.Fatal(err)
}
if ok, _ := s.RemoveEntry("example"); !ok {
t.Fatal("failed to remove entry")
}
suggestions, err := s.Lookup("example")
if err != nil {
t.Fatal(err)
}
if len(suggestions) != 0 {
t.Fatal("did not get exactly zero matches")
}
if ok, _ := s.RemoveEntry("example"); ok {
t.Fatal("should not remove twice")
}
}
func TestLongestWord(t *testing.T) {
s, err := newWithExample()
if err != nil {
t.Fatal(err)
}
if wordLength := s.GetLongestWord(); wordLength != uint32(len("example")) {
t.Fatal("failed to get longest word length, expected 7 got: ", wordLength)
}
}
func TestSaveLoad(t *testing.T) {
s1, err := newWithExample()
if err != nil {
t.Fatal(err)
}
defer os.Remove("./test.dump")
if err := s1.Save("./test.dump"); err != nil {
t.Fatal(err)
}
s2, err := spell.Load("./test.dump")
if err != nil {
t.Fatal(err)
}
suggestions, err := s2.Lookup("eample")
if err != nil {
t.Fatal(err)
}
if len(suggestions) != 1 {
t.Fatal("did not get exactly one match")
}
if suggestions[0].Word != "example" {
t.Fatal(fmt.Sprintf("Expected example, got %s", suggestions[0].Word))
}
}
func TestCornerCases(t *testing.T) {
s := spell.New()
ok, err := s.AddEntry(spell.Entry{
Frequency: 1,
Word: "",
})
if err != nil {
t.Fatal(err)
}
if !ok {
t.Fatal("failed to add entry to speller")
}
suggestions, err := s.Lookup("a")
if err != nil {
t.Fatal(err)
}
if len(suggestions) != 1 {
t.Fatal("did not get exactly one match")
}
if suggestions[0].Word != "" {
t.Fatal(fmt.Sprintf("Expected ' ', got %s", suggestions[0].Word))
}
}