-
-
Notifications
You must be signed in to change notification settings - Fork 20
/
suggest.js
362 lines (291 loc) · 7.91 KB
/
suggest.js
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
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
'use strict'
var casing = require('./util/casing.js')
var normalize = require('./util/normalize.js')
var flag = require('./util/flag.js')
var form = require('./util/form.js')
module.exports = suggest
var push = [].push
var noSuggestType = 'NOSUGGEST'
// Suggest spelling for `value`.
// eslint-disable-next-line complexity
function suggest(value) {
var self = this
var replacementTable = self.replacementTable
var conversion = self.conversion
var groups = self.flags.KEY
var charAdded = {}
var suggestions = []
var weighted = {}
var memory
var replacement
var edits = []
var values
var index
var length
var offset
var position
var count
var otherOffset
var otherCount
var otherCharacter
var character
var group
var before
var after
var upper
var insensitive
var firstLevel
var previous
var next
var nextCharacter
var max
var distance
var size
var normalized
var suggestion
var currentCase
value = normalize(value.trim(), conversion.in)
if (!value || self.correct(value)) {
return []
}
currentCase = casing(value)
// Check the replacement table.
length = replacementTable.length
index = -1
while (++index < length) {
replacement = replacementTable[index]
offset = value.indexOf(replacement[0])
while (offset !== -1) {
edits.push(value.replace(replacement[0], replacement[1]))
offset = value.indexOf(replacement[0], offset + 1)
}
}
// Check the keyboard.
length = value.length
index = -1
while (++index < length) {
character = value.charAt(index)
before = value.slice(0, index)
after = value.slice(index + 1)
insensitive = character.toLowerCase()
upper = insensitive !== character
charAdded = {}
offset = -1
count = groups.length
while (++offset < count) {
group = groups[offset]
position = group.indexOf(insensitive)
if (position === -1) {
continue
}
otherOffset = -1
otherCount = group.length
while (++otherOffset < otherCount) {
if (otherOffset !== position) {
otherCharacter = group.charAt(otherOffset)
if (charAdded[otherCharacter]) {
continue
}
charAdded[otherCharacter] = true
if (upper) {
otherCharacter = otherCharacter.toUpperCase()
}
edits.push(before + otherCharacter + after)
}
}
}
}
// Check cases where one of a double character was forgotten, or one too many
// were added, up to three “distances”. This increases the success-rate by 2%
// and speeds the process up by 13%.
length = value.length
index = -1
nextCharacter = value.charAt(0)
values = ['']
max = 1
distance = 0
while (++index < length) {
character = nextCharacter
nextCharacter = value.charAt(index + 1)
before = value.slice(0, index)
replacement = character === nextCharacter ? '' : character + character
offset = -1
count = values.length
while (++offset < count) {
if (offset <= max) {
values.push(values[offset] + replacement)
}
values[offset] += character
}
if (++distance < 3) {
max = values.length
}
}
push.apply(edits, values)
// Ensure the lower-cased, capitalised, and uppercase values are included.
values = [value]
replacement = value.toLowerCase()
if (value === replacement) {
values.push(value.charAt(0).toUpperCase() + replacement.slice(1))
} else {
values.push(replacement)
}
replacement = value.toUpperCase()
if (value !== replacement) {
values.push(replacement)
}
// Construct a memory object for `generate`.
memory = {
state: {},
weighted: weighted,
suggestions: suggestions
}
firstLevel = generate(self, memory, values, edits)
// While there are no suggestions based on generated values with an
// edit-distance of `1`, check the generated values, `SIZE` at a time.
// Basically, we’re generating values with an edit-distance of `2`, but were
// doing it in small batches because it’s such an expensive operation.
previous = 0
max = Math.pow(Math.max(15 - value.length, 3), 3)
max = Math.min(firstLevel.length, max)
size = Math.max(Math.pow(10 - value.length, 3), 1)
while (!suggestions.length && previous < max) {
next = previous + size
generate(self, memory, firstLevel.slice(previous, next))
previous = next
}
// Sort the suggestions based on their weight.
suggestions.sort(sort)
// Normalize the output.
values = []
normalized = []
index = -1
length = suggestions.length
while (++index < length) {
suggestion = normalize(suggestions[index], conversion.out)
suggestions[index] = suggestion
replacement = suggestion.toLowerCase()
if (normalized.indexOf(replacement) === -1) {
values.push(suggestion)
normalized.push(replacement)
}
}
// BOOM! All done!
return values
function sort(a, b) {
return sortWeight(a, b) || sortCasing(a, b) || sortAlpha(a, b)
}
function sortWeight(a, b) {
if (weighted[a] === weighted[b]) {
return 0
}
return weighted[a] > weighted[b] ? -1 : 1
}
function sortCasing(a, b) {
var leftCasing = casing(a)
var rightCasing = casing(b)
if (leftCasing !== rightCasing) {
if (leftCasing === currentCase) {
return -1
}
if (rightCasing === currentCase) {
return 1
}
}
return 0
}
function sortAlpha(a, b) {
return a.localeCompare(b)
}
}
// Get a list of values close in edit distance to `words`.
function generate(context, memory, words, edits) {
var characters = context.flags.TRY
var characterLength = characters.length
var data = context.data
var flags = context.flags
var result = []
var upper
var length
var index
var word
var position
var count
var before
var after
var nextAfter
var nextNextAfter
var character
var nextCharacter
var inject
var offset
// Check the pre-generated edits.
length = edits && edits.length
index = -1
while (++index < length) {
check(edits[index], true)
}
// Iterate over given word.
length = words.length
index = -1
while (++index < length) {
word = words[index]
before = ''
character = ''
nextAfter = word
nextNextAfter = word.slice(1)
nextCharacter = word.charAt(0)
position = -1
count = word.length + 1
// Iterate over every character (including the end).
while (++position < count) {
before += character
after = nextAfter
nextAfter = nextNextAfter
nextNextAfter = nextAfter.slice(1)
character = nextCharacter
nextCharacter = word.charAt(position + 1)
upper = character.toLowerCase() !== character
// Remove.
check(before + nextAfter)
// Switch.
if (nextAfter) {
check(before + nextCharacter + character + nextNextAfter)
}
// Iterate over all possible letters.
offset = -1
while (++offset < characterLength) {
inject = characters[offset]
// Add and replace.
check(before + inject + after)
check(before + inject + nextAfter)
// Try upper-case if the original character was upper-cased.
if (upper && inject !== inject.toUpperCase()) {
inject = inject.toUpperCase()
check(before + inject + after)
check(before + inject + nextAfter)
}
}
}
}
// Return the list of generated words.
return result
// Check and handle a generated value.
function check(value, double) {
var state = memory.state[value]
var corrected
if (state !== Boolean(state)) {
result.push(value)
corrected = form(context, value)
state = corrected && !flag(flags, noSuggestType, data[corrected])
memory.state[value] = state
if (state) {
memory.weighted[value] = double ? 10 : 0
memory.suggestions.push(value)
}
}
if (state) {
memory.weighted[value]++
}
}
}