tdk-api-wrapper 1.7.0 → 1.7.1

package/dist/cli.js

@@ -71,168 +71,12 @@ var init_errors = __esm({
   }
 });
 
-// src/morphology.ts
-function isVowel(ch) {
-  return TURKISH_VOWELS.includes(ch);
-}
-function restoreConsonantSoftening(stem) {
-  if (stem.length < 2)
-    return [];
-  const last = stem.slice(-1);
-  const base = stem.slice(0, -1);
-  switch (last) {
-    case "b":
-      return [base + "p"];
-    case "c":
-      return [base + "\xE7"];
-    case "d":
-      return [base + "t"];
-    case "\u011F":
-      return [base + "k"];
-    case "g":
-      return [base + "k"];
-    default:
-      return [];
-  }
-}
-function restoreVowelDrop(stem) {
-  if (stem.length < 3)
-    return [];
-  const c1 = stem[stem.length - 2];
-  const c2 = stem[stem.length - 1];
-  if (!isVowel(c1) && !isVowel(c2)) {
-    const vowelsInBase = stem.slice(0, -2).split("").filter(isVowel);
-    if (vowelsInBase.length > 0) {
-      const lastVowel = vowelsInBase[vowelsInBase.length - 1];
-      let inserted = "i";
-      if ("a\u0131".includes(lastVowel))
-        inserted = "\u0131";
-      else if ("ei".includes(lastVowel))
-        inserted = "i";
-      else if ("ou".includes(lastVowel))
-        inserted = "u";
-      else if ("\xF6\xFC".includes(lastVowel))
-        inserted = "\xFC";
-      return [stem.slice(0, -1) + inserted + c2];
-    }
-  }
-  return [];
-}
-function restoreGemination(stem) {
-  if (stem.length < 3)
-    return [];
-  const c1 = stem[stem.length - 2];
-  const c2 = stem[stem.length - 1];
-  if (c1 === c2 && !isVowel(c1)) {
-    const single = stem.slice(0, -1);
-    const hardened = restoreConsonantSoftening(single);
-    return [single, ...hardened];
-  }
-  return [];
-}
-function restoreVowelNarrowing(stem) {
-  if (stem.length < 2)
-    return [];
-  if (stem === "di")
-    return ["de"];
-  if (stem === "yi")
-    return ["ye"];
-  const lastChar = stem[stem.length - 1];
-  const isLastNarrow = "\u0131iu\xFC".includes(lastChar);
-  if (isLastNarrow) {
-    const vowelsInBase = stem.slice(0, -1).split("").filter(isVowel);
-    const lastVowel = vowelsInBase.length > 0 ? vowelsInBase[vowelsInBase.length - 1] : lastChar;
-    const widened = "a\u0131ou".includes(lastVowel) ? "a" : "e";
-    return [stem.slice(0, -1) + widened];
-  }
-  if (!isVowel(lastChar)) {
-    const vowelsInBase = stem.split("").filter(isVowel);
-    if (vowelsInBase.length > 0) {
-      const lastVowel = vowelsInBase[vowelsInBase.length - 1];
-      const widened = "a\u0131ou".includes(lastVowel) ? "a" : "e";
-      return [stem + widened];
-    }
-  }
-  return [];
-}
-function restoreInfinitive(stem) {
-  if (stem.length < 2)
-    return [];
-  const vowelsInBase = stem.split("").filter(isVowel);
-  if (vowelsInBase.length === 0)
-    return [];
-  const lastVowel = vowelsInBase[vowelsInBase.length - 1];
-  return "a\u0131ou".includes(lastVowel) ? [stem + "mak"] : [stem + "mek"];
-}
-function getStemCandidates(word2, minStemLength = 2, maxDepth = 4) {
-  if (!word2 || word2.trim().length === 0)
-    return [];
-  const raw = word2.trim();
-  const normalized = raw.toLocaleLowerCase("tr-TR");
-  const candidatesWithWeight = [];
-  const seen = /* @__PURE__ */ new Set();
-  if (raw.includes("'") || raw.includes("\u2019")) {
-    const apostropheStem = normalized.split(/['’]/)[0];
-    if (apostropheStem.length >= minStemLength) {
-      candidatesWithWeight.push({ candidate: apostropheStem, baseLength: apostropheStem.length + 10 });
-      seen.add(apostropheStem);
-    }
-  }
-  const bareInfinitives = restoreInfinitive(normalized);
-  for (const inf of bareInfinitives) {
-    if (!seen.has(inf) && inf !== normalized) {
-      seen.add(inf);
-      candidatesWithWeight.push({ candidate: inf, baseLength: normalized.length });
-    }
-  }
-  let frontier = [normalized];
-  for (let depth = 0; depth < maxDepth; depth++) {
-    const nextFrontier = [];
-    for (const current of frontier) {
-      for (const suffix of TURKISH_SUFFIXES) {
-        if (current.length - suffix.length >= minStemLength && current.endsWith(suffix)) {
-          const stem = current.slice(0, -suffix.length);
-          const hardened = restoreConsonantSoftening(stem);
-          const vowelDropped = restoreVowelDrop(stem);
-          const geminated = restoreGemination(stem);
-          const isNarrowingSuffix = suffix.startsWith("yor") || suffix.includes("iyor") || suffix.includes("\u0131yor") || suffix.includes("uyor") || suffix.includes("\xFCyor");
-          const isDeYeBuffer = (stem === "di" || stem === "yi") && suffix.startsWith("y");
-          const narrowed = isNarrowingSuffix || isDeYeBuffer ? restoreVowelNarrowing(stem) : [];
-          const isVerbSuffix = isNarrowingSuffix || suffix.includes("ecek") || suffix.includes("acak") || suffix.includes("mi\u015F") || suffix.includes("m\u0131\u015F") || suffix.includes("m\xFC\u015F") || suffix.includes("mu\u015F") || suffix.includes("mek") || suffix.includes("mak") || suffix.includes("erek") || suffix.includes("arak") || suffix.includes("dik") || suffix.includes("d\u0131k") || suffix.includes("duk") || suffix.includes("d\xFCk") || suffix.includes("tik") || suffix.includes("t\u0131k") || suffix.includes("tuk") || suffix.includes("t\xFCk") || suffix.includes("sen") || suffix.includes("san") || suffix.includes("sem") || suffix.includes("sam") || suffix.includes("sek") || suffix.includes("sak");
-          const verbalBases = [stem, ...hardened, ...narrowed];
-          const infinitives = verbalBases.flatMap((v) => restoreInfinitive(v));
-          const variants = [stem, ...hardened, ...vowelDropped, ...geminated, ...narrowed];
-          for (const variant of variants) {
-            if (!seen.has(variant) && variant !== normalized) {
-              seen.add(variant);
-              nextFrontier.push(variant);
-              candidatesWithWeight.push({ candidate: variant, baseLength: stem.length });
-            }
-          }
-          for (const inf of infinitives) {
-            if (!seen.has(inf) && inf !== normalized) {
-              seen.add(inf);
-              nextFrontier.push(inf);
-              const weight = isVerbSuffix ? stem.length + 5 : stem.length;
-              candidatesWithWeight.push({ candidate: inf, baseLength: weight });
-            }
-          }
-        }
-      }
-    }
-    if (nextFrontier.length === 0)
-      break;
-    frontier = nextFrontier;
-  }
-  candidatesWithWeight.sort((a, b) => b.baseLength - a.baseLength);
-  return [...new Set(candidatesWithWeight.map((c2) => c2.candidate))];
-}
-var TURKISH_VOWELS, TURKISH_SUFFIXES;
-var init_morphology = __esm({
-  "src/morphology.ts"() {
+// src/data/suffixes.ts
+var TURKISH_SUFFIXES;
+var init_suffixes = __esm({
+  "src/data/suffixes.ts"() {
     "use strict";
     init_cjs_shims();
-    TURKISH_VOWELS = "ae\u0131io\xF6u\xFC";
     TURKISH_SUFFIXES = [
       // 9-letter composite suffixes
       "lerimizden",
@@ -638,36 +482,179 @@ var init_morphology = __esm({
   }
 });
 
-// src/tdk.ts
-function keyboardSubCost(a, b) {
-  if (a === b)
-    return 0;
-  if (DIACRITIC_SIBLINGS[a] === b)
-    return DIACRITIC_SUB_COST;
-  const pa = KEYBOARD_COORDS[a];
-  const pb = KEYBOARD_COORDS[b];
-  if (!pa || !pb)
-    return 1;
-  const dx = Math.abs(pa[0] - pb[0]);
-  const dy = Math.abs(pa[1] - pb[1]);
-  if (dy === 0 && dx <= 1 + 1e-9)
-    return KEYBOARD_ROW_SUB_COST;
-  if (dy === 1 && dx <= 1 + 1e-9)
-    return KEYBOARD_DIAGONAL_SUB_COST;
-  return 1;
+// src/morphology.ts
+function isVowel(ch) {
+  return TURKISH_VOWELS.includes(ch);
 }
-var fs, path, os, https, tls, COMMON_MISSPELLINGS, SEY_EXCEPTIONS, KEYBOARD_ROWS, KEYBOARD_COORDS, DIACRITIC_SIBLINGS, KEYBOARD_ROW_SUB_COST, KEYBOARD_DIAGONAL_SUB_COST, DIACRITIC_SUB_COST, TRANSPOSITION_COST, TDK;
-var init_tdk = __esm({
-  "src/tdk.ts"() {
+function restoreConsonantSoftening(stem) {
+  if (stem.length < 2)
+    return [];
+  const last = stem.slice(-1);
+  const base = stem.slice(0, -1);
+  switch (last) {
+    case "b":
+      return [base + "p"];
+    case "c":
+      return [base + "\xE7"];
+    case "d":
+      return [base + "t"];
+    case "\u011F":
+      return [base + "k"];
+    case "g":
+      return [base + "k"];
+    default:
+      return [];
+  }
+}
+function restoreVowelDrop(stem) {
+  if (stem.length < 3)
+    return [];
+  const c1 = stem[stem.length - 2];
+  const c2 = stem[stem.length - 1];
+  if (!isVowel(c1) && !isVowel(c2)) {
+    const vowelsInBase = stem.slice(0, -2).split("").filter(isVowel);
+    if (vowelsInBase.length > 0) {
+      const lastVowel = vowelsInBase[vowelsInBase.length - 1];
+      let inserted = "i";
+      if ("a\u0131".includes(lastVowel))
+        inserted = "\u0131";
+      else if ("ei".includes(lastVowel))
+        inserted = "i";
+      else if ("ou".includes(lastVowel))
+        inserted = "u";
+      else if ("\xF6\xFC".includes(lastVowel))
+        inserted = "\xFC";
+      return [stem.slice(0, -1) + inserted + c2];
+    }
+  }
+  return [];
+}
+function restoreGemination(stem) {
+  if (stem.length < 3)
+    return [];
+  const c1 = stem[stem.length - 2];
+  const c2 = stem[stem.length - 1];
+  if (c1 === c2 && !isVowel(c1)) {
+    const single = stem.slice(0, -1);
+    const hardened = restoreConsonantSoftening(single);
+    return [single, ...hardened];
+  }
+  return [];
+}
+function restoreVowelNarrowing(stem) {
+  if (stem.length < 2)
+    return [];
+  if (stem === "di")
+    return ["de"];
+  if (stem === "yi")
+    return ["ye"];
+  const lastChar = stem[stem.length - 1];
+  const isLastNarrow = "\u0131iu\xFC".includes(lastChar);
+  if (isLastNarrow) {
+    const vowelsInBase = stem.slice(0, -1).split("").filter(isVowel);
+    const lastVowel = vowelsInBase.length > 0 ? vowelsInBase[vowelsInBase.length - 1] : lastChar;
+    const widened = "a\u0131ou".includes(lastVowel) ? "a" : "e";
+    return [stem.slice(0, -1) + widened];
+  }
+  if (!isVowel(lastChar)) {
+    const vowelsInBase = stem.split("").filter(isVowel);
+    if (vowelsInBase.length > 0) {
+      const lastVowel = vowelsInBase[vowelsInBase.length - 1];
+      const widened = "a\u0131ou".includes(lastVowel) ? "a" : "e";
+      return [stem + widened];
+    }
+  }
+  return [];
+}
+function restoreInfinitive(stem) {
+  if (stem.length < 2)
+    return [];
+  const vowelsInBase = stem.split("").filter(isVowel);
+  if (vowelsInBase.length === 0)
+    return [];
+  const lastVowel = vowelsInBase[vowelsInBase.length - 1];
+  return "a\u0131ou".includes(lastVowel) ? [stem + "mak"] : [stem + "mek"];
+}
+function getStemCandidates(word2, minStemLength = 2, maxDepth = 4) {
+  if (!word2 || word2.trim().length === 0)
+    return [];
+  const raw = word2.trim();
+  const normalized = raw.toLocaleLowerCase("tr-TR");
+  const candidatesWithWeight = [];
+  const seen = /* @__PURE__ */ new Set();
+  if (raw.includes("'") || raw.includes("\u2019")) {
+    const apostropheStem = normalized.split(/['’]/)[0];
+    if (apostropheStem.length >= minStemLength) {
+      candidatesWithWeight.push({ candidate: apostropheStem, baseLength: apostropheStem.length + 10 });
+      seen.add(apostropheStem);
+    }
+  }
+  const bareInfinitives = restoreInfinitive(normalized);
+  for (const inf of bareInfinitives) {
+    if (!seen.has(inf) && inf !== normalized) {
+      seen.add(inf);
+      candidatesWithWeight.push({ candidate: inf, baseLength: normalized.length });
+    }
+  }
+  let frontier = [normalized];
+  for (let depth = 0; depth < maxDepth; depth++) {
+    const nextFrontier = [];
+    for (const current of frontier) {
+      for (const suffix of TURKISH_SUFFIXES) {
+        if (current.length - suffix.length >= minStemLength && current.endsWith(suffix)) {
+          const stem = current.slice(0, -suffix.length);
+          const hardened = restoreConsonantSoftening(stem);
+          const vowelDropped = restoreVowelDrop(stem);
+          const geminated = restoreGemination(stem);
+          const isNarrowingSuffix = suffix.startsWith("yor") || suffix.includes("iyor") || suffix.includes("\u0131yor") || suffix.includes("uyor") || suffix.includes("\xFCyor");
+          const isDeYeBuffer = (stem === "di" || stem === "yi") && suffix.startsWith("y");
+          const narrowed = isNarrowingSuffix || isDeYeBuffer ? restoreVowelNarrowing(stem) : [];
+          const isVerbSuffix = isNarrowingSuffix || suffix.includes("ecek") || suffix.includes("acak") || suffix.includes("mi\u015F") || suffix.includes("m\u0131\u015F") || suffix.includes("m\xFC\u015F") || suffix.includes("mu\u015F") || suffix.includes("mek") || suffix.includes("mak") || suffix.includes("erek") || suffix.includes("arak") || suffix.includes("dik") || suffix.includes("d\u0131k") || suffix.includes("duk") || suffix.includes("d\xFCk") || suffix.includes("tik") || suffix.includes("t\u0131k") || suffix.includes("tuk") || suffix.includes("t\xFCk") || suffix.includes("sen") || suffix.includes("san") || suffix.includes("sem") || suffix.includes("sam") || suffix.includes("sek") || suffix.includes("sak");
+          const verbalBases = [stem, ...hardened, ...narrowed];
+          const infinitives = verbalBases.flatMap((v) => restoreInfinitive(v));
+          const variants = [stem, ...hardened, ...vowelDropped, ...geminated, ...narrowed];
+          for (const variant of variants) {
+            if (!seen.has(variant) && variant !== normalized) {
+              seen.add(variant);
+              nextFrontier.push(variant);
+              candidatesWithWeight.push({ candidate: variant, baseLength: stem.length });
+            }
+          }
+          for (const inf of infinitives) {
+            if (!seen.has(inf) && inf !== normalized) {
+              seen.add(inf);
+              nextFrontier.push(inf);
+              const weight = isVerbSuffix ? stem.length + 5 : stem.length;
+              candidatesWithWeight.push({ candidate: inf, baseLength: weight });
+            }
+          }
+        }
+      }
+    }
+    if (nextFrontier.length === 0)
+      break;
+    frontier = nextFrontier;
+  }
+  candidatesWithWeight.sort((a, b) => b.baseLength - a.baseLength);
+  return [...new Set(candidatesWithWeight.map((c2) => c2.candidate))];
+}
+var TURKISH_VOWELS;
+var init_morphology = __esm({
+  "src/morphology.ts"() {
+    "use strict";
+    init_cjs_shims();
+    init_suffixes();
+    init_suffixes();
+    TURKISH_VOWELS = "ae\u0131io\xF6u\xFC";
+  }
+});
+
+// src/data/misspellings.ts
+var COMMON_MISSPELLINGS, SEY_EXCEPTIONS;
+var init_misspellings = __esm({
+  "src/data/misspellings.ts"() {
     "use strict";
     init_cjs_shims();
-    init_errors();
-    init_morphology();
-    fs = __toESM(require("fs"));
-    path = __toESM(require("path"));
-    os = __toESM(require("os"));
-    https = __toESM(require("https"));
-    tls = __toESM(require("tls"));
     COMMON_MISSPELLINGS = {
       // -şey ile biten ve ayrı yazılması zorunlu söz öbekleri
       her\u015Fey: "her \u015Fey",
@@ -821,58 +808,17 @@ var init_tdk = __esm({
       babaanne: "babaanne"
     };
     SEY_EXCEPTIONS = /* @__PURE__ */ new Set(["d\xFC\u015Fey", "e\u015Fey", "konsey", "jersey", "\u015Fey"]);
-    KEYBOARD_ROWS = [
-      ["qwertyu\u0131op\u011F\xFC", 0],
-      ["asdfghjkl\u015Fi", 0.5],
-      ["zxcvbnm\xF6\xE7", 1]
-    ];
-    KEYBOARD_COORDS = (() => {
-      const coords = {};
-      KEYBOARD_ROWS.forEach(([keys, offset], row) => {
-        [...keys].forEach((key, col) => {
-          coords[key] = [col + offset, row];
-        });
-      });
-      return coords;
-    })();
-    DIACRITIC_SIBLINGS = {
-      \u0131: "i",
-      i: "\u0131",
-      \u00F6: "o",
-      o: "\xF6",
-      \u00FC: "u",
-      u: "\xFC",
-      \u015F: "s",
-      s: "\u015F",
-      \u00E7: "c",
-      c: "\xE7",
-      \u011F: "g",
-      g: "\u011F",
-      \u00E2: "a",
-      a: "\xE2"
-    };
-    KEYBOARD_ROW_SUB_COST = 0.4;
-    KEYBOARD_DIAGONAL_SUB_COST = 0.55;
-    DIACRITIC_SUB_COST = 0.3;
-    TRANSPOSITION_COST = 0.8;
-    TDK = class {
-      static BASE_URL = "https://sozluk.gov.tr";
-      static AUDIO_API_HOST = "api.sozluk.gov.tr";
-      static KUBBEALTI_HOST = "eski.lugatim.com";
-      /**
-       * `eski.lugatim.com` (Kubbealtı Lugatı's data API) sends only its leaf
-       * certificate during the TLS handshake, omitting the intermediates a
-       * correctly configured server would include — a server-side misconfiguration,
-       * not something we should paper over by disabling verification. These are
-       * the two certificates the server *should* be sending (fetched from the
-       * leaf's own Authority Information Access URLs), supplied here so Node can
-       * still build a full, properly verified chain up to a root it already
-       * trusts (ISRG Root X1). If Let's Encrypt rotates this intermediate, this
-       * stops working and every Kubbealtı call fails closed to `null` — same
-       * fail-closed contract as the rest of this file's fragile integrations.
-       */
-      static KUBBEALTI_EXTRA_CA = [
-        `-----BEGIN CERTIFICATE-----
+  }
+});
+
+// src/data/kubbealti-ca.ts
+var KUBBEALTI_EXTRA_CA;
+var init_kubbealti_ca = __esm({
+  "src/data/kubbealti-ca.ts"() {
+    "use strict";
+    init_cjs_shims();
+    KUBBEALTI_EXTRA_CA = [
+      `-----BEGIN CERTIFICATE-----
 MIIE2jCCAsKgAwIBAgIQTr0klH4k05SALYSlL9WzGTANBgkqhkiG9w0BAQsFADAu
 MQswCQYDVQQGEwJVUzENMAsGA1UEChMESVNSRzEQMA4GA1UEAxMHUm9vdCBZUjAe
 Fw0yNTA5MDMwMDAwMDBaFw0yODA5MDIyMzU5NTlaMDMxCzAJBgNVBAYTAlVTMRYw
@@ -900,7 +846,7 @@ NA3wJdl4DDUuQSV8hBgx6zoI1ZSGORprDFux7c6rhc77QZMSRrEgomBeklervEve
 86ylWmZ3WWHV6RLMi8xNvjd71r4EPIGgY7BZU/VPBkq+uA7Gb6mbJnFgV43uh3xy
 LRFgxIAphIukwTGSMZZR+AI+Qnp0BYTWovHXozOf3H8r6hozEoT02JHn0AeTfA==
 -----END CERTIFICATE-----`,
-        `-----BEGIN CERTIFICATE-----
+      `-----BEGIN CERTIFICATE-----
 MIIF9DCCA9ygAwIBAgIRAPJLbRf52a18scn+p4eCaZ8wDQYJKoZIhvcNAQELBQAw
 TzELMAkGA1UEBhMCVVMxKTAnBgNVBAoTIEludGVybmV0IFNlY3VyaXR5IFJlc2Vh
 cmNoIEdyb3VwMRUwEwYDVQQDEwxJU1JHIFJvb3QgWDEwHhcNMjYwNTEzMDAwMDAw
@@ -934,7 +880,146 @@ RGMuHGnzS3hFIrRTfKxrzUZ9RzQWzEG3K6fJ3r2nqSltkeytis9DIBoFY9VmVyjL
 M71DMi+y1+TRSJVClEMwvA4yL++7q9XZx5r5wBRWB4kQTKH5qyoZnDw7iiuh1lID
 yDFx8r7i9vIJU5HS3moZLkYWAOilMaV9N56A9Bgb6dNcHkvg3NoaYA==
 -----END CERTIFICATE-----`
-      ];
+    ];
+  }
+});
+
+// src/data/keyboard-layout.ts
+function keyboardSubCost(a, b) {
+  if (a === b)
+    return 0;
+  if (DIACRITIC_SIBLINGS[a] === b)
+    return DIACRITIC_SUB_COST;
+  const pa = KEYBOARD_COORDS[a];
+  const pb = KEYBOARD_COORDS[b];
+  if (!pa || !pb)
+    return 1;
+  const dx = Math.abs(pa[0] - pb[0]);
+  const dy = Math.abs(pa[1] - pb[1]);
+  if (dy === 0 && dx <= 1 + 1e-9)
+    return KEYBOARD_ROW_SUB_COST;
+  if (dy === 1 && dx <= 1 + 1e-9)
+    return KEYBOARD_DIAGONAL_SUB_COST;
+  return 1;
+}
+var KEYBOARD_ROWS, KEYBOARD_COORDS, DIACRITIC_SIBLINGS, KEYBOARD_ROW_SUB_COST, KEYBOARD_DIAGONAL_SUB_COST, DIACRITIC_SUB_COST, TRANSPOSITION_COST;
+var init_keyboard_layout = __esm({
+  "src/data/keyboard-layout.ts"() {
+    "use strict";
+    init_cjs_shims();
+    KEYBOARD_ROWS = [
+      ["qwertyu\u0131op\u011F\xFC", 0],
+      ["asdfghjkl\u015Fi", 0.5],
+      ["zxcvbnm\xF6\xE7", 1]
+    ];
+    KEYBOARD_COORDS = (() => {
+      const coords = {};
+      KEYBOARD_ROWS.forEach(([keys, offset], row) => {
+        [...keys].forEach((key, col) => {
+          coords[key] = [col + offset, row];
+        });
+      });
+      return coords;
+    })();
+    DIACRITIC_SIBLINGS = {
+      \u0131: "i",
+      i: "\u0131",
+      \u00F6: "o",
+      o: "\xF6",
+      \u00FC: "u",
+      u: "\xFC",
+      \u015F: "s",
+      s: "\u015F",
+      \u00E7: "c",
+      c: "\xE7",
+      \u011F: "g",
+      g: "\u011F",
+      \u00E2: "a",
+      a: "\xE2"
+    };
+    KEYBOARD_ROW_SUB_COST = 0.4;
+    KEYBOARD_DIAGONAL_SUB_COST = 0.55;
+    DIACRITIC_SUB_COST = 0.3;
+    TRANSPOSITION_COST = 0.8;
+  }
+});
+
+// src/lib/edit-distance.ts
+function damerauLevenshtein(a, b) {
+  const dp = Array.from({ length: a.length + 1 }, () => new Array(b.length + 1).fill(0));
+  for (let i = 0; i <= a.length; i++)
+    dp[i][0] = i;
+  for (let j = 0; j <= b.length; j++)
+    dp[0][j] = j;
+  for (let i = 1; i <= a.length; i++) {
+    for (let j = 1; j <= b.length; j++) {
+      const cost = a[i - 1] === b[j - 1] ? 0 : 1;
+      dp[i][j] = Math.min(dp[i - 1][j] + 1, dp[i][j - 1] + 1, dp[i - 1][j - 1] + cost);
+      if (i > 1 && j > 1 && a[i - 1] === b[j - 2] && a[i - 2] === b[j - 1]) {
+        dp[i][j] = Math.min(dp[i][j], dp[i - 2][j - 2] + cost);
+      }
+    }
+  }
+  return dp[a.length][b.length];
+}
+function keyboardAwareDistance(a, b) {
+  const dp = Array.from({ length: a.length + 1 }, () => new Array(b.length + 1).fill(0));
+  for (let i = 0; i <= a.length; i++)
+    dp[i][0] = i;
+  for (let j = 0; j <= b.length; j++)
+    dp[0][j] = j;
+  for (let i = 1; i <= a.length; i++) {
+    for (let j = 1; j <= b.length; j++) {
+      const cost = keyboardSubCost(a[i - 1], b[j - 1]);
+      dp[i][j] = Math.min(dp[i - 1][j] + 1, dp[i][j - 1] + 1, dp[i - 1][j - 1] + cost);
+      if (i > 1 && j > 1 && a[i - 1] === b[j - 2] && a[i - 2] === b[j - 1]) {
+        dp[i][j] = Math.min(dp[i][j], dp[i - 2][j - 2] + TRANSPOSITION_COST);
+      }
+    }
+  }
+  return dp[a.length][b.length];
+}
+var init_edit_distance = __esm({
+  "src/lib/edit-distance.ts"() {
+    "use strict";
+    init_cjs_shims();
+    init_keyboard_layout();
+  }
+});
+
+// src/lib/html.ts
+function htmlToPlainText(html) {
+  return html.replace(/<br\s*\/?>/gi, "\n").replace(/<\/(p|div)>/gi, "\n\n").replace(/<[^>]+>/g, "").replace(/&nbsp;/gi, " ").replace(/&lt;/gi, "<").replace(/&gt;/gi, ">").replace(/&quot;/gi, '"').replace(/&#39;|&rsquo;/gi, "'").replace(/&amp;/gi, "&").replace(/[ \t]+/g, " ").replace(/[ \t]*\n[ \t]*/g, "\n").replace(/\n{3,}/g, "\n\n").trim();
+}
+var init_html = __esm({
+  "src/lib/html.ts"() {
+    "use strict";
+    init_cjs_shims();
+  }
+});
+
+// src/tdk.ts
+var fs, path, os, https, tls, TDK;
+var init_tdk = __esm({
+  "src/tdk.ts"() {
+    "use strict";
+    init_cjs_shims();
+    init_errors();
+    init_morphology();
+    init_misspellings();
+    init_kubbealti_ca();
+    init_edit_distance();
+    init_html();
+    fs = __toESM(require("fs"));
+    path = __toESM(require("path"));
+    os = __toESM(require("os"));
+    https = __toESM(require("https"));
+    tls = __toESM(require("tls"));
+    init_misspellings();
+    TDK = class {
+      static BASE_URL = "https://sozluk.gov.tr";
+      static AUDIO_API_HOST = "api.sozluk.gov.tr";
+      static KUBBEALTI_HOST = "eski.lugatim.com";
       // Configuration
       static defaultTimeoutMs = 8e3;
       static defaultRetries = 1;
@@ -1481,12 +1566,12 @@ yDFx8r7i9vIJU5HS3moZLkYWAOilMaV9N56A9Bgb6dNcHkvg3NoaYA==
             continue;
           if (Math.abs(candidate.length - cleanWord.length) > 2)
             continue;
-          const rawDist = this.damerauLevenshtein(cleanWord, candidate);
+          const rawDist = damerauLevenshtein(cleanWord, candidate);
           if (rawDist === 0 || rawDist > 2)
             continue;
           const firstMismatch = candidate[0] === cleanWord[0] ? 0 : 1;
           const lengthMismatch = candidate.length === cleanWord.length ? 0 : 1;
-          const score = this.keyboardAwareDistance(cleanWord, candidate) + (firstMismatch > 0 ? 1.2 : 0);
+          const score = keyboardAwareDistance(cleanWord, candidate) + (firstMismatch > 0 ? 1.2 : 0);
           const better = !best || score < best.score - 1e-9 || Math.abs(score - best.score) < 1e-9 && firstMismatch < best.firstMismatch || Math.abs(score - best.score) < 1e-9 && firstMismatch === best.firstMismatch && lengthMismatch < best.lengthMismatch;
           if (better) {
             best = { candidate, score, rawDist, firstMismatch, lengthMismatch };
@@ -1617,14 +1702,11 @@ yDFx8r7i9vIJU5HS3moZLkYWAOilMaV9N56A9Bgb6dNcHkvg3NoaYA==
           const contentEnd = html.indexOf("<footer", contentStart);
           if (contentEnd === -1)
             return null;
-          return this.htmlToPlainText(html.slice(contentStart, contentEnd));
+          return htmlToPlainText(html.slice(contentStart, contentEnd));
         } catch {
           return null;
         }
       }
-      static htmlToPlainText(html) {
-        return html.replace(/<br\s*\/?>/gi, "\n").replace(/<\/(p|div)>/gi, "\n\n").replace(/<[^>]+>/g, "").replace(/&nbsp;/gi, " ").replace(/&lt;/gi, "<").replace(/&gt;/gi, ">").replace(/&quot;/gi, '"').replace(/&#39;|&rsquo;/gi, "'").replace(/&amp;/gi, "&").replace(/[ \t]+/g, " ").replace(/[ \t]*\n[ \t]*/g, "\n").replace(/\n{3,}/g, "\n\n").trim();
-      }
       /**
        * GETs a JSON path from Kubbealtı Lugatı's data API (`eski.lugatim.com`),
        * supplying `KUBBEALTI_EXTRA_CA` to work around that host's incomplete
@@ -1638,7 +1720,7 @@ yDFx8r7i9vIJU5HS3moZLkYWAOilMaV9N56A9Bgb6dNcHkvg3NoaYA==
               hostname: this.KUBBEALTI_HOST,
               path: path2,
               method: "GET",
-              ca: [...tls.rootCertificates, ...this.KUBBEALTI_EXTRA_CA],
+              ca: [...tls.rootCertificates, ...KUBBEALTI_EXTRA_CA],
               headers: {
                 "User-Agent": "Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/128.0.0.0 Safari/537.36"
               }
@@ -1730,7 +1812,7 @@ yDFx8r7i9vIJU5HS3moZLkYWAOilMaV9N56A9Bgb6dNcHkvg3NoaYA==
         const entries = await this.getKubbealti(word2);
         if (!entries)
           return null;
-        return entries.map((e) => this.htmlToPlainText(e.anlam));
+        return entries.map((e) => htmlToPlainText(e.anlam));
       }
       /**
        * Autocomplete suggestions from Kubbealtı Lugatı's own typeahead endpoint
@@ -1766,7 +1848,7 @@ yDFx8r7i9vIJU5HS3moZLkYWAOilMaV9N56A9Bgb6dNcHkvg3NoaYA==
           const match = html.match(/<meta name="description" content="([^"]*)"/);
           if (!match)
             return null;
-          const description = this.htmlToPlainText(match[1]);
+          const description = htmlToPlainText(match[1]);
           if (description === "\xC7a\u011Fda\u015F T\xFCrk\xE7enin Etimolojisi")
             return null;
           return description;
@@ -1997,56 +2079,6 @@ yDFx8r7i9vIJU5HS3moZLkYWAOilMaV9N56A9Bgb6dNcHkvg3NoaYA==
         }
         return analyses;
       }
-      /**
-       * Damerau-Levenshtein edit-distance (optimal string alignment variant):
-       * like classic Levenshtein but also counts an adjacent-character
-       * transposition (e.g. "yanlız" -> "yalnız") as a single edit instead of
-       * two substitutions — a very common class of typo that plain Levenshtein
-       * otherwise misses.
-       */
-      static damerauLevenshtein(a, b) {
-        const dp = Array.from({ length: a.length + 1 }, () => new Array(b.length + 1).fill(0));
-        for (let i = 0; i <= a.length; i++)
-          dp[i][0] = i;
-        for (let j = 0; j <= b.length; j++)
-          dp[0][j] = j;
-        for (let i = 1; i <= a.length; i++) {
-          for (let j = 1; j <= b.length; j++) {
-            const cost = a[i - 1] === b[j - 1] ? 0 : 1;
-            dp[i][j] = Math.min(dp[i - 1][j] + 1, dp[i][j - 1] + 1, dp[i - 1][j - 1] + cost);
-            if (i > 1 && j > 1 && a[i - 1] === b[j - 2] && a[i - 2] === b[j - 1]) {
-              dp[i][j] = Math.min(dp[i][j], dp[i - 2][j - 2] + cost);
-            }
-          }
-        }
-        return dp[a.length][b.length];
-      }
-      /**
-       * Keyboard- and diacritic-aware edit distance: same optimal-string-alignment
-       * recurrence as {@link damerauLevenshtein}, but a substitution is charged by
-       * {@link keyboardSubCost} (a fraction of an edit when the two letters are
-       * adjacent on a Turkish Q keyboard or are ASCII/diacritic siblings) and a
-       * transposition costs {@link TRANSPOSITION_COST}. Insertions and deletions
-       * still cost a full 1. Used only to *rank* spelling candidates; the plain
-       * integer distance still gates whether a suggestion is offered at all.
-       */
-      static keyboardAwareDistance(a, b) {
-        const dp = Array.from({ length: a.length + 1 }, () => new Array(b.length + 1).fill(0));
-        for (let i = 0; i <= a.length; i++)
-          dp[i][0] = i;
-        for (let j = 0; j <= b.length; j++)
-          dp[0][j] = j;
-        for (let i = 1; i <= a.length; i++) {
-          for (let j = 1; j <= b.length; j++) {
-            const cost = keyboardSubCost(a[i - 1], b[j - 1]);
-            dp[i][j] = Math.min(dp[i - 1][j] + 1, dp[i][j - 1] + 1, dp[i - 1][j - 1] + cost);
-            if (i > 1 && j > 1 && a[i - 1] === b[j - 2] && a[i - 2] === b[j - 1]) {
-              dp[i][j] = Math.min(dp[i][j], dp[i - 2][j - 2] + TRANSPOSITION_COST);
-            }
-          }
-        }
-        return dp[a.length][b.length];
-      }
       /**
        * Fetches multiple words concurrently with a small delay to avoid rate limiting.
        */