@sideid/id-profanity-filter 1.9.6 → 1.10.5

package/src/core/filter.ts

@@ -1,12 +1,13 @@
 import { FilterOptions, FilterResult, ProfanityWord } from "../types";
 import { findProfanity, findProfanityWithMetadata } from "./matcher";
-import { censorWord, escapeRegExp, normalizeText } from "../utils/stringUtils";
+import { censorWord, escapeRegExp } from "../utils/stringUtils";
 import { createWordRegex } from "../utils/regexUtils";
-import {
-  DEFAULT_OPTIONS,
-  makeRandomGrawlixString,
-  getRandomGrawlix,
-} from "../config/options";
+import { DEFAULT_OPTIONS, makeRandomGrawlixString } from "../config/options";
+
+interface FindProfanityFunction {
+  (text: string, options?: FilterOptions): string[];
+  lastActualMatches?: Map<string, string[]>;
+}
 
 /**
  * Menyensor kata kotor dalam teks
@@ -28,6 +29,11 @@ export function filter(
     useRandomGrawlix = false,
     keepFirstAndLast = false,
     indonesianVariation = false,
+    detectSplit = false,
+    detectSimilarity = false,
+    useLevenshtein = false,
+    maxLevenshteinDistance = 2,
+    similarityThreshold = 0.8,
   } = { ...DEFAULT_OPTIONS, ...options };
 
   const matches = findProfanity(text, {
@@ -36,8 +42,16 @@ export function filter(
     whitelist,
     checkSubstring,
     indonesianVariation,
+    detectSplit,
+    detectSimilarity,
+    useLevenshtein,
+    maxLevenshteinDistance,
+    similarityThreshold,
   });
 
+  const actualMatches: Map<string, string[]> =
+    (findProfanity as FindProfanityFunction).lastActualMatches || new Map();
+
   const matchDetails = findProfanityWithMetadata(text, options);
 
   if (matches.length === 0) {
@@ -66,49 +80,176 @@ export function filter(
           )),
     );
 
-    const regex = createWordRegex(word, {
-      wholeWord: true,
-      caseSensitive: false,
-      leetSpeak: false,
-      detectSplit: false,
-      indonesianVariation: false,
-    });
+    const variants = actualMatches.get(word.toLowerCase()) || [];
+    variants.push(word);
+
+    const uniqueVariants = [...new Set(variants)];
 
-    let match;
-    const textToSearch = filteredText;
+    uniqueVariants.forEach((variant) => {
+      const regex = new RegExp(`\\b${escapeRegExp(variant)}\\b`, "gi");
 
-    regex.lastIndex = 0;
+      let match;
+      while ((match = regex.exec(filteredText)) !== null) {
+        const originalWord = match[0];
 
-    while ((match = regex.exec(textToSearch)) !== null) {
-      const originalWord = match[0];
+        if (whitelist.includes(originalWord.toLowerCase())) continue;
 
-      if (whitelist.includes(originalWord.toLowerCase())) continue;
+        let censoredWord;
+        if (useRandomGrawlix) {
+          censoredWord = makeRandomGrawlixString(originalWord.length);
+        } else {
+          censoredWord = censorWord(
+            originalWord,
+            replaceWith,
+            !fullWordCensor && keepFirstAndLast,
+          );
+        }
 
-      let censoredWord;
-      if (useRandomGrawlix) {
-        censoredWord = makeRandomGrawlixString(originalWord.length);
-      } else {
-        censoredWord = censorWord(
-          originalWord,
-          replaceWith,
-          !fullWordCensor && keepFirstAndLast,
+        replacements.push({
+          original: originalWord,
+          censored: censoredWord,
+          metadata,
+        });
+
+        filteredText = filteredText.replace(
+          new RegExp(`\\b${escapeRegExp(originalWord)}\\b`, "g"),
+          censoredWord,
         );
       }
+    });
 
-      replacements.push({
-        original: originalWord,
-        censored: censoredWord,
-        metadata,
-      });
+    if (detectSplit || detectLeetSpeak) {
+      if (detectLeetSpeak) {
+        const leetRegex = createWordRegex(word, {
+          wholeWord: true,
+          caseSensitive: false,
+          leetSpeak: true,
+          detectSplit: false,
+          indonesianVariation: false,
+        });
 
-      const replaceRegex = new RegExp(
-        `\\b${escapeRegExp(originalWord)}\\b`,
-        "g",
-      );
-      filteredText = filteredText.replace(replaceRegex, censoredWord);
+        let match;
+        while ((match = leetRegex.exec(filteredText)) !== null) {
+          const originalWord = match[0];
+
+          if (whitelist.includes(originalWord.toLowerCase())) continue;
+
+          let censoredWord;
+          if (useRandomGrawlix) {
+            censoredWord = makeRandomGrawlixString(originalWord.length);
+          } else {
+            censoredWord = censorWord(
+              originalWord,
+              replaceWith,
+              !fullWordCensor && keepFirstAndLast,
+            );
+          }
+
+          replacements.push({
+            original: originalWord,
+            censored: censoredWord,
+            metadata,
+          });
+
+          filteredText = filteredText.replace(
+            new RegExp(escapeRegExp(originalWord), "g"),
+            censoredWord,
+          );
+        }
+      }
+
+      if (detectSplit) {
+        const splitRegex = createWordRegex(word, {
+          wholeWord: false,
+          caseSensitive: false,
+          leetSpeak: false,
+          detectSplit: true,
+          indonesianVariation: false,
+        });
+
+        let match;
+        while ((match = splitRegex.exec(filteredText)) !== null) {
+          const originalWord = match[0];
+
+          if (whitelist.includes(originalWord.toLowerCase())) continue;
+
+          let censoredWord;
+          if (useRandomGrawlix) {
+            censoredWord = makeRandomGrawlixString(originalWord.length);
+          } else {
+            censoredWord = censorWord(
+              originalWord,
+              replaceWith,
+              !fullWordCensor && keepFirstAndLast,
+            );
+          }
+
+          replacements.push({
+            original: originalWord,
+            censored: censoredWord,
+            metadata,
+          });
+
+          filteredText = filteredText.replace(
+            new RegExp(escapeRegExp(originalWord), "g"),
+            censoredWord,
+          );
+        }
+      }
     }
   });
 
+  if (detectSimilarity && useLevenshtein) {
+    matches.forEach((word) => {
+      const metadata = matchDetails.find(
+        (m) =>
+          m.word.toLowerCase() === word.toLowerCase() ||
+          (m.aliases &&
+            m.aliases.some(
+              (alias) => alias.toLowerCase() === word.toLowerCase(),
+            )),
+      );
+
+      const variants = actualMatches.get(word.toLowerCase()) || [];
+
+      variants.forEach((variant) => {
+        const exactVariantRegex = new RegExp(
+          `\\b${escapeRegExp(variant)}\\b`,
+          "gi",
+        );
+
+        let match;
+        while ((match = exactVariantRegex.exec(filteredText)) !== null) {
+          const originalWord = match[0];
+
+          if (whitelist.includes(originalWord.toLowerCase())) continue;
+
+          let censoredWord;
+          if (useRandomGrawlix) {
+            censoredWord = makeRandomGrawlixString(originalWord.length);
+          } else {
+            censoredWord = censorWord(
+              originalWord,
+              replaceWith,
+              !fullWordCensor && keepFirstAndLast,
+            );
+          }
+
+          replacements.push({
+            original: originalWord,
+            censored: censoredWord,
+            metadata,
+          });
+
+          filteredText = filteredText.replace(
+            new RegExp(`\\b${escapeRegExp(originalWord)}\\b`, "g"),
+            censoredWord,
+          );
+        }
+      });
+    });
+  }
+
   return {
     filtered: filteredText,
     censored: replacements.length,

package/src/core/matcher.ts

@@ -5,25 +5,20 @@ import {
   FilterOptions,
 } from "../types";
 
-import { wordObjects, getWordsByFilter } from "../constants/wordList";
-import {
-  normalizeText,
-  escapeRegExp,
-  containsAnyWord,
-  detectSplitWords,
-} from "../utils/stringUtils";
-import {
-  createWordRegex,
-  addLeetSpeakVariations,
-  addIndonesianVariations,
-  addSplitVariations,
-} from "../utils/regexUtils";
+import { wordObjects } from "../constants/wordList";
+import { normalizeText } from "../utils/stringUtils";
+import { createWordRegex } from "../utils/regexUtils";
 import {
   findPossibleProfanityBySimiliarity,
-  stringSimilarity,
+  findProfanityByLevenshteinDistance,
 } from "../utils/similarityUtils";
 import { DEFAULT_OPTIONS } from "../config/options";
 
+interface FindProfanityFunction {
+  (text: string, options?: FilterOptions): string[];
+  lastActualMatches?: Map<string, string[]>;
+}
+
 export function findProfanity(
   text: string,
   options: FilterOptions = {},
@@ -40,38 +35,55 @@ export function findProfanity(
     detectSimilarity = false,
     similarityThreshold = 0.8,
     detectSplit = false,
+    useLevenshtein = false,
+    maxLevenshteinDistance = 2,
   } = { ...DEFAULT_OPTIONS, ...options };
 
   const normalizedText = normalizeText(text);
 
-  let wordsToCheck: string[] = wordList.length > 0 ? wordList : [];
+  let baseWordsToCheck: string[] = wordList.length > 0 ? wordList : [];
 
-  if (wordsToCheck.length === 0) {
-    if (categories || regions || severityThreshold > 0) {
-      wordsToCheck = wordObjects
-        .filter((word) => {
-          const matchCategory = categories
-            ? categories.includes(word.category)
-            : true;
-          const matchRegion = regions ? regions.includes(word.region) : true;
-          const matchSeverity = word.severity >= severityThreshold;
-          return matchCategory && matchRegion && matchSeverity;
-        })
-        .map((word) => word.word);
-    } else {
-      wordsToCheck = wordObjects.map((word) => word.word);
-    }
+  if (baseWordsToCheck.length === 0) {
+    const filteredWords = wordObjects.filter((word) => {
+      const matchCategory = categories
+        ? categories.includes(word.category)
+        : true;
+      const matchRegion = regions ? regions.includes(word.region) : true;
+      const matchSeverity = word.severity >= severityThreshold;
+      return matchCategory && matchRegion && matchSeverity;
+    });
+
+    baseWordsToCheck = filteredWords.map((word) => word.word);
   }
 
-  wordsToCheck = wordsToCheck.filter(
-    (word) => !whitelist.includes(word.toLocaleLowerCase()),
-  );
+  const aliasMap = new Map<string, string>();
+  wordObjects.forEach((wordObj) => {
+    if (wordObj.aliases && wordObj.aliases.length > 0) {
+      const matchCategory = categories
+        ? categories.includes(wordObj.category)
+        : true;
+      const matchRegion = regions ? regions.includes(wordObj.region) : true;
+      const matchSeverity = wordObj.severity >= severityThreshold;
+
+      if (matchCategory && matchRegion && matchSeverity) {
+        wordObj.aliases.forEach((alias) => {
+          aliasMap.set(alias.toLowerCase(), wordObj.word.toLowerCase());
+        });
+      }
+    }
+  });
+
+  const wordsToCheck = [
+    ...baseWordsToCheck,
+    ...Array.from(aliasMap.keys()),
+  ].filter((word) => !whitelist.includes(word.toLowerCase()));
 
   if (wordsToCheck.length === 0) {
     return [];
   }
 
   const matches = new Set<string>();
+  const actualMatches = new Map<string, string[]>();
 
   wordsToCheck.forEach((word) => {
     const regex = createWordRegex(word, {
@@ -84,7 +96,14 @@ export function findProfanity(
 
     let match;
     while ((match = regex.exec(normalizedText)) !== null) {
-      matches.add(word.toLowerCase());
+      const originalWord =
+        aliasMap.get(word.toLowerCase()) || word.toLowerCase();
+      matches.add(originalWord);
+
+      if (!actualMatches.has(originalWord)) {
+        actualMatches.set(originalWord, []);
+      }
+      actualMatches.get(originalWord)?.push(match[0]);
     }
   });
 
@@ -100,7 +119,14 @@ export function findProfanity(
 
       let match;
       while ((match = leetRegex.exec(text)) !== null) {
-        matches.add(word.toLowerCase());
+        const originalWord =
+          aliasMap.get(word.toLowerCase()) || word.toLowerCase();
+        matches.add(originalWord);
+
+        if (!actualMatches.has(originalWord)) {
+          actualMatches.set(originalWord, []);
+        }
+        actualMatches.get(originalWord)?.push(match[0]);
       }
     });
   }
@@ -117,41 +143,85 @@ export function findProfanity(
 
       let match;
       while ((match = variantRegex.exec(text)) !== null) {
-        matches.add(word.toLowerCase());
+        const originalWord =
+          aliasMap.get(word.toLowerCase()) || word.toLowerCase();
+        matches.add(originalWord);
+
+        if (!actualMatches.has(originalWord)) {
+          actualMatches.set(originalWord, []);
+        }
+        actualMatches.get(originalWord)?.push(match[0]);
       }
     });
   }
 
   if (detectSplit) {
-    if (detectSplitWords(text, wordsToCheck)) {
-      wordsToCheck.forEach((word) => {
-        const splitRegex = createWordRegex(word, {
-          wholeWord: false,
-          caseSensitive: false,
-          leetSpeak: false,
-          detectSplit: true,
-          indonesianVariation: false,
-        });
+    wordsToCheck.forEach((word) => {
+      const splitRegex = createWordRegex(word, {
+        wholeWord: false,
+        caseSensitive: false,
+        leetSpeak: false,
+        detectSplit: true,
+        indonesianVariation: false,
+      });
 
-        if (splitRegex.test(text)) {
-          matches.add(word.toLowerCase());
+      let match;
+      while ((match = splitRegex.exec(text)) !== null) {
+        const originalWord =
+          aliasMap.get(word.toLowerCase()) || word.toLowerCase();
+        matches.add(originalWord);
+
+        if (!actualMatches.has(originalWord)) {
+          actualMatches.set(originalWord, []);
         }
-      });
-    }
+        actualMatches.get(originalWord)?.push(match[0]);
+      }
+    });
   }
 
   if (detectSimilarity) {
-    const possibleProfanity = findPossibleProfanityBySimiliarity(
-      text,
-      wordsToCheck,
-      similarityThreshold,
-    );
-
-    possibleProfanity.forEach((item) => {
-      matches.add(item.original.toLowerCase());
-    });
+    if (useLevenshtein) {
+      const possibleProfanity = findProfanityByLevenshteinDistance(
+        text,
+        wordsToCheck,
+        similarityThreshold,
+        maxLevenshteinDistance,
+      );
+
+      possibleProfanity.forEach((item) => {
+        const originalWord =
+          aliasMap.get(item.original.toLowerCase()) ||
+          item.original.toLowerCase();
+        matches.add(originalWord);
+
+        if (!actualMatches.has(originalWord)) {
+          actualMatches.set(originalWord, []);
+        }
+        actualMatches.get(originalWord)?.push(item.word);
+      });
+    } else {
+      const possibleProfanity = findPossibleProfanityBySimiliarity(
+        text,
+        wordsToCheck,
+        similarityThreshold,
+      );
+
+      possibleProfanity.forEach((item) => {
+        matches.add(item.original.toLowerCase());
+
+        const originalWord =
+          aliasMap.get(item.original.toLowerCase()) ||
+          item.original.toLowerCase();
+        if (!actualMatches.has(originalWord)) {
+          actualMatches.set(originalWord, []);
+        }
+        actualMatches.get(originalWord)?.push(item.word);
+      });
+    }
   }
 
+  (findProfanity as FindProfanityFunction).lastActualMatches = actualMatches;
+
   return Array.from(matches);
 }
 

package/src/index.ts

@@ -21,7 +21,6 @@ import {
   CATEGORY_PRESETS,
   REGION_PRESETS,
   getPresetOptions,
-  makeRandomGrawlixString,
 } from "./config/options";
 
 export class IDProfanityFilter {
@@ -161,10 +160,30 @@ export class IDProfanityFilter {
   /**
    * Mengaktifkan deteksi berdasarkan kesamaan
    * @param threshold Threshold kesamaan (0-1)
+   * @param useLevenshtein Gunakan algoritma Levenshtein untuk deteksi
+   * @param maxLevenshteinDistance Jarak maksimal Levenshtein (default: 2)
    */
-  enableSimilarityDetection(threshold: number = 0.8) {
+  enableSimilarityDetection(
+    threshold: number = 0.8,
+    useLevenshtein: boolean = false,
+    maxLevenshteinDistance: number = 2,
+  ) {
+    this.options.detectSimilarity = true;
+    this.options.similarityThreshold = threshold;
+    this.options.useLevenshtein = useLevenshtein;
+    this.options.maxLevenshteinDistance = maxLevenshteinDistance;
+  }
+
+  /**
+   * Mengaktifkan deteksi berbasis Levenshtein distance
+   * @param threshold Threshold kesamaan (0-1)
+   * @param maxDistance Jarak maksimal Levenshtein (default: 2)
+   */
+  enableLevenshteinDetection(threshold: number = 0.8, maxDistance: number = 2) {
     this.options.detectSimilarity = true;
+    this.options.useLevenshtein = true;
     this.options.similarityThreshold = threshold;
+    this.options.maxLevenshteinDistance = maxDistance;
   }
 }
 

package/src/types/index.ts

@@ -50,9 +50,11 @@ export interface FilterOptions {
   useRandomGrawlix?: boolean;
   keepFirstAndLast?: boolean;
   indonesianVariation?: boolean;
-  detectSimilarity?: boolean;
-  similarityThreshold?: number;
+  detectSimilarity?: boolean; // Enable/disable Levenshtein distance matching
+  similarityThreshold?: number; // Threshold for Levenshtein distance similarity (0-1)
   detectSplit?: boolean;
+  useLevenshtein?: boolean; // New option specifically for Levenshtein algorithm
+  maxLevenshteinDistance?: number; // Maximum allowed Levenshtein distance
 }
 
 export interface FilterResult {

package/src/utils/regexUtils.ts

@@ -72,7 +72,6 @@ export function addLeetSpeakVariations(pattern: string): string {
     z: ["z", "2"],
   };
 
-  // Ganti tiap karakter dengan variasinya dalam grup character class
   return pattern
     .split("")
     .map((char) => {

package/src/utils/similarityUtils.ts

@@ -91,6 +91,48 @@ export function findMostSimilar(
   return mostSimilar;
 }
 
+/**
+ * Mencari string yang paling mirip dari array menggunakan Levenshtein distance
+ *
+ * @param target String target
+ * @param candidates Array string kandidat
+ * @param threshold Minimum kesamaan yang diterima (0-1)
+ * @param maxDistance Jarak Levenshtein maksimal yang diterima (default: 3)
+ * @returns String yang paling mirip atau null jika tidak ada yang di atas threshold
+ */
+export function findMostSimilarWithLevenshtein(
+  target: string,
+  candidates: string[],
+  threshold: number = 0.7,
+  maxDistance: number = 3,
+): string | null {
+  if (!candidates.length) return null;
+
+  let maxSimilarity = 0;
+  let minDistance = Infinity;
+  let mostSimilar: string | null = null;
+
+  for (const candidate of candidates) {
+    if (Math.abs(target.length - candidate.length) > maxDistance) continue;
+
+    const distance = levenshteinDistance(target, candidate);
+    const similarity = stringSimilarity(target, candidate);
+
+    if (
+      (similarity > maxSimilarity && similarity >= threshold) ||
+      (similarity >= threshold && distance < minDistance)
+    ) {
+      maxSimilarity = similarity;
+      minDistance = distance;
+      mostSimilar = candidate;
+
+      if (distance <= 1 || similarity > 0.95) break;
+    }
+  }
+
+  return mostSimilar;
+}
+
 /**
  * Cek apakah string mungkin merupakan variasi dari kata kotor
  * menggunakan kesamaan string
@@ -170,11 +212,9 @@ export function findPossibleProfanityBySimiliarity(
   const result: Array<{ word: string; original: string; similarity: number }> =
     [];
 
-  // Pisahkan teks menjadi kata-kata
   const words = text.toLowerCase().split(/\s+/);
 
   for (const word of words) {
-    // Lewati kata-kata yang terlalu pendek
     if (word.length < 3) continue;
 
     for (const profanity of profanityWords) {
@@ -193,3 +233,58 @@ export function findPossibleProfanityBySimiliarity(
 
   return result;
 }
+
+/**
+ * Cari kata-kata kotor yang mungkin dari teks menggunakan Levenshtein distance
+ *
+ * @param text Teks yang akan diperiksa
+ * @param profanityWords Daftar kata kotor
+ * @param threshold Batas minimum kesamaan (default: 0.8)
+ * @param maxDistance Jarak Levenshtein maksimal (default: 2)
+ * @returns Array kata yang mungkin merupakan kata kotor
+ */
+export function findProfanityByLevenshteinDistance(
+  text: string,
+  profanityWords: string[],
+  threshold: number = 0.8,
+  maxDistance: number = 2,
+): Array<{
+  word: string;
+  original: string;
+  similarity: number;
+  distance: number;
+}> {
+  const result: Array<{
+    word: string;
+    original: string;
+    similarity: number;
+    distance: number;
+  }> = [];
+
+  const words = text.toLowerCase().split(/\s+/);
+
+  for (const word of words) {
+    if (word.length < 3) continue;
+
+    for (const profanity of profanityWords) {
+      if (Math.abs(word.length - profanity.length) > maxDistance) continue;
+
+      const distance = levenshteinDistance(word, profanity);
+      if (distance <= maxDistance) {
+        const similarity = stringSimilarity(word, profanity);
+
+        if (similarity >= threshold) {
+          result.push({
+            word,
+            original: profanity,
+            similarity,
+            distance,
+          });
+          break;
+        }
+      }
+    }
+  }
+
+  return result;
+}