@pseolint/core 0.1.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 ouranos-labs
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,53 @@
+# @pseolint/core
+
+> Programmatic SEO audit engine — 34 rules across 6 categories for SpamBrain risk detection.
+
+The core engine behind [pseolint](https://www.npmjs.com/package/pseolint). Use this package to integrate pSEO auditing into your own tools.
+
+## Install
+
+```bash
+npm install @pseolint/core
+```
+
+## Usage
+
+```typescript
+import { auditSource } from "@pseolint/core";
+
+const summary = await auditSource("./out");
+console.log(`Score: ${summary.score}/100`);
+console.log(`Findings: ${summary.findings.length}`);
+```
+
+## What It Checks
+
+34 rules across 6 categories:
+
+- **SpamBrain Risk** — near-duplicate detection (SimHash), entity-swap doorway pages, thin content, boilerplate ratio, template diversity
+- **Content Quality** — unique value per page, heading/meta uniqueness, author attribution, E-E-A-T signals
+- **Internal Linking** — orphan pages, dead ends, cluster connectivity, hub pages, link depth
+- **Technical SEO** — canonical consistency, sitemap completeness, soft 404s, redirect chains, hreflang, Open Graph
+- **Structured Data** — JSON-LD validation, required fields, schema consistency
+- **Cannibalization** — title overlap, keyword collision, URL pattern conflicts
+
+## API
+
+### `auditSource(source, options?)`
+
+Audits a directory path or URL. Returns an `AuditSummary` with score, category scores, and enriched findings.
+
+### Formatters
+
+```typescript
+import { formatConsole, formatJson, formatMarkdown, formatHtml } from "@pseolint/core";
+
+const output = formatConsole(summary);
+const json = formatJson(summary);
+const md = formatMarkdown(summary);
+const html = formatHtml(summary);
+```
+
+## License
+
+MIT

package/dist/algorithms/entity-mask.d.ts

@@ -0,0 +1,3 @@
+import type { EntityMaskPattern } from "../types.js";
+export declare function maskEntities(input: string, patterns: EntityMaskPattern[]): string;
+//# sourceMappingURL=entity-mask.d.ts.map

package/dist/algorithms/entity-mask.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"entity-mask.d.ts","sourceRoot":"","sources":["../../src/algorithms/entity-mask.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAErD,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,iBAAiB,EAAE,GAAG,MAAM,CAMjF"}

package/dist/algorithms/entity-mask.js

@@ -0,0 +1,8 @@
+export function maskEntities(input, patterns) {
+    return patterns.reduce((text, entry) => {
+        const flags = entry.pattern.flags.includes("g") ? entry.pattern.flags : `${entry.pattern.flags}g`;
+        const safePattern = new RegExp(entry.pattern.source, flags);
+        return text.replace(safePattern, entry.placeholder);
+    }, input);
+}
+//# sourceMappingURL=entity-mask.js.map

package/dist/algorithms/entity-mask.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"entity-mask.js","sourceRoot":"","sources":["../../src/algorithms/entity-mask.ts"],"names":[],"mappings":"AAEA,MAAM,UAAU,YAAY,CAAC,KAAa,EAAE,QAA6B;IACvE,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;QACrC,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC;QAClG,MAAM,WAAW,GAAG,IAAI,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC5D,OAAO,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,KAAK,CAAC,WAAW,CAAC,CAAC;IACtD,CAAC,EAAE,KAAK,CAAC,CAAC;AACZ,CAAC"}

package/dist/algorithms/entity-mask.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=entity-mask.test.d.ts.map

package/dist/algorithms/entity-mask.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"entity-mask.test.d.ts","sourceRoot":"","sources":["../../src/algorithms/entity-mask.test.ts"],"names":[],"mappings":""}

package/dist/algorithms/entity-mask.test.js

@@ -0,0 +1,23 @@
+import { describe, expect, test } from "vitest";
+import { maskEntities } from "./entity-mask.js";
+describe("entity masking", () => {
+    test("replaces matched entities with placeholders", () => {
+        const input = "Form your California LLC in Los Angeles with zip 90210.";
+        const output = maskEntities(input, [
+            { placeholder: "[STATE]", pattern: /\bCalifornia\b/gi },
+            { placeholder: "[CITY]", pattern: /\bLos Angeles\b/gi },
+            { placeholder: "[ZIP]", pattern: /\b\d{5}\b/g }
+        ]);
+        expect(output).toContain("[STATE]");
+        expect(output).toContain("[CITY]");
+        expect(output).toContain("[ZIP]");
+        expect(output).not.toContain("California");
+        expect(output).not.toContain("90210");
+    });
+    test("replaces all occurrences even if regex is not global", () => {
+        const input = "California LLC filing in California has California-specific rules.";
+        const output = maskEntities(input, [{ placeholder: "[STATE]", pattern: /\bCalifornia\b/i }]);
+        expect(output).toBe("[STATE] LLC filing in [STATE] has [STATE]-specific rules.");
+    });
+});
+//# sourceMappingURL=entity-mask.test.js.map

package/dist/algorithms/entity-mask.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"entity-mask.test.js","sourceRoot":"","sources":["../../src/algorithms/entity-mask.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAChD,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAEhD,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;IAC9B,IAAI,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACvD,MAAM,KAAK,GAAG,yDAAyD,CAAC;QACxE,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,EAAE;YACjC,EAAE,WAAW,EAAE,SAAS,EAAE,OAAO,EAAE,kBAAkB,EAAE;YACvD,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,EAAE,mBAAmB,EAAE;YACvD,EAAE,WAAW,EAAE,OAAO,EAAE,OAAO,EAAE,YAAY,EAAE;SAChD,CAAC,CAAC;QAEH,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QACpC,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QACnC,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QAClC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;QAC3C,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAChE,MAAM,KAAK,GAAG,oEAAoE,CAAC;QACnF,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,EAAE,CAAC,EAAE,WAAW,EAAE,SAAS,EAAE,OAAO,EAAE,iBAAiB,EAAE,CAAC,CAAC,CAAC;QAE7F,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,2DAA2D,CAAC,CAAC;IACnF,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/algorithms/simhash.d.ts

@@ -0,0 +1,4 @@
+export declare function simHashFromText(input: string): bigint;
+export declare function hammingDistance(left: bigint, right: bigint): number;
+export declare function similarityFromDistance(distance: number): number;
+//# sourceMappingURL=simhash.d.ts.map

package/dist/algorithms/simhash.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"simhash.d.ts","sourceRoot":"","sources":["../../src/algorithms/simhash.ts"],"names":[],"mappings":"AAoCA,wBAAgB,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAwBrD;AAED,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAUnE;AAED,wBAAgB,sBAAsB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,CAE/D"}

package/dist/algorithms/simhash.js

@@ -0,0 +1,64 @@
+const SHINGLE_SIZE = 3;
+const SIMHASH_BITS = 64;
+const MAX_64 = (1n << 64n) - 1n;
+function normalizeText(input) {
+    return input
+        .toLowerCase()
+        .replace(/[^\p{L}\p{N}\s]+/gu, " ")
+        .split(/\s+/)
+        .filter(Boolean);
+}
+function buildShingles(tokens) {
+    if (tokens.length < SHINGLE_SIZE) {
+        return [tokens.join(" ")];
+    }
+    const shingles = [];
+    for (let i = 0; i <= tokens.length - SHINGLE_SIZE; i += 1) {
+        shingles.push(tokens.slice(i, i + SHINGLE_SIZE).join(" "));
+    }
+    return shingles;
+}
+function fnv1a64(value) {
+    let hash = 0xcbf29ce484222325n;
+    const prime = 0x100000001b3n;
+    for (const char of value) {
+        hash ^= BigInt(char.codePointAt(0) ?? 0);
+        hash = (hash * prime) & MAX_64;
+    }
+    return hash;
+}
+export function simHashFromText(input) {
+    const tokens = normalizeText(input);
+    if (tokens.length === 0) {
+        return 0n;
+    }
+    const shingles = buildShingles(tokens);
+    const bitWeights = Array.from({ length: SIMHASH_BITS }, () => 0);
+    for (const shingle of shingles) {
+        const hash = fnv1a64(shingle);
+        for (let bit = 0; bit < SIMHASH_BITS; bit += 1) {
+            const isSet = (hash & (1n << BigInt(bit))) !== 0n;
+            bitWeights[bit] += isSet ? 1 : -1;
+        }
+    }
+    let fingerprint = 0n;
+    for (let bit = 0; bit < SIMHASH_BITS; bit += 1) {
+        if (bitWeights[bit] > 0) {
+            fingerprint |= 1n << BigInt(bit);
+        }
+    }
+    return fingerprint;
+}
+export function hammingDistance(left, right) {
+    let diff = left ^ right;
+    let count = 0;
+    while (diff !== 0n) {
+        count += Number(diff & 1n);
+        diff >>= 1n;
+    }
+    return count;
+}
+export function similarityFromDistance(distance) {
+    return Math.max(0, (SIMHASH_BITS - distance) / SIMHASH_BITS);
+}
+//# sourceMappingURL=simhash.js.map

package/dist/algorithms/simhash.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"simhash.js","sourceRoot":"","sources":["../../src/algorithms/simhash.ts"],"names":[],"mappings":"AAAA,MAAM,YAAY,GAAG,CAAC,CAAC;AACvB,MAAM,YAAY,GAAG,EAAE,CAAC;AACxB,MAAM,MAAM,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,GAAG,EAAE,CAAC;AAEhC,SAAS,aAAa,CAAC,KAAa;IAClC,OAAO,KAAK;SACT,WAAW,EAAE;SACb,OAAO,CAAC,oBAAoB,EAAE,GAAG,CAAC;SAClC,KAAK,CAAC,KAAK,CAAC;SACZ,MAAM,CAAC,OAAO,CAAC,CAAC;AACrB,CAAC;AAED,SAAS,aAAa,CAAC,MAAgB;IACrC,IAAI,MAAM,CAAC,MAAM,GAAG,YAAY,EAAE,CAAC;QACjC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5B,CAAC;IAED,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,MAAM,GAAG,YAAY,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1D,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAC7D,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,SAAS,OAAO,CAAC,KAAa;IAC5B,IAAI,IAAI,GAAG,mBAAmB,CAAC;IAC/B,MAAM,KAAK,GAAG,cAAc,CAAC;IAE7B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACzC,IAAI,GAAG,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,MAAM,CAAC;IACjC,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,KAAa;IAC3C,MAAM,MAAM,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;IACpC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,MAAM,QAAQ,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;IACvC,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,YAAY,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IAEjE,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;QAC9B,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,YAAY,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;YAC/C,MAAM,KAAK,GAAG,CAAC,IAAI,GAAG,CAAC,EAAE,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;YAClD,UAAU,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IAED,IAAI,WAAW,GAAG,EAAE,CAAC;IACrB,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,YAAY,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QAC/C,IAAI,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACxB,WAAW,IAAI,EAAE,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC;QACnC,CAAC;IACH,CAAC;IAED,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,IAAY,EAAE,KAAa;IACzD,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,CAAC;IACxB,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,OAAO,IAAI,KAAK,EAAE,EAAE,CAAC;QACnB,KAAK,IAAI,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;QAC3B,IAAI,KAAK,EAAE,CAAC;IACd,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,UAAU,sBAAsB,CAAC,QAAgB;IACrD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,YAAY,GAAG,QAAQ,CAAC,GAAG,YAAY,CAAC,CAAC;AAC/D,CAAC"}

package/dist/algorithms/simhash.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=simhash.test.d.ts.map

package/dist/algorithms/simhash.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"simhash.test.d.ts","sourceRoot":"","sources":["../../src/algorithms/simhash.test.ts"],"names":[],"mappings":""}

package/dist/algorithms/simhash.test.js

@@ -0,0 +1,23 @@
+import { describe, expect, test } from "vitest";
+import { hammingDistance, simHashFromText, similarityFromDistance } from "./simhash.js";
+describe("simhash", () => {
+    test("returns same fingerprint for identical text", () => {
+        const a = simHashFromText("california llc filing requirements and annual fees");
+        const b = simHashFromText("california llc filing requirements and annual fees");
+        expect(a).toBe(b);
+        expect(hammingDistance(a, b)).toBe(0);
+        expect(similarityFromDistance(0)).toBe(1);
+    });
+    test("returns lower similarity for different text", () => {
+        const a = simHashFromText("california llc filing requirements and annual fees");
+        const b = simHashFromText("best sourdough starter hydration and oven spring tips");
+        const distance = hammingDistance(a, b);
+        expect(distance).toBeGreaterThan(10);
+        expect(similarityFromDistance(distance)).toBeLessThan(0.85);
+    });
+    test("returns neutral fingerprint for empty input", () => {
+        const fingerprint = simHashFromText("   ");
+        expect(fingerprint).toBe(0n);
+    });
+});
+//# sourceMappingURL=simhash.test.js.map

package/dist/algorithms/simhash.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"simhash.test.js","sourceRoot":"","sources":["../../src/algorithms/simhash.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAChD,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAExF,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE;IACvB,IAAI,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACvD,MAAM,CAAC,GAAG,eAAe,CAAC,oDAAoD,CAAC,CAAC;QAChF,MAAM,CAAC,GAAG,eAAe,CAAC,oDAAoD,CAAC,CAAC;QAEhF,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACvD,MAAM,CAAC,GAAG,eAAe,CAAC,oDAAoD,CAAC,CAAC;QAChF,MAAM,CAAC,GAAG,eAAe,CAAC,uDAAuD,CAAC,CAAC;QAEnF,MAAM,QAAQ,GAAG,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACvC,MAAM,CAAC,QAAQ,CAAC,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;QACrC,MAAM,CAAC,sBAAsB,CAAC,QAAQ,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;IAC9D,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACvD,MAAM,WAAW,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QAC3C,MAAM,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/algorithms/tf-idf.d.ts

@@ -0,0 +1,8 @@
+export interface TfIdfCorpus {
+    docSets: Set<string>[];
+    docCount: number;
+}
+export declare function buildCorpus(allTexts: string[]): TfIdfCorpus;
+export declare function extractKeywords(text: string, allTexts: string[], topN: number): string[];
+export declare function extractKeywords(text: string, corpus: TfIdfCorpus, topN: number): string[];
+//# sourceMappingURL=tf-idf.d.ts.map

package/dist/algorithms/tf-idf.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tf-idf.d.ts","sourceRoot":"","sources":["../../src/algorithms/tf-idf.ts"],"names":[],"mappings":"AAqBA,MAAM,WAAW,WAAW;IAC1B,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;IACvB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,wBAAgB,WAAW,CAAC,QAAQ,EAAE,MAAM,EAAE,GAAG,WAAW,CAK3D;AAeD,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC;AAC1F,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC"}

package/dist/algorithms/tf-idf.js

@@ -0,0 +1,55 @@
+function tokenize(text) {
+    return text
+        .toLowerCase()
+        .replace(/[^\p{L}\p{N}\s]+/gu, " ")
+        .split(/\s+/)
+        .filter(Boolean);
+}
+function termFrequency(tokens) {
+    const counts = new Map();
+    for (const token of tokens) {
+        counts.set(token, (counts.get(token) ?? 0) + 1);
+    }
+    const total = tokens.length;
+    const tf = new Map();
+    for (const [term, count] of counts) {
+        tf.set(term, count / total);
+    }
+    return tf;
+}
+export function buildCorpus(allTexts) {
+    return {
+        docSets: allTexts.map((t) => new Set(tokenize(t))),
+        docCount: allTexts.length
+    };
+}
+function inverseDocumentFrequency(term, corpus) {
+    let docsWithTerm = 0;
+    for (const docSet of corpus.docSets) {
+        if (docSet.has(term)) {
+            docsWithTerm += 1;
+        }
+    }
+    if (docsWithTerm === 0) {
+        return 0;
+    }
+    return Math.log(corpus.docCount / docsWithTerm);
+}
+export function extractKeywords(text, source, topN) {
+    const corpus = Array.isArray(source) ? buildCorpus(source) : source;
+    const tokens = tokenize(text);
+    if (tokens.length === 0) {
+        return [];
+    }
+    const tf = termFrequency(tokens);
+    const scores = new Map();
+    for (const term of tf.keys()) {
+        const idf = inverseDocumentFrequency(term, corpus);
+        scores.set(term, (tf.get(term) ?? 0) * idf);
+    }
+    return Array.from(scores.entries())
+        .sort((a, b) => b[1] - a[1])
+        .slice(0, topN)
+        .map(([term]) => term);
+}
+//# sourceMappingURL=tf-idf.js.map

package/dist/algorithms/tf-idf.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tf-idf.js","sourceRoot":"","sources":["../../src/algorithms/tf-idf.ts"],"names":[],"mappings":"AAAA,SAAS,QAAQ,CAAC,IAAY;IAC5B,OAAO,IAAI;SACR,WAAW,EAAE;SACb,OAAO,CAAC,oBAAoB,EAAE,GAAG,CAAC;SAClC,KAAK,CAAC,KAAK,CAAC;SACZ,MAAM,CAAC,OAAO,CAAC,CAAC;AACrB,CAAC;AAED,SAAS,aAAa,CAAC,MAAgB;IACrC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAClD,CAAC;IACD,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC;IAC5B,MAAM,EAAE,GAAG,IAAI,GAAG,EAAkB,CAAC;IACrC,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;QACnC,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,GAAG,KAAK,CAAC,CAAC;IAC9B,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAOD,MAAM,UAAU,WAAW,CAAC,QAAkB;IAC5C,OAAO;QACL,OAAO,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,QAAQ,EAAE,QAAQ,CAAC,MAAM;KAC1B,CAAC;AACJ,CAAC;AAED,SAAS,wBAAwB,CAAC,IAAY,EAAE,MAAmB;IACjE,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;QACpC,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACrB,YAAY,IAAI,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IACD,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,GAAG,YAAY,CAAC,CAAC;AAClD,CAAC;AAID,MAAM,UAAU,eAAe,CAAC,IAAY,EAAE,MAA8B,EAAE,IAAY;IACxF,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IACpE,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC9B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,EAAE,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;IACjC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEzC,KAAK,MAAM,IAAI,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;QAC7B,MAAM,GAAG,GAAG,wBAAwB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACnD,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;IAC9C,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;SAChC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SAC3B,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC;SACd,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;AAC3B,CAAC"}

package/dist/auditor.d.ts

@@ -0,0 +1,3 @@
+import type { AuditOptions, AuditSummary } from "./types.js";
+export declare function auditSource(source: string, options?: AuditOptions): Promise<AuditSummary>;
+//# sourceMappingURL=auditor.d.ts.map

package/dist/auditor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"auditor.d.ts","sourceRoot":"","sources":["../src/auditor.ts"],"names":[],"mappings":"AAwCA,OAAO,KAAK,EAAE,YAAY,EAAE,YAAY,EAA4F,MAAM,YAAY,CAAC;AAurBvJ,wBAAsB,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,YAAY,GAAG,OAAO,CAAC,YAAY,CAAC,CA6I/F"}