tdk-api-wrapper 1.5.1 → 1.6.1

package/README.md

@@ -90,7 +90,7 @@ Aşağıdaki metotlar `TDK` sınıfı üzerinden statik olarak veya `TDKClient`
 - **`TDK.checkVowelHarmony(word)`**: Kelimenin büyük ünlü uyumuna uyup uymadığını (boolean) kontrol eder.
 - **`TDK.checkLabialHarmony(word)`**: Kelimenin küçük ünlü uyumuna (düzlük-yuvarlaklık uyumu) uyup uymadığını (boolean) kontrol eder.
 - **`TDK.getPartOfSpeech(word)`**: Kelimenin sözcük türünü (isim, sıfat, zarf vb.) döndürür.
-- **`TDK.checkSpelling(word)`**: Kelimenin doğru yazılıp yazılmadığını kontrol eder. Önce TDK'de doğrudan arar; bulamazsa TDK'nin "sık yapılan yanlışlar" listesini kontrol eder. Ardından **morfolojik ek sıyırma (stemming) motoru** devreye girer; kelime çekimli bir biçimse (`halılarımızın`, `kitabımız`, `çocuğa`, `okuyoruz`, `hakkımızda`, `başlıyor`) kökünü tespit edip `{ isCorrect: true, isInflected: true, root: "..." }` döner. Son aşamada ise TDK'nin ~81 bin kelimelik tam madde listesi üzerinde Damerau-Levenshtein edit-distance ile en yakın kelimeyi önerir (`yanlız` → `yalnız`).
+- **`TDK.checkSpelling(word)`**: Kelimenin doğru yazılıp yazılmadığını kontrol eder. Önce TDK'de doğrudan arar; bulamazsa TDK'nin "sık yapılan yanlışlar" listesini kontrol eder. Ardından **morfolojik ek sıyırma (stemming) motoru** devreye girer; kelime çekimli bir biçimse (`halılarımızın`, `kitabımız`, `çocuğa`, `okuyoruz`, `hakkımızda`, `başlıyor`) kökünü tespit edip `{ isCorrect: true, isInflected: true, root: "..." }` döner. Son aşamada ise TDK'nin ~81 bin kelimelik tam madde listesi üzerinde **klavye ve düzeltme işareti farkındalıklı** bir Damerau-Levenshtein edit-distance ile en yakın kelimeyi önerir: Türkçe Q klavyede yan yana duran tuşlar (`arabs` → `araba`, `swlam` → `selam`) ve ASCII/Türkçe harf ikilileri (`ı/i`, `ş/s`, `ö/o` …) tam bir düzeltme yerine bir düzeltmenin küçük bir kesri kadar sayılır; böylece hem en yakın hem de en olası madde kazanır (`yanlız` → `yalnız`).
 - **`TDK.getCompoundWords(word)`**: Aranan kelime ile oluşturulmuş birleşik kelimeleri (Örn: dolma kalem) listeler.
 
 ### 3. Morfoloji ve Kök Bulma (Morphology Engine)

package/dist/{chunk-NEC5MIQM.mjs → chunk-ZFWZXNGY.mjs}

@@ -744,6 +744,57 @@ var COMMON_MISSPELLINGS = {
   babaanne: "babaanne"
 };
 var SEY_EXCEPTIONS = /* @__PURE__ */ new Set(["d\xFC\u015Fey", "e\u015Fey", "konsey", "jersey", "\u015Fey"]);
+var KEYBOARD_ROWS = [
+  ["qwertyu\u0131op\u011F\xFC", 0],
+  ["asdfghjkl\u015Fi", 0.5],
+  ["zxcvbnm\xF6\xE7", 1]
+];
+var KEYBOARD_COORDS = (() => {
+  const coords = {};
+  KEYBOARD_ROWS.forEach(([keys, offset], row) => {
+    [...keys].forEach((key, col) => {
+      coords[key] = [col + offset, row];
+    });
+  });
+  return coords;
+})();
+var 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"
+};
+var KEYBOARD_ROW_SUB_COST = 0.4;
+var KEYBOARD_DIAGONAL_SUB_COST = 0.55;
+var DIACRITIC_SUB_COST = 0.3;
+var TRANSPOSITION_COST = 0.8;
+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 TDK = class {
   static BASE_URL = "https://sozluk.gov.tr";
   static AUDIO_API_HOST = "api.sozluk.gov.tr";
@@ -1371,14 +1422,14 @@ yDFx8r7i9vIJU5HS3moZLkYWAOilMaV9N56A9Bgb6dNcHkvg3NoaYA==
       if (Math.abs(candidate.length - cleanWord.length) > 2)
         continue;
       const rawDist = this.damerauLevenshtein(cleanWord, candidate);
-      if (rawDist === 0)
+      if (rawDist === 0 || rawDist > 2)
         continue;
       const firstMismatch = candidate[0] === cleanWord[0] ? 0 : 1;
       const lengthMismatch = candidate.length === cleanWord.length ? 0 : 1;
-      const distance = rawDist + (firstMismatch > 0 ? 1.2 : 0);
-      const better = !best || distance < best.distance || distance === best.distance && firstMismatch < best.firstMismatch || distance === best.distance && firstMismatch === best.firstMismatch && lengthMismatch < best.lengthMismatch;
+      const score = this.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, distance, rawDist, firstMismatch, lengthMismatch };
+        best = { candidate, score, rawDist, firstMismatch, lengthMismatch };
       }
     }
     if (best && best.rawDist <= 2 && (best.firstMismatch === 0 || best.rawDist <= 1)) {
@@ -1910,6 +1961,32 @@ yDFx8r7i9vIJU5HS3moZLkYWAOilMaV9N56A9Bgb6dNcHkvg3NoaYA==
     }
     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.
    */

package/dist/cli.js

@@ -769,6 +769,57 @@ var COMMON_MISSPELLINGS = {
   babaanne: "babaanne"
 };
 var SEY_EXCEPTIONS = /* @__PURE__ */ new Set(["d\xFC\u015Fey", "e\u015Fey", "konsey", "jersey", "\u015Fey"]);
+var KEYBOARD_ROWS = [
+  ["qwertyu\u0131op\u011F\xFC", 0],
+  ["asdfghjkl\u015Fi", 0.5],
+  ["zxcvbnm\xF6\xE7", 1]
+];
+var KEYBOARD_COORDS = (() => {
+  const coords = {};
+  KEYBOARD_ROWS.forEach(([keys, offset], row) => {
+    [...keys].forEach((key, col) => {
+      coords[key] = [col + offset, row];
+    });
+  });
+  return coords;
+})();
+var 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"
+};
+var KEYBOARD_ROW_SUB_COST = 0.4;
+var KEYBOARD_DIAGONAL_SUB_COST = 0.55;
+var DIACRITIC_SUB_COST = 0.3;
+var TRANSPOSITION_COST = 0.8;
+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 TDK = class {
   static BASE_URL = "https://sozluk.gov.tr";
   static AUDIO_API_HOST = "api.sozluk.gov.tr";
@@ -1396,14 +1447,14 @@ yDFx8r7i9vIJU5HS3moZLkYWAOilMaV9N56A9Bgb6dNcHkvg3NoaYA==
       if (Math.abs(candidate.length - cleanWord.length) > 2)
         continue;
       const rawDist = this.damerauLevenshtein(cleanWord, candidate);
-      if (rawDist === 0)
+      if (rawDist === 0 || rawDist > 2)
         continue;
       const firstMismatch = candidate[0] === cleanWord[0] ? 0 : 1;
       const lengthMismatch = candidate.length === cleanWord.length ? 0 : 1;
-      const distance = rawDist + (firstMismatch > 0 ? 1.2 : 0);
-      const better = !best || distance < best.distance || distance === best.distance && firstMismatch < best.firstMismatch || distance === best.distance && firstMismatch === best.firstMismatch && lengthMismatch < best.lengthMismatch;
+      const score = this.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, distance, rawDist, firstMismatch, lengthMismatch };
+        best = { candidate, score, rawDist, firstMismatch, lengthMismatch };
       }
     }
     if (best && best.rawDist <= 2 && (best.firstMismatch === 0 || best.rawDist <= 1)) {
@@ -1935,6 +1986,32 @@ yDFx8r7i9vIJU5HS3moZLkYWAOilMaV9N56A9Bgb6dNcHkvg3NoaYA==
     }
     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.
    */

package/dist/cli.mjs

@@ -1,7 +1,7 @@
 #!/usr/bin/env node
 import {
   TDK
-} from "./chunk-NEC5MIQM.mjs";
+} from "./chunk-ZFWZXNGY.mjs";
 
 // src/cli.ts
 var rawArgs = process.argv.slice(2);

package/dist/index.d.mts

@@ -508,6 +508,16 @@ declare class TDK {
      * otherwise misses.
      */
     private static damerauLevenshtein;
+    /**
+     * 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.
+     */
+    private static keyboardAwareDistance;
     /**
      * Fetches multiple words concurrently with a small delay to avoid rate limiting.
      */

package/dist/index.d.ts

@@ -508,6 +508,16 @@ declare class TDK {
      * otherwise misses.
      */
     private static damerauLevenshtein;
+    /**
+     * 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.
+     */
+    private static keyboardAwareDistance;
     /**
      * Fetches multiple words concurrently with a small delay to avoid rate limiting.
      */

package/dist/index.js

@@ -793,6 +793,57 @@ var COMMON_MISSPELLINGS = {
   babaanne: "babaanne"
 };
 var SEY_EXCEPTIONS = /* @__PURE__ */ new Set(["d\xFC\u015Fey", "e\u015Fey", "konsey", "jersey", "\u015Fey"]);
+var KEYBOARD_ROWS = [
+  ["qwertyu\u0131op\u011F\xFC", 0],
+  ["asdfghjkl\u015Fi", 0.5],
+  ["zxcvbnm\xF6\xE7", 1]
+];
+var KEYBOARD_COORDS = (() => {
+  const coords = {};
+  KEYBOARD_ROWS.forEach(([keys, offset], row) => {
+    [...keys].forEach((key, col) => {
+      coords[key] = [col + offset, row];
+    });
+  });
+  return coords;
+})();
+var 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"
+};
+var KEYBOARD_ROW_SUB_COST = 0.4;
+var KEYBOARD_DIAGONAL_SUB_COST = 0.55;
+var DIACRITIC_SUB_COST = 0.3;
+var TRANSPOSITION_COST = 0.8;
+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 TDK = class {
   static BASE_URL = "https://sozluk.gov.tr";
   static AUDIO_API_HOST = "api.sozluk.gov.tr";
@@ -1420,14 +1471,14 @@ yDFx8r7i9vIJU5HS3moZLkYWAOilMaV9N56A9Bgb6dNcHkvg3NoaYA==
       if (Math.abs(candidate.length - cleanWord.length) > 2)
         continue;
       const rawDist = this.damerauLevenshtein(cleanWord, candidate);
-      if (rawDist === 0)
+      if (rawDist === 0 || rawDist > 2)
         continue;
       const firstMismatch = candidate[0] === cleanWord[0] ? 0 : 1;
       const lengthMismatch = candidate.length === cleanWord.length ? 0 : 1;
-      const distance = rawDist + (firstMismatch > 0 ? 1.2 : 0);
-      const better = !best || distance < best.distance || distance === best.distance && firstMismatch < best.firstMismatch || distance === best.distance && firstMismatch === best.firstMismatch && lengthMismatch < best.lengthMismatch;
+      const score = this.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, distance, rawDist, firstMismatch, lengthMismatch };
+        best = { candidate, score, rawDist, firstMismatch, lengthMismatch };
       }
     }
     if (best && best.rawDist <= 2 && (best.firstMismatch === 0 || best.rawDist <= 1)) {
@@ -1959,6 +2010,32 @@ yDFx8r7i9vIJU5HS3moZLkYWAOilMaV9N56A9Bgb6dNcHkvg3NoaYA==
     }
     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.
    */

package/dist/index.mjs

@@ -13,7 +13,7 @@ import {
   restoreInfinitive,
   restoreVowelDrop,
   restoreVowelNarrowing
-} from "./chunk-NEC5MIQM.mjs";
+} from "./chunk-ZFWZXNGY.mjs";
 export {
   TDK,
   TDKClient,

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "tdk-api-wrapper",
-  "version": "1.5.1",
+  "version": "1.6.1",
   "description": "TDK (Türk Dil Kurumu) unofficial live data API wrapper for Node.js",
   "main": "dist/index.js",
   "module": "dist/index.mjs",
@@ -25,10 +25,30 @@
     "api",
     "turkish",
     "dictionary",
-    "turkce"
+    "turkce",
+    "sozluk.gov.tr",
+    "spell-check",
+    "morphology",
+    "kubbealti",
+    "nisanyan",
+    "wiktionary"
   ],
-  "author": "",
+  "author": "cemyilmazzzz122 <cemyleo12@icloud.com> (https://github.com/cemyilmazzzz122)",
   "license": "MIT",
+  "homepage": "https://github.com/cemyilmazzzz122/tdk-api#readme",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/cemyilmazzzz122/tdk-api.git"
+  },
+  "bugs": {
+    "url": "https://github.com/cemyilmazzzz122/tdk-api/issues"
+  },
+  "engines": {
+    "node": ">=18"
+  },
+  "files": [
+    "dist"
+  ],
   "devDependencies": {
     "@types/node": "^22.0.0",
     "tsup": "^8.0.2",

package/.github/workflows/publish.yml

@@ -1,41 +0,0 @@
-name: Publish to npm
-
-on:
-  push:
-    branches: [main]
-
-jobs:
-  publish:
-    runs-on: ubuntu-latest
-    steps:
-      - uses: actions/checkout@v4
-
-      - uses: actions/setup-node@v4
-        with:
-          node-version: '20'
-          registry-url: 'https://registry.npmjs.org'
-
-      - run: npm ci
-
-      - name: Check if version changed
-        id: version-check
-        run: |
-          LOCAL_VERSION=$(node -p "require('./package.json').version")
-          PKG_NAME=$(node -p "require('./package.json').name")
-          PUBLISHED_VERSION=$(npm view "$PKG_NAME" version 2>/dev/null || echo "0.0.0")
-          echo "Local: $LOCAL_VERSION / Published: $PUBLISHED_VERSION"
-          if [ "$LOCAL_VERSION" != "$PUBLISHED_VERSION" ]; then
-            echo "changed=true" >> "$GITHUB_OUTPUT"
-          else
-            echo "changed=false" >> "$GITHUB_OUTPUT"
-          fi
-
-      - name: Build
-        if: steps.version-check.outputs.changed == 'true'
-        run: npm run build
-
-      - name: Publish
-        if: steps.version-check.outputs.changed == 'true'
-        run: npm publish
-        env:
-          NODE_AUTH_TOKEN: ${{ secrets.NPM_TOKEN }}