diff --git a/node_modules/fastest-levenshtein/bench.js b/node_modules/fastest-levenshtein/bench.js
new file mode 100644
index 0000000000000..1fd420bd737e8
--- /dev/null
+++ b/node_modules/fastest-levenshtein/bench.js
@@ -0,0 +1,96 @@
+"use strict";
+exports.__esModule = true;
+/* eslint-disable @typescript-eslint/no-var-requires */
+/* eslint-disable no-console */
+var Benchmark = require("benchmark");
+var mod_js_1 = require("./mod.js");
+var fast_levenshtein_1 = require("fast-levenshtein");
+var fs = require("fs");
+var jslevenshtein = require("js-levenshtein");
+var leven = require("leven");
+var levenshteinEditDistance = require("levenshtein-edit-distance");
+var suite = new Benchmark.Suite();
+var randomstring = function (length) {
+    var result = "";
+    var characters = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789";
+    var charactersLength = characters.length;
+    for (var i = 0; i < length; i++) {
+        result += characters.charAt(Math.floor(Math.random() * charactersLength));
+    }
+    return result;
+};
+var randomstringArr = function (stringSize, arraySize) {
+    var i = 0;
+    var arr = [];
+    for (i = 0; i < arraySize; i++) {
+        arr.push(randomstring(stringSize));
+    }
+    return arr;
+};
+var arrSize = 1000;
+if (!fs.existsSync("data.json")) {
+    var data_1 = [
+        randomstringArr(4, arrSize),
+        randomstringArr(8, arrSize),
+        randomstringArr(16, arrSize),
+        randomstringArr(32, arrSize),
+        randomstringArr(64, arrSize),
+        randomstringArr(128, arrSize),
+        randomstringArr(256, arrSize),
+        randomstringArr(512, arrSize),
+        randomstringArr(1024, arrSize),
+    ];
+    fs.writeFileSync("data.json", JSON.stringify(data_1));
+}
+var data = JSON.parse(fs.readFileSync("data.json", "utf8"));
+var _loop_1 = function (i) {
+    var datapick = data[i];
+    if (process.argv[2] !== "no") {
+        suite
+            .add("".concat(i, " - js-levenshtein"), function () {
+            for (var j = 0; j < arrSize - 1; j += 2) {
+                jslevenshtein(datapick[j], datapick[j + 1]);
+            }
+        })
+            .add("".concat(i, " - leven"), function () {
+            for (var j = 0; j < arrSize - 1; j += 2) {
+                leven(datapick[j], datapick[j + 1]);
+            }
+        })
+            .add("".concat(i, " - fast-levenshtein"), function () {
+            for (var j = 0; j < arrSize - 1; j += 2) {
+                (0, fast_levenshtein_1.get)(datapick[j], datapick[j + 1]);
+            }
+        })
+            .add("".concat(i, " - levenshtein-edit-distance"), function () {
+            for (var j = 0; j < arrSize - 1; j += 2) {
+                levenshteinEditDistance(datapick[j], datapick[j + 1]);
+            }
+        });
+    }
+    suite.add("".concat(i, " - fastest-levenshtein"), function () {
+        for (var j = 0; j < arrSize - 1; j += 2) {
+            (0, mod_js_1.distance)(datapick[j], datapick[j + 1]);
+        }
+    });
+};
+// BENCHMARKS
+for (var i = 0; i < 9; i++) {
+    _loop_1(i);
+}
+var results = new Map();
+suite
+    .on("cycle", function (event) {
+    console.log(String(event.target));
+    if (results.has(event.target.name[0])) {
+        results.get(event.target.name[0]).push(event.target.hz);
+    }
+    else {
+        results.set(event.target.name[0], [event.target.hz]);
+    }
+})
+    .on("complete", function () {
+    console.log(results);
+})
+    // run async
+    .run({ async: true });
diff --git a/node_modules/fastest-levenshtein/esm/mod.d.ts b/node_modules/fastest-levenshtein/esm/mod.d.ts
new file mode 100644
index 0000000000000..50927ef500580
--- /dev/null
+++ b/node_modules/fastest-levenshtein/esm/mod.d.ts
@@ -0,0 +1,4 @@
+declare const distance: (a: string, b: string) => number;
+declare const closest: (str: string, arr: readonly string[]) => string;
+export { closest, distance };
+//# sourceMappingURL=mod.d.ts.map
\ No newline at end of file
diff --git a/node_modules/fastest-levenshtein/esm/mod.d.ts.map b/node_modules/fastest-levenshtein/esm/mod.d.ts.map
new file mode 100644
index 0000000000000..7fd5c175637b3
--- /dev/null
+++ b/node_modules/fastest-levenshtein/esm/mod.d.ts.map
@@ -0,0 +1 @@
+{"version":3,"file":"mod.d.ts","sourceRoot":"","sources":["../mod.ts"],"names":[],"mappings":"AAiHA,QAAA,MAAM,QAAQ,MAAO,MAAM,KAAK,MAAM,KAAG,MAaxC,CAAC;AAEF,QAAA,MAAM,OAAO,QAAS,MAAM,OAAO,SAAS,MAAM,EAAE,KAAG,MAWtD,CAAC;AAEF,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC"}
\ No newline at end of file
diff --git a/node_modules/fastest-levenshtein/esm/mod.js b/node_modules/fastest-levenshtein/esm/mod.js
new file mode 100644
index 0000000000000..719f2b8fdade9
--- /dev/null
+++ b/node_modules/fastest-levenshtein/esm/mod.js
@@ -0,0 +1,138 @@
+const peq = new Uint32Array(0x10000);
+const myers_32 = (a, b) => {
+    const n = a.length;
+    const m = b.length;
+    const lst = 1 << (n - 1);
+    let pv = -1;
+    let mv = 0;
+    let sc = n;
+    let i = n;
+    while (i--) {
+        peq[a.charCodeAt(i)] |= 1 << i;
+    }
+    for (i = 0; i < m; i++) {
+        let eq = peq[b.charCodeAt(i)];
+        const xv = eq | mv;
+        eq |= ((eq & pv) + pv) ^ pv;
+        mv |= ~(eq | pv);
+        pv &= eq;
+        if (mv & lst) {
+            sc++;
+        }
+        if (pv & lst) {
+            sc--;
+        }
+        mv = (mv << 1) | 1;
+        pv = (pv << 1) | ~(xv | mv);
+        mv &= xv;
+    }
+    i = n;
+    while (i--) {
+        peq[a.charCodeAt(i)] = 0;
+    }
+    return sc;
+};
+const myers_x = (b, a) => {
+    const n = a.length;
+    const m = b.length;
+    const mhc = [];
+    const phc = [];
+    const hsize = Math.ceil(n / 32);
+    const vsize = Math.ceil(m / 32);
+    for (let i = 0; i < hsize; i++) {
+        phc[i] = -1;
+        mhc[i] = 0;
+    }
+    let j = 0;
+    for (; j < vsize - 1; j++) {
+        let mv = 0;
+        let pv = -1;
+        const start = j * 32;
+        const vlen = Math.min(32, m) + start;
+        for (let k = start; k < vlen; k++) {
+            peq[b.charCodeAt(k)] |= 1 << k;
+        }
+        for (let i = 0; i < n; i++) {
+            const eq = peq[a.charCodeAt(i)];
+            const pb = (phc[(i / 32) | 0] >>> i) & 1;
+            const mb = (mhc[(i / 32) | 0] >>> i) & 1;
+            const xv = eq | mv;
+            const xh = ((((eq | mb) & pv) + pv) ^ pv) | eq | mb;
+            let ph = mv | ~(xh | pv);
+            let mh = pv & xh;
+            if ((ph >>> 31) ^ pb) {
+                phc[(i / 32) | 0] ^= 1 << i;
+            }
+            if ((mh >>> 31) ^ mb) {
+                mhc[(i / 32) | 0] ^= 1 << i;
+            }
+            ph = (ph << 1) | pb;
+            mh = (mh << 1) | mb;
+            pv = mh | ~(xv | ph);
+            mv = ph & xv;
+        }
+        for (let k = start; k < vlen; k++) {
+            peq[b.charCodeAt(k)] = 0;
+        }
+    }
+    let mv = 0;
+    let pv = -1;
+    const start = j * 32;
+    const vlen = Math.min(32, m - start) + start;
+    for (let k = start; k < vlen; k++) {
+        peq[b.charCodeAt(k)] |= 1 << k;
+    }
+    let score = m;
+    for (let i = 0; i < n; i++) {
+        const eq = peq[a.charCodeAt(i)];
+        const pb = (phc[(i / 32) | 0] >>> i) & 1;
+        const mb = (mhc[(i / 32) | 0] >>> i) & 1;
+        const xv = eq | mv;
+        const xh = ((((eq | mb) & pv) + pv) ^ pv) | eq | mb;
+        let ph = mv | ~(xh | pv);
+        let mh = pv & xh;
+        score += (ph >>> (m - 1)) & 1;
+        score -= (mh >>> (m - 1)) & 1;
+        if ((ph >>> 31) ^ pb) {
+            phc[(i / 32) | 0] ^= 1 << i;
+        }
+        if ((mh >>> 31) ^ mb) {
+            mhc[(i / 32) | 0] ^= 1 << i;
+        }
+        ph = (ph << 1) | pb;
+        mh = (mh << 1) | mb;
+        pv = mh | ~(xv | ph);
+        mv = ph & xv;
+    }
+    for (let k = start; k < vlen; k++) {
+        peq[b.charCodeAt(k)] = 0;
+    }
+    return score;
+};
+const distance = (a, b) => {
+    if (a.length < b.length) {
+        const tmp = b;
+        b = a;
+        a = tmp;
+    }
+    if (b.length === 0) {
+        return a.length;
+    }
+    if (a.length <= 32) {
+        return myers_32(a, b);
+    }
+    return myers_x(a, b);
+};
+const closest = (str, arr) => {
+    let min_distance = Infinity;
+    let min_index = 0;
+    for (let i = 0; i < arr.length; i++) {
+        const dist = distance(str, arr[i]);
+        if (dist < min_distance) {
+            min_distance = dist;
+            min_index = i;
+        }
+    }
+    return arr[min_index];
+};
+export { closest, distance };
diff --git a/node_modules/fastest-levenshtein/index.d.ts b/node_modules/fastest-levenshtein/index.d.ts
deleted file mode 100644
index bdc2bb1cc32e0..0000000000000
--- a/node_modules/fastest-levenshtein/index.d.ts
+++ /dev/null
@@ -1,2 +0,0 @@
-export function distance(a: string, b: string): number;
-export function closest(str: string, arr: string[]): string;
\ No newline at end of file
diff --git a/node_modules/fastest-levenshtein/index.js b/node_modules/fastest-levenshtein/index.js
deleted file mode 100644
index 437bdebfda388..0000000000000
--- a/node_modules/fastest-levenshtein/index.js
+++ /dev/null
@@ -1,147 +0,0 @@
-"use strict";
-const peq = new Uint32Array(0x10000);
-const myers_32 = (a, b) => {
-  const n = a.length;
-  const m = b.length;
-  const lst = 1 << (n - 1);
-  let pv = -1;
-  let mv = 0;
-  let sc = n;
-  let i = n;
-  while (i--) {
-    peq[a.charCodeAt(i)] |= 1 << i;
-  }
-  for (i = 0; i < m; i++) {
-    let eq = peq[b.charCodeAt(i)];
-    const xv = eq | mv;
-    eq |= ((eq & pv) + pv) ^ pv;
-    mv |= ~(eq | pv);
-    pv &= eq;
-    if (mv & lst) {
-      sc++;
-    }
-    if (pv & lst) {
-      sc--;
-    }
-    mv = (mv << 1) | 1;
-    pv = (pv << 1) | ~(xv | mv);
-    mv &= xv;
-  }
-  i = n;
-  while (i--) {
-    peq[a.charCodeAt(i)] = 0;
-  }
-  return sc;
-};
-
-const myers_x = (a, b) => {
-  const n = a.length;
-  const m = b.length;
-  const mhc = [];
-  const phc = [];
-  const hsize = Math.ceil(n / 32);
-  const vsize = Math.ceil(m / 32);
-  let score = m;
-  for (let i = 0; i < hsize; i++) {
-    phc[i] = -1;
-    mhc[i] = 0;
-  }
-  let j = 0;
-  for (; j < vsize - 1; j++) {
-    let mv = 0;
-    let pv = -1;
-    const start = j * 32;
-    const end = Math.min(32, m) + start;
-    for (let k = start; k < end; k++) {
-      peq[b.charCodeAt(k)] |= 1 << k;
-    }
-    score = m;
-    for (let i = 0; i < n; i++) {
-      const eq = peq[a.charCodeAt(i)];
-      const pb = (phc[(i / 32) | 0] >>> i) & 1;
-      const mb = (mhc[(i / 32) | 0] >>> i) & 1;
-      const xv = eq | mv;
-      const xh = ((((eq | mb) & pv) + pv) ^ pv) | eq | mb;
-      let ph = mv | ~(xh | pv);
-      let mh = pv & xh;
-      if ((ph >>> 31) ^ pb) {
-        phc[(i / 32) | 0] ^= 1 << i;
-      }
-      if ((mh >>> 31) ^ mb) {
-        mhc[(i / 32) | 0] ^= 1 << i;
-      }
-      ph = (ph << 1) | pb;
-      mh = (mh << 1) | mb;
-      pv = mh | ~(xv | ph);
-      mv = ph & xv;
-    }
-    for (let k = start; k < end; k++) {
-      peq[b.charCodeAt(k)] = 0;
-    }
-  }
-  let mv = 0;
-  let pv = -1;
-  const start = j * 32;
-  const end = Math.min(32, m - start) + start;
-  for (let k = start; k < end; k++) {
-    peq[b.charCodeAt(k)] |= 1 << k;
-  }
-  score = m;
-  for (let i = 0; i < n; i++) {
-    const eq = peq[a.charCodeAt(i)];
-    const pb = (phc[(i / 32) | 0] >>> i) & 1;
-    const mb = (mhc[(i / 32) | 0] >>> i) & 1;
-    const xv = eq | mv;
-    const xh = ((((eq | mb) & pv) + pv) ^ pv) | eq | mb;
-    let ph = mv | ~(xh | pv);
-    let mh = pv & xh;
-    score += (ph >>> (m - 1)) & 1;
-    score -= (mh >>> (m - 1)) & 1;
-    if ((ph >>> 31) ^ pb) {
-      phc[(i / 32) | 0] ^= 1 << i;
-    }
-    if ((mh >>> 31) ^ mb) {
-      mhc[(i / 32) | 0] ^= 1 << i;
-    }
-    ph = (ph << 1) | pb;
-    mh = (mh << 1) | mb;
-    pv = mh | ~(xv | ph);
-    mv = ph & xv;
-  }
-  for (let k = start; k < end; k++) {
-    peq[b.charCodeAt(k)] = 0;
-  }
-  return score;
-};
-
-const distance = (a, b) => {
-  if (a.length > b.length) {
-    const tmp = b;
-    b = a;
-    a = tmp;
-  }
-  if (a.length === 0) {
-    return b.length;
-  }
-  if (a.length <= 32) {
-    return myers_32(a, b);
-  }
-  return myers_x(a, b);
-};
-
-const closest = (str, arr) => {
-  let min_distance = Infinity;
-  let min_index = 0;
-  for (let i = 0; i < arr.length; i++) {
-    const dist = distance(str, arr[i]);
-    if (dist < min_distance) {
-      min_distance = dist;
-      min_index = i;
-    }
-  }
-  return arr[min_index];
-};
-
-module.exports = {
-  closest, distance
-}
diff --git a/node_modules/fastest-levenshtein/mod.d.ts b/node_modules/fastest-levenshtein/mod.d.ts
new file mode 100644
index 0000000000000..b1b5ce7f7de95
--- /dev/null
+++ b/node_modules/fastest-levenshtein/mod.d.ts
@@ -0,0 +1,3 @@
+declare const distance: (a: string, b: string) => number;
+declare const closest: (str: string, arr: readonly string[]) => string;
+export { closest, distance };
diff --git a/node_modules/fastest-levenshtein/mod.js b/node_modules/fastest-levenshtein/mod.js
new file mode 100644
index 0000000000000..6bc27459399e6
--- /dev/null
+++ b/node_modules/fastest-levenshtein/mod.js
@@ -0,0 +1,142 @@
+"use strict";
+exports.__esModule = true;
+exports.distance = exports.closest = void 0;
+var peq = new Uint32Array(0x10000);
+var myers_32 = function (a, b) {
+    var n = a.length;
+    var m = b.length;
+    var lst = 1 << (n - 1);
+    var pv = -1;
+    var mv = 0;
+    var sc = n;
+    var i = n;
+    while (i--) {
+        peq[a.charCodeAt(i)] |= 1 << i;
+    }
+    for (i = 0; i < m; i++) {
+        var eq = peq[b.charCodeAt(i)];
+        var xv = eq | mv;
+        eq |= ((eq & pv) + pv) ^ pv;
+        mv |= ~(eq | pv);
+        pv &= eq;
+        if (mv & lst) {
+            sc++;
+        }
+        if (pv & lst) {
+            sc--;
+        }
+        mv = (mv << 1) | 1;
+        pv = (pv << 1) | ~(xv | mv);
+        mv &= xv;
+    }
+    i = n;
+    while (i--) {
+        peq[a.charCodeAt(i)] = 0;
+    }
+    return sc;
+};
+var myers_x = function (b, a) {
+    var n = a.length;
+    var m = b.length;
+    var mhc = [];
+    var phc = [];
+    var hsize = Math.ceil(n / 32);
+    var vsize = Math.ceil(m / 32);
+    for (var i = 0; i < hsize; i++) {
+        phc[i] = -1;
+        mhc[i] = 0;
+    }
+    var j = 0;
+    for (; j < vsize - 1; j++) {
+        var mv_1 = 0;
+        var pv_1 = -1;
+        var start_1 = j * 32;
+        var vlen_1 = Math.min(32, m) + start_1;
+        for (var k = start_1; k < vlen_1; k++) {
+            peq[b.charCodeAt(k)] |= 1 << k;
+        }
+        for (var i = 0; i < n; i++) {
+            var eq = peq[a.charCodeAt(i)];
+            var pb = (phc[(i / 32) | 0] >>> i) & 1;
+            var mb = (mhc[(i / 32) | 0] >>> i) & 1;
+            var xv = eq | mv_1;
+            var xh = ((((eq | mb) & pv_1) + pv_1) ^ pv_1) | eq | mb;
+            var ph = mv_1 | ~(xh | pv_1);
+            var mh = pv_1 & xh;
+            if ((ph >>> 31) ^ pb) {
+                phc[(i / 32) | 0] ^= 1 << i;
+            }
+            if ((mh >>> 31) ^ mb) {
+                mhc[(i / 32) | 0] ^= 1 << i;
+            }
+            ph = (ph << 1) | pb;
+            mh = (mh << 1) | mb;
+            pv_1 = mh | ~(xv | ph);
+            mv_1 = ph & xv;
+        }
+        for (var k = start_1; k < vlen_1; k++) {
+            peq[b.charCodeAt(k)] = 0;
+        }
+    }
+    var mv = 0;
+    var pv = -1;
+    var start = j * 32;
+    var vlen = Math.min(32, m - start) + start;
+    for (var k = start; k < vlen; k++) {
+        peq[b.charCodeAt(k)] |= 1 << k;
+    }
+    var score = m;
+    for (var i = 0; i < n; i++) {
+        var eq = peq[a.charCodeAt(i)];
+        var pb = (phc[(i / 32) | 0] >>> i) & 1;
+        var mb = (mhc[(i / 32) | 0] >>> i) & 1;
+        var xv = eq | mv;
+        var xh = ((((eq | mb) & pv) + pv) ^ pv) | eq | mb;
+        var ph = mv | ~(xh | pv);
+        var mh = pv & xh;
+        score += (ph >>> (m - 1)) & 1;
+        score -= (mh >>> (m - 1)) & 1;
+        if ((ph >>> 31) ^ pb) {
+            phc[(i / 32) | 0] ^= 1 << i;
+        }
+        if ((mh >>> 31) ^ mb) {
+            mhc[(i / 32) | 0] ^= 1 << i;
+        }
+        ph = (ph << 1) | pb;
+        mh = (mh << 1) | mb;
+        pv = mh | ~(xv | ph);
+        mv = ph & xv;
+    }
+    for (var k = start; k < vlen; k++) {
+        peq[b.charCodeAt(k)] = 0;
+    }
+    return score;
+};
+var distance = function (a, b) {
+    if (a.length < b.length) {
+        var tmp = b;
+        b = a;
+        a = tmp;
+    }
+    if (b.length === 0) {
+        return a.length;
+    }
+    if (a.length <= 32) {
+        return myers_32(a, b);
+    }
+    return myers_x(a, b);
+};
+exports.distance = distance;
+var closest = function (str, arr) {
+    var min_distance = Infinity;
+    var min_index = 0;
+    for (var i = 0; i < arr.length; i++) {
+        var dist = distance(str, arr[i]);
+        if (dist < min_distance) {
+            min_distance = dist;
+            min_index = i;
+        }
+    }
+    return arr[min_index];
+};
+exports.closest = closest;
diff --git a/node_modules/fastest-levenshtein/package.json b/node_modules/fastest-levenshtein/package.json
index 4d3ca34c92913..c395b852d5d92 100644
--- a/node_modules/fastest-levenshtein/package.json
+++ b/node_modules/fastest-levenshtein/package.json
@@ -1,8 +1,10 @@
 {
   "name": "fastest-levenshtein",
-  "version": "1.0.12",
+  "version": "1.0.16",
   "description": "Fastest Levenshtein distance implementation in JS.",
-  "main": "index.js",
+  "main": "mod.js",
+  "types": "mod.d.ts",
+  "module": "./esm/mod.js",
   "repository": {
     "type": "git",
     "url": "git+https://github.com/ka-weihe/fastest-levenshtein.git"
@@ -33,31 +35,38 @@
   },
   "homepage": "https://github.com/ka-weihe/fastest-levenshtein#README",
   "scripts": {
-    "test": "jest",
-    "test:coverage": "jest --coverage",
-    "test:coveralls": "jest --coverage --coverageReporters=text-lcov | coveralls"
+    "build": "tsc mod.ts --declaration",
+    "build:esm": "tsc --declaration -p tsconfig.esm.json",
+    "prepare": "npm run build && npm run build:esm",
+    "bench": "npm run build && tsc bench.ts && node bench.js",
+    "test": "npm run build && tsc test.ts && jest test.js",
+    "test:coverage": "npm run build && jest --coverage",
+    "test:coveralls": "npm run build && jest --coverage --coverageReporters=text-lcov | coveralls"
   },
   "devDependencies": {
+    "@types/benchmark": "^1.0.33",
+    "@types/jest": "^26.0.15",
+    "@typescript-eslint/eslint-plugin": "^4.7.0",
+    "@typescript-eslint/parser": "^4.7.0",
     "benchmark": "^2.1.4",
     "coveralls": "^3.1.0",
-    "eslint": "^7.5.0",
-    "eslint-config-airbnb": "^18.2.0",
-    "eslint-config-airbnb-base": "^14.2.0",
+    "eslint": "^7.13.0",
     "eslint-config-node": "^4.1.0",
-    "eslint-config-prettier": "^6.11.0",
-    "eslint-plugin-import": "^2.22.0",
-    "eslint-plugin-jsx-a11y": "^6.3.1",
+    "eslint-config-prettier": "^6.15.0",
+    "eslint-plugin-import": "^2.22.1",
     "eslint-plugin-node": "^11.1.0",
     "eslint-plugin-prettier": "^3.1.4",
-    "eslint-plugin-react": "^7.20.3",
-    "eslint-plugin-react-hooks": "^4.0.0",
     "fast-levenshtein": "^2.0.6",
-    "jest": "^26.1.0",
+    "jest": "^26.6.3",
     "js-levenshtein": "^1.1.6",
     "leven": "^3.1.0",
+    "levenshtein-edit-distance": "^2.0.5",
     "natural": "^2.1.5",
-    "prettier": "^2.0.5",
-    "talisman": "^1.1.2",
-    "levenshtein-edit-distance": "^2.0.5"
+    "prettier": "^2.1.2",
+    "talisman": "^1.1.3",
+    "typescript": "^4.0.5"
+  },
+  "engines": {
+    "node": ">= 4.9.1"
   }
 }
diff --git a/node_modules/fastest-levenshtein/test.js b/node_modules/fastest-levenshtein/test.js
index 4b5d6ecae6504..475063390a81b 100644
--- a/node_modules/fastest-levenshtein/test.js
+++ b/node_modules/fastest-levenshtein/test.js
@@ -1,64 +1,55 @@
-const {distance, closest} = require("./index.js");
-
-const levenshtein = (a, b) => {
-  if (a.length === 0) return b.length;
-  if (b.length === 0) return a.length;
-
-  if (a.length > b.length) {
-    const tmp = a;
-    a = b;
-    b = tmp;
-  }
-
-  const row = [];
-  for (let i = 0; i <= a.length; i++) {
-    row[i] = i;
-  }
-
-  for (let i = 1; i <= b.length; i++) {
-    let prev = i;
-    for (let j = 1; j <= a.length; j++) {
-      let val;
-      if (b.charAt(i - 1) === a.charAt(j - 1)) {
-        val = row[j - 1];
-      } else {
-        val = Math.min(row[j - 1] + 1, prev + 1, row[j] + 1);
-      }
-      row[j - 1] = prev;
-      prev = val;
+var _a = require("./mod.js"), closest = _a.closest, distance = _a.distance;
+var levenshtein = function (a, b) {
+    if (a.length === 0) {
+        return b.length;
     }
-    row[a.length] = prev;
-  }
-
-  return row[a.length];
+    if (b.length === 0) {
+        return a.length;
+    }
+    if (a.length > b.length) {
+        var tmp = a;
+        a = b;
+        b = tmp;
+    }
+    var row = [];
+    for (var i = 0; i <= a.length; i++) {
+        row[i] = i;
+    }
+    for (var i = 1; i <= b.length; i++) {
+        var prev = i;
+        for (var j = 1; j <= a.length; j++) {
+            var val = 0;
+            if (b.charAt(i - 1) === a.charAt(j - 1)) {
+                val = row[j - 1];
+            }
+            else {
+                val = Math.min(row[j - 1] + 1, prev + 1, row[j] + 1);
+            }
+            row[j - 1] = prev;
+            prev = val;
+        }
+        row[a.length] = prev;
+    }
+    return row[a.length];
 };
-
-function makeid(length) {
-  let result = "";
-  const characters =
-    "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789";
-  const charactersLength = characters.length;
-  for (let i = 0; i < length; i++) {
-    result += characters.charAt(Math.floor(Math.random() * charactersLength));
-  }
-  return result;
+var makeid = function (length) {
+    var result = "";
+    var characters = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789";
+    var charactersLength = characters.length;
+    for (var i = 0; i < length; i++) {
+        result += characters.charAt(Math.floor(Math.random() * charactersLength));
+    }
+    return result;
+};
+for (var i = 0; i < 10000; i++) {
+    var rnd_num1 = (Math.random() * 1000) | 0;
+    var rnd_num2 = (Math.random() * 1000) | 0;
+    var rnd_string1 = makeid(rnd_num1);
+    var rnd_string2 = makeid(rnd_num2);
+    var actual = distance(rnd_string1, rnd_string2);
+    var expected = levenshtein(rnd_string1, rnd_string2);
+    console.log(i);
+    if (actual !== expected) {
+        console.log("fail");
+    }
 }
-
-test("test compare", () => {
-  const errors = 0;
-  for (let i = 0; i < 1000; i++) {
-    const rnd_num1 = (Math.random() * 1000) | 0;
-    const rnd_num2 = (Math.random() * 1000) | 0;
-    const rnd_string1 = makeid(rnd_num1);
-    const rnd_string2 = makeid(rnd_num2);
-    const actual = distance(rnd_string1, rnd_string2);
-    const expected = levenshtein(rnd_string1, rnd_string2);
-    expect(actual).toBe(expected);
-  }
-});
-
-test("test find", () => {
-  const actual = closest("fast", ["slow", "faster", "fastest"]);
-  const expected = "faster";
-  expect(actual).toBe(expected);
-});
diff --git a/node_modules/fastest-levenshtein/test.ts b/node_modules/fastest-levenshtein/test.ts
new file mode 100644
index 0000000000000..41939bcdc8e2b
--- /dev/null
+++ b/node_modules/fastest-levenshtein/test.ts
@@ -0,0 +1,67 @@
+const { closest, distance } = require("./mod.js");
+
+const levenshtein = (a, b) => {
+  if (a.length === 0) {
+    return b.length;
+  }
+  if (b.length === 0) {
+    return a.length;
+  }
+
+  if (a.length > b.length) {
+    const tmp = a;
+    a = b;
+    b = tmp;
+  }
+
+  const row = [];
+  for (let i = 0; i <= a.length; i++) {
+    row[i] = i;
+  }
+
+  for (let i = 1; i <= b.length; i++) {
+    let prev = i;
+    for (let j = 1; j <= a.length; j++) {
+      let val = 0;
+      if (b.charAt(i - 1) === a.charAt(j - 1)) {
+        val = row[j - 1];
+      } else {
+        val = Math.min(row[j - 1] + 1, prev + 1, row[j] + 1);
+      }
+      row[j - 1] = prev;
+      prev = val;
+    }
+    row[a.length] = prev;
+  }
+
+  return row[a.length];
+};
+
+const makeid = (length) => {
+  let result = "";
+  const characters =
+    "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789";
+  const charactersLength = characters.length;
+  for (let i = 0; i < length; i++) {
+    result += characters.charAt(Math.floor(Math.random() * charactersLength));
+  }
+  return result;
+};
+
+test("test compare", () => {
+  for (let i = 0; i < 1000; i++) {
+    const rnd_num1 = (Math.random() * 1000) | 0;
+    const rnd_num2 = (Math.random() * 1000) | 0;
+    const rnd_string1 = makeid(rnd_num1);
+    const rnd_string2 = makeid(rnd_num2);
+    const actual = distance(rnd_string1, rnd_string2);
+    const expected = levenshtein(rnd_string1, rnd_string2);
+    expect(actual).toBe(expected);
+  }
+});
+
+test("test find", () => {
+  const actual = closest("fast", ["slow", "faster", "fastest"]);
+  const expected = "faster";
+  expect(actual).toBe(expected);
+});
diff --git a/package-lock.json b/package-lock.json
index f210200f5c22a..b26762ab0cead 100644
--- a/package-lock.json
+++ b/package-lock.json
@@ -99,7 +99,7 @@
         "cli-columns": "^4.0.0",
         "cli-table3": "^0.6.2",
         "columnify": "^1.6.0",
-        "fastest-levenshtein": "^1.0.12",
+        "fastest-levenshtein": "^1.0.16",
         "fs-minipass": "^2.1.0",
         "glob": "^8.0.1",
         "graceful-fs": "^4.2.10",
@@ -5042,9 +5042,13 @@
       "dev": true
     },
     "node_modules/fastest-levenshtein": {
-      "version": "1.0.12",
+      "version": "1.0.16",
+      "resolved": "https://registry.npmjs.org/fastest-levenshtein/-/fastest-levenshtein-1.0.16.tgz",
+      "integrity": "sha512-eRnCtTTtGZFpQCwhJiUOuxPQWRXVKYDn0b2PeHfXL6/Zi53SLAzAHfVhVWK2AryC/WH05kGfxhFIPvTF0SXQzg==",
       "inBundle": true,
-      "license": "MIT"
+      "engines": {
+        "node": ">= 4.9.1"
+      }
     },
     "node_modules/fastq": {
       "version": "1.13.0",
diff --git a/package.json b/package.json
index 9980c5b8ec65e..096ae466bef7f 100644
--- a/package.json
+++ b/package.json
@@ -69,7 +69,7 @@
     "cli-columns": "^4.0.0",
     "cli-table3": "^0.6.2",
     "columnify": "^1.6.0",
-    "fastest-levenshtein": "^1.0.12",
+    "fastest-levenshtein": "^1.0.16",
     "fs-minipass": "^2.1.0",
     "glob": "^8.0.1",
     "graceful-fs": "^4.2.10",