1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
|
+
|
// STRING TRANSFORMATION
/* jshint esversion:6, -W097 */
/* jslint esversion:6 */
/* global exports, console */
"use strict";
if (typeof(process) !== 'undefined') {
var char_player = require("./char_player.js");
}
// Note: 48 is the ASCII code for "0"
var str_transform = {
getNgrams: function (sWord, n=2) {
let lNgrams = [];
|
148
149
150
151
152
153
154
155
156
157
158
159
160
161
|
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
|
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
|
}
return matrix[nLen1][nLen2];
}
catch (e) {
console.error(e);
}
},
distanceJaroWinkler: function(a, b, boost = .666) {
// https://github.com/thsig/jaro-winkler-JS
//if (a == b) { return 1.0; }
let a_len = a.length;
let b_len = b.length;
let a_flag = [];
let b_flag = [];
let search_range = Math.floor(Math.max(a_len, b_len) / 2) - 1;
let minv = Math.min(a_len, b_len);
// Looking only within the search range, count and flag the matched pairs.
let Num_com = 0;
let yl1 = b_len - 1;
for (let i = 0; i < a_len; i++) {
let lowlim = (i >= search_range) ? i - search_range : 0;
let hilim = ((i + search_range) <= yl1) ? (i + search_range) : yl1;
for (let j = lowlim; j <= hilim; j++) {
if (b_flag[j] !== 1 && a[j] === b[i]) {
a_flag[j] = 1;
b_flag[i] = 1;
Num_com++;
break;
}
}
}
// Return if no characters in common
if (Num_com === 0) { return 0.0; }
// Count the number of transpositions
let k = 0;
let N_trans = 0;
for (let i = 0; i < a_len; i++) {
if (a_flag[i] === 1) {
let j;
for (j = k; j < b_len; j++) {
if (b_flag[j] === 1) {
k = j + 1;
break;
}
}
if (a[i] !== b[j]) { N_trans++; }
}
}
N_trans = Math.floor(N_trans / 2);
// Adjust for similarities in nonmatched characters
let N_simi = 0;
let adjwt = char_player.oDistanceBetweenChars;
if (minv > Num_com) {
for (let i = 0; i < a_len; i++) {
if (!a_flag[i]) {
for (let j = 0; j < b_len; j++) {
if (!b_flag[j]) {
if (adjwt[a[i]] && adjwt[a[i]][b[j]]) {
N_simi += adjwt[a[i]][b[j]] * 10; // le fois 10 est un ajustement pour que ça fonctionne bien dans cette fonction
b_flag[j] = 2;
break;
}
}
}
}
}
}
let Num_sim = (N_simi / 10.0) + Num_com;
// Main weight computation
let weight = Num_sim / a_len + Num_sim / b_len + (Num_com - N_trans) / Num_com;
weight = weight / 3;
// Continue to boost the weight if the strings are similar
if (weight > boost) {
// Adjust for having up to the first 4 characters in common
let j = (minv >= 4) ? 4 : minv;
let i;
for (i = 0; (i < j) && a[i] === b[i]; i++) { }
if (i) { weight += i * 0.1 * (1.0 - weight) };
// Adjust for long strings.
// After agreeing beginning chars, at least two more must agree
// and the agreeing characters must be more than half of the
// remaining characters.
if (minv > 4 && Num_com > i + 1 && 2 * Num_com >= minv + i) {
weight += (1 - weight) * ((Num_com - i - 1) / (a_len * b_len - i*2 + 2));
}
}
return weight;
},
showDistance (s1, s2) {
console.log(`Distance: ${s1} / ${s2} = ${this.distanceDamerauLevenshtein(s1, s2)})`);
},
// Suffix only
defineSuffixCode: function (sFlex, sStem) {
|