@lacspace/screen 1.0.0

package/LICENSE

@@ -0,0 +1,51 @@
+Lacspace Free Licence
+Version 1.0, August 2026
+
+Copyright (c) 2026 Lacspace
+
+PREAMBLE
+
+This software is published by Lacspace under the Lacspace Free Licence — a free,
+permissive licence that lets you use this software for any purpose, including in
+commercial products and services, at no cost. It grants the same freedoms as
+common permissive open-source licences; the only condition is that this notice
+travels with the software. The canonical, always-current text of this licence is
+maintained at https://lacspace.com/licenses/lacspace-free-1.0
+
+GRANT OF RIGHTS
+
+Permission is hereby granted, free of charge, to any person or organisation
+obtaining a copy of this software and its associated documentation and data 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 conditions below. These rights are
+granted for any purpose, personal or commercial, and are perpetual, worldwide,
+non-exclusive, and royalty-free.
+
+CONDITIONS
+
+The above copyright notice, this permission notice, and the name of this licence
+("Lacspace Free Licence") shall be included in all copies or substantial portions
+of the Software.
+
+TRADEMARKS
+
+This licence does not grant permission to use the trade names, trademarks, service
+marks, logos, or product names of Lacspace, except as required to reproduce the
+notice above or to describe the origin of the Software in a truthful manner.
+
+DISCLAIMER OF WARRANTY AND LIMITATION OF LIABILITY
+
+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.
+
+---
+
+The Lacspace Free Licence is a source-available, permissive licence and is not (as
+of this version) an OSI-approved licence. In substance it grants the same freedoms
+as the MIT Licence. Learn more at https://lacspace.com/licenses

package/README.md

@@ -0,0 +1,81 @@
+# @lacspace/screen
+
+**Don't pay a model to read what a word list can judge.** A cheap, deterministic lexical screener that scores text against your own weighted term lexicons — multi-language, with negation and proximity windows and an optional named-entity gazetteer — and returns a **clear / review / block** decision. Send only the ambiguous middle to an expensive LLM; let obviously-clean and obviously-flagged text skip it entirely.
+
+Zero dependencies, isomorphic, and every decision comes with an auditable "held because" trail.
+
+```bash
+npm i @lacspace/screen
+```
+
+## Use
+
+```ts
+import { createScreen } from "@lacspace/screen";
+
+const screen = createScreen({
+  dimensions: {
+    death:    { terms: ["died", "killed", "मृत्यु"] },
+    court:    { terms: ["court", "verdict", "अदालत"] },
+    minor:    { terms: ["child", "minor", "बालबालिका"], forceReview: true },
+    election: { terms: ["election", "vote", "निर्वाचन"], forceReview: true },
+    hate:     { terms: ["<your slur list>"], weight: 3, forceBlock: true },
+  },
+  negations: ["no", "not", "denied", "-न", "-नन्"],  // "-x" = suffix, for Nepali verb negation
+  gazetteer: ["Sher Bahadur Deuba", "काठमाडौं"],
+  thresholds: { clear: 0, review: 1, block: 5 },
+});
+
+const r = screen(storyText);
+r.decision;  // "clear" | "review" | "block"
+r.scores;    // { death: 1, court: 2, ... }
+r.hits;      // [{ dim, term, pos, weight, negated }]
+r.reasons;   // ["total score 3 ≥ review 1", "minor: force-review hit"]
+
+if (r.decision === "review") await askTheModel(storyText);  // only the uncertain ones
+```
+
+## Why
+
+Running an LLM sensitivity/moderation pass on every candidate item is where token budgets die — most items are plainly fine or plainly blocked. `screen` triages first: in real newsroom use only the ambiguous fraction needs the model, cutting those calls by the large majority. Because it's deterministic and returns its reasons, the result is safe to log and defend.
+
+## Features
+
+- **Weighted dimensions** — each dimension has its own term list and `weight`; the total score drives the decision.
+- **`forceReview` / `forceBlock`** — a single hit on a sensitive dimension (minors, elections) can force at least `review`, or `block` outright, regardless of score.
+- **Negation** — a nearby negator marks a hit `negated` and drops it from the score. Whole words, `prefix*` patterns, and `-suffix` patterns (for languages where negation is a verb suffix, e.g. Nepali `-न`, `-नन्`).
+- **Proximity window** — negation only counts within `contextWindow` tokens of the hit.
+- **Gazetteer** — a named-person/place hit adds a boost, so "X died" scores higher than "someone died".
+- **Multi-language** — Latin terms match whole words case-insensitively; Devanagari and other non-Latin terms match as substrings, positioned to the nearest token.
+- **Auditable** — `hits` and `reasons` explain every decision.
+
+## API
+
+```ts
+createScreen(config: ScreenConfig): Screen           // reusable, compiles matchers once
+screenText(text: string, config: ScreenConfig): ScreenResult  // one-shot
+
+interface ScreenConfig {
+  dimensions: Record<string, { terms: string[]; weight?: number; forceReview?: boolean; forceBlock?: boolean }>;
+  negations?: string[];         // "word" | "prefix*" | "-suffix"
+  contextWindow?: number;       // default 4
+  gazetteer?: string[];
+  gazetteerBoost?: number;      // default 0.5
+  thresholds?: { clear?: number; review?: number; block?: number };
+}
+
+interface ScreenResult {
+  decision: "clear" | "review" | "block";
+  score: number;
+  scores: Record<string, number>;
+  hits: { dim: string; term: string; pos: number; weight: number; negated: boolean }[];
+  entity: boolean;
+  reasons: string[];
+}
+```
+
+You bring the lexicons — `screen` never ships opinions about what is sensitive, only the engine that applies yours.
+
+## Licence
+
+[Lacspace Free Licence v1.0](https://developer.lacspace.com/licenses/lacspace-free-1.0) — free for personal and commercial use.

package/dist/index.cjs

@@ -0,0 +1,164 @@
+'use strict';
+
+// src/index.ts
+var WORD_RE = /[\p{L}\p{N}][\p{L}\p{N}‌‍]*/gu;
+function tokenize(text) {
+  const out = [];
+  let m;
+  WORD_RE.lastIndex = 0;
+  while ((m = WORD_RE.exec(text)) !== null) out.push({ raw: m[0], norm: m[0].toLowerCase(), start: m.index });
+  return out;
+}
+function termWords(term) {
+  const out = [];
+  let m;
+  WORD_RE.lastIndex = 0;
+  while ((m = WORD_RE.exec(term)) !== null) out.push(m[0].toLowerCase());
+  return out;
+}
+function isLatin(s) {
+  return !/[^\u0000-ɏ]/.test(s);
+}
+function parseNegations(neg) {
+  return neg.map((n) => {
+    if (n.startsWith("-")) return { kind: "suffix", value: n.slice(1).toLowerCase() };
+    if (n.endsWith("*")) return { kind: "prefix", value: n.slice(0, -1).toLowerCase() };
+    return { kind: "word", value: n.toLowerCase() };
+  });
+}
+function tokenMatchesNeg(tok, rules) {
+  for (const r of rules) {
+    if (r.kind === "word" && tok.norm === r.value) return true;
+    if (r.kind === "prefix" && tok.norm.startsWith(r.value)) return true;
+    if (r.kind === "suffix" && tok.norm.endsWith(r.value) && tok.norm.length > r.value.length) return true;
+  }
+  return false;
+}
+function createScreen(config) {
+  const window = config.contextWindow ?? 4;
+  const negRules = parseNegations(config.negations ?? []);
+  const gaz = (config.gazetteer ?? []).filter(Boolean);
+  const gazLatin = gaz.filter(isLatin).map((g) => g.toLowerCase());
+  const gazOther = gaz.filter((g) => !isLatin(g));
+  const gazBoost = config.gazetteerBoost ?? 0.5;
+  const th = { review: 1, block: Infinity, ...config.thresholds ?? {} };
+  const dims = Object.entries(config.dimensions).map(([name, spec]) => ({
+    name,
+    weight: spec.weight ?? 1,
+    forceReview: spec.forceReview ?? false,
+    forceBlock: spec.forceBlock ?? false,
+    latin: spec.terms.filter(isLatin).map((t) => ({ term: t, words: termWords(t) })),
+    other: spec.terms.filter((t) => !isLatin(t))
+  }));
+  const screen = ((text) => {
+    const toks = tokenize(text);
+    const lower = text.toLowerCase();
+    const hits = [];
+    const scores = {};
+    for (const d of dims) scores[d.name] = 0;
+    const entity = gazLatin.some((g) => new RegExp(`(?:^|[^a-z0-9])${escapeRe(g)}(?:[^a-z0-9]|$)`).test(lower)) || gazOther.some((g) => text.includes(g));
+    const negatedNear = (pos) => {
+      const from = Math.max(0, pos - window);
+      const to = Math.min(toks.length - 1, pos + window);
+      for (let i = from; i <= to; i++) if (i !== pos && tokenMatchesNeg(toks[i], negRules)) return true;
+      return false;
+    };
+    const activeByDim = /* @__PURE__ */ new Map();
+    for (const d of dims) {
+      let anyActive = false;
+      for (const { term, words } of d.latin) {
+        if (words.length === 0) continue;
+        for (let i = 0; i + words.length <= toks.length; i++) {
+          let ok = true;
+          for (let j = 0; j < words.length; j++) if (toks[i + j].norm !== words[j]) {
+            ok = false;
+            break;
+          }
+          if (!ok) continue;
+          const neg = negatedNear(i) || negatedNear(i + words.length - 1);
+          hits.push({ dim: d.name, term, pos: i, weight: d.weight, negated: neg });
+          if (!neg) {
+            scores[d.name] += d.weight;
+            anyActive = true;
+          }
+        }
+      }
+      for (const term of d.other) {
+        let idx = text.indexOf(term);
+        while (idx !== -1) {
+          const pos = nearestToken(toks, idx);
+          const neg = pos >= 0 ? negatedNear(pos) : false;
+          hits.push({ dim: d.name, term, pos, weight: d.weight, negated: neg });
+          if (!neg) {
+            scores[d.name] += d.weight;
+            anyActive = true;
+          }
+          idx = text.indexOf(term, idx + term.length);
+        }
+      }
+      if (anyActive && entity) scores[d.name] += gazBoost;
+      activeByDim.set(d.name, anyActive);
+    }
+    let total = 0;
+    for (const d of dims) total += scores[d.name];
+    const reasons = [];
+    let decision = "clear";
+    for (const d of dims) {
+      if (d.forceBlock && activeByDim.get(d.name)) {
+        decision = "block";
+        reasons.push(`${d.name}: force-block hit`);
+      }
+    }
+    if (decision !== "block") {
+      if (total >= th.block) {
+        decision = "block";
+        reasons.push(`total score ${round(total)} \u2265 block ${th.block}`);
+      } else if (total >= th.review) {
+        decision = "review";
+        reasons.push(`total score ${round(total)} \u2265 review ${th.review}`);
+      }
+      for (const d of dims) {
+        if (d.forceReview && activeByDim.get(d.name) && decision === "clear") {
+          decision = "review";
+          reasons.push(`${d.name}: force-review hit`);
+        }
+      }
+    }
+    if (decision === "clear") reasons.push("below review threshold");
+    hits.sort((a, b) => a.pos - b.pos || a.dim.localeCompare(b.dim) || a.term.localeCompare(b.term));
+    return { decision, score: round(total), scores: roundAll(scores), hits, entity, reasons };
+  });
+  Object.defineProperty(screen, "config", { value: config, enumerable: true });
+  return screen;
+}
+function screenText(text, config) {
+  return createScreen(config)(text);
+}
+function nearestToken(toks, charPos) {
+  let best = -1;
+  let bestD = Infinity;
+  for (let i = 0; i < toks.length; i++) {
+    const d = Math.abs(toks[i].start - charPos);
+    if (d < bestD) {
+      bestD = d;
+      best = i;
+    }
+  }
+  return best;
+}
+function escapeRe(s) {
+  return s.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
+}
+function round(n) {
+  return Math.round(n * 1e3) / 1e3;
+}
+function roundAll(o) {
+  const out = {};
+  for (const k of Object.keys(o)) out[k] = round(o[k]);
+  return out;
+}
+
+exports.createScreen = createScreen;
+exports.screenText = screenText;
+//# sourceMappingURL=index.cjs.map
+//# sourceMappingURL=index.cjs.map

package/dist/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/index.ts"],"names":[],"mappings":";;;AAoEA,IAAM,OAAA,GAAU,+BAAA;AAEhB,SAAS,SAAS,IAAA,EAAuB;AACvC,EAAA,MAAM,MAAe,EAAC;AACtB,EAAA,IAAI,CAAA;AACJ,EAAA,OAAA,CAAQ,SAAA,GAAY,CAAA;AACpB,EAAA,OAAA,CAAQ,CAAA,GAAI,QAAQ,IAAA,CAAK,IAAI,OAAO,IAAA,EAAM,GAAA,CAAI,IAAA,CAAK,EAAE,GAAA,EAAK,CAAA,CAAE,CAAC,CAAA,EAAG,IAAA,EAAM,EAAE,CAAC,CAAA,CAAE,aAAY,EAAG,KAAA,EAAO,CAAA,CAAE,KAAA,EAAO,CAAA;AAC1G,EAAA,OAAO,GAAA;AACT;AAEA,SAAS,UAAU,IAAA,EAAwB;AACzC,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,IAAI,CAAA;AACJ,EAAA,OAAA,CAAQ,SAAA,GAAY,CAAA;AACpB,EAAA,OAAA,CAAQ,CAAA,GAAI,OAAA,CAAQ,IAAA,CAAK,IAAI,CAAA,MAAO,IAAA,EAAM,GAAA,CAAI,IAAA,CAAK,CAAA,CAAE,CAAC,CAAA,CAAE,WAAA,EAAa,CAAA;AACrE,EAAA,OAAO,GAAA;AACT;AAEA,SAAS,QAAQ,CAAA,EAAoB;AACnC,EAAA,OAAO,CAAC,aAAA,CAAc,IAAA,CAAK,CAAC,CAAA;AAC9B;AAOA,SAAS,eAAe,GAAA,EAA0B;AAChD,EAAA,OAAO,GAAA,CAAI,GAAA,CAAI,CAAC,CAAA,KAAM;AACpB,IAAA,IAAI,CAAA,CAAE,UAAA,CAAW,GAAG,CAAA,SAAU,EAAE,IAAA,EAAM,QAAA,EAAmB,KAAA,EAAO,CAAA,CAAE,KAAA,CAAM,CAAC,CAAA,CAAE,aAAY,EAAE;AACzF,IAAA,IAAI,CAAA,CAAE,QAAA,CAAS,GAAG,CAAA,SAAU,EAAE,IAAA,EAAM,QAAA,EAAmB,KAAA,EAAO,EAAE,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA,CAAE,aAAY,EAAE;AAC3F,IAAA,OAAO,EAAE,IAAA,EAAM,MAAA,EAAiB,KAAA,EAAO,CAAA,CAAE,aAAY,EAAE;AAAA,EACzD,CAAC,CAAA;AACH;AAEA,SAAS,eAAA,CAAgB,KAAY,KAAA,EAA2B;AAC9D,EAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,IAAA,IAAI,EAAE,IAAA,KAAS,MAAA,IAAU,IAAI,IAAA,KAAS,CAAA,CAAE,OAAO,OAAO,IAAA;AACtD,IAAA,IAAI,CAAA,CAAE,SAAS,QAAA,IAAY,GAAA,CAAI,KAAK,UAAA,CAAW,CAAA,CAAE,KAAK,CAAA,EAAG,OAAO,IAAA;AAChE,IAAA,IAAI,CAAA,CAAE,IAAA,KAAS,QAAA,IAAY,GAAA,CAAI,KAAK,QAAA,CAAS,CAAA,CAAE,KAAK,CAAA,IAAK,IAAI,IAAA,CAAK,MAAA,GAAS,CAAA,CAAE,KAAA,CAAM,QAAQ,OAAO,IAAA;AAAA,EACpG;AACA,EAAA,OAAO,KAAA;AACT;AAQO,SAAS,aAAa,MAAA,EAA8B;AACzD,EAAA,MAAM,MAAA,GAAS,OAAO,aAAA,IAAiB,CAAA;AACvC,EAAA,MAAM,QAAA,GAAW,cAAA,CAAe,MAAA,CAAO,SAAA,IAAa,EAAE,CAAA;AACtD,EAAA,MAAM,OAAO,MAAA,CAAO,SAAA,IAAa,EAAC,EAAG,OAAO,OAAO,CAAA;AACnD,EAAA,MAAM,QAAA,GAAW,GAAA,CAAI,MAAA,CAAO,OAAO,CAAA,CAAE,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,WAAA,EAAa,CAAA;AAC/D,EAAA,MAAM,QAAA,GAAW,IAAI,MAAA,CAAO,CAAC,MAAM,CAAC,OAAA,CAAQ,CAAC,CAAC,CAAA;AAC9C,EAAA,MAAM,QAAA,GAAW,OAAO,cAAA,IAAkB,GAAA;AAC1C,EAAA,MAAM,EAAA,GAAK,EAAY,MAAA,EAAQ,CAAA,EAAG,KAAA,EAAO,QAAA,EAAU,GAAI,MAAA,CAAO,UAAA,IAAc,EAAC,EAAG;AAGhF,EAAA,MAAM,IAAA,GAAO,MAAA,CAAO,OAAA,CAAQ,MAAA,CAAO,UAAU,CAAA,CAAE,GAAA,CAAI,CAAC,CAAC,IAAA,EAAM,IAAI,CAAA,MAAO;AAAA,IACpE,IAAA;AAAA,IACA,MAAA,EAAQ,KAAK,MAAA,IAAU,CAAA;AAAA,IACvB,WAAA,EAAa,KAAK,WAAA,IAAe,KAAA;AAAA,IACjC,UAAA,EAAY,KAAK,UAAA,IAAc,KAAA;AAAA,IAC/B,OAAO,IAAA,CAAK,KAAA,CAAM,MAAA,CAAO,OAAO,EAAE,GAAA,CAAI,CAAC,CAAA,MAAO,EAAE,MAAM,CAAA,EAAG,KAAA,EAAO,SAAA,CAAU,CAAC,GAAE,CAAE,CAAA;AAAA,IAC/E,KAAA,EAAO,KAAK,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,KAAM,CAAC,OAAA,CAAQ,CAAC,CAAC;AAAA,GAC7C,CAAE,CAAA;AAEF,EAAA,MAAM,MAAA,IAAU,CAAC,IAAA,KAA+B;AAC9C,IAAA,MAAM,IAAA,GAAO,SAAS,IAAI,CAAA;AAC1B,IAAA,MAAM,KAAA,GAAQ,KAAK,WAAA,EAAY;AAC/B,IAAA,MAAM,OAAoB,EAAC;AAC3B,IAAA,MAAM,SAAiC,EAAC;AACxC,IAAA,KAAA,MAAW,CAAA,IAAK,IAAA,EAAM,MAAA,CAAO,CAAA,CAAE,IAAI,CAAA,GAAI,CAAA;AAEvC,IAAA,MAAM,MAAA,GACJ,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,IAAI,MAAA,CAAO,CAAA,eAAA,EAAkB,QAAA,CAAS,CAAC,CAAC,CAAA,eAAA,CAAiB,EAAE,IAAA,CAAK,KAAK,CAAC,CAAA,IAC3F,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,IAAA,CAAK,QAAA,CAAS,CAAC,CAAC,CAAA;AAEvC,IAAA,MAAM,WAAA,GAAc,CAAC,GAAA,KAAyB;AAC5C,MAAA,MAAM,IAAA,GAAO,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,MAAM,MAAM,CAAA;AACrC,MAAA,MAAM,KAAK,IAAA,CAAK,GAAA,CAAI,KAAK,MAAA,GAAS,CAAA,EAAG,MAAM,MAAM,CAAA;AACjD,MAAA,KAAA,IAAS,CAAA,GAAI,IAAA,EAAM,CAAA,IAAK,EAAA,EAAI,KAAK,IAAI,CAAA,KAAM,GAAA,IAAO,eAAA,CAAgB,IAAA,CAAK,CAAC,CAAA,EAAI,QAAQ,GAAG,OAAO,IAAA;AAC9F,MAAA,OAAO,KAAA;AAAA,IACT,CAAA;AAEA,IAAA,MAAM,WAAA,uBAAkB,GAAA,EAAqB;AAC7C,IAAA,KAAA,MAAW,KAAK,IAAA,EAAM;AACpB,MAAA,IAAI,SAAA,GAAY,KAAA;AAEhB,MAAA,KAAA,MAAW,EAAE,IAAA,EAAM,KAAA,EAAM,IAAK,EAAE,KAAA,EAAO;AACrC,QAAA,IAAI,KAAA,CAAM,WAAW,CAAA,EAAG;AACxB,QAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,MAAM,MAAA,IAAU,IAAA,CAAK,QAAQ,CAAA,EAAA,EAAK;AACpD,UAAA,IAAI,EAAA,GAAK,IAAA;AACT,UAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK,IAAI,IAAA,CAAK,CAAA,GAAI,CAAC,CAAA,CAAG,IAAA,KAAS,KAAA,CAAM,CAAC,CAAA,EAAG;AAAE,YAAA,EAAA,GAAK,KAAA;AAAO,YAAA;AAAA,UAAO;AAChG,UAAA,IAAI,CAAC,EAAA,EAAI;AACT,UAAA,MAAM,GAAA,GAAM,YAAY,CAAC,CAAA,IAAK,YAAY,CAAA,GAAI,KAAA,CAAM,SAAS,CAAC,CAAA;AAC9D,UAAA,IAAA,CAAK,IAAA,CAAK,EAAE,GAAA,EAAK,CAAA,CAAE,IAAA,EAAM,IAAA,EAAM,GAAA,EAAK,CAAA,EAAG,MAAA,EAAQ,CAAA,CAAE,MAAA,EAAQ,OAAA,EAAS,KAAK,CAAA;AACvE,UAAA,IAAI,CAAC,GAAA,EAAK;AACR,YAAA,MAAA,CAAO,CAAA,CAAE,IAAI,CAAA,IAAM,CAAA,CAAE,MAAA;AACrB,YAAA,SAAA,GAAY,IAAA;AAAA,UACd;AAAA,QACF;AAAA,MACF;AAEA,MAAA,KAAA,MAAW,IAAA,IAAQ,EAAE,KAAA,EAAO;AAC1B,QAAA,IAAI,GAAA,GAAM,IAAA,CAAK,OAAA,CAAQ,IAAI,CAAA;AAC3B,QAAA,OAAO,QAAQ,EAAA,EAAI;AACjB,UAAA,MAAM,GAAA,GAAM,YAAA,CAAa,IAAA,EAAM,GAAG,CAAA;AAClC,UAAA,MAAM,GAAA,GAAM,GAAA,IAAO,CAAA,GAAI,WAAA,CAAY,GAAG,CAAA,GAAI,KAAA;AAC1C,UAAA,IAAA,CAAK,IAAA,CAAK,EAAE,GAAA,EAAK,CAAA,CAAE,IAAA,EAAM,IAAA,EAAM,GAAA,EAAK,MAAA,EAAQ,CAAA,CAAE,MAAA,EAAQ,OAAA,EAAS,GAAA,EAAK,CAAA;AACpE,UAAA,IAAI,CAAC,GAAA,EAAK;AACR,YAAA,MAAA,CAAO,CAAA,CAAE,IAAI,CAAA,IAAM,CAAA,CAAE,MAAA;AACrB,YAAA,SAAA,GAAY,IAAA;AAAA,UACd;AACA,UAAA,GAAA,GAAM,IAAA,CAAK,OAAA,CAAQ,IAAA,EAAM,GAAA,GAAM,KAAK,MAAM,CAAA;AAAA,QAC5C;AAAA,MACF;AACA,MAAA,IAAI,SAAA,IAAa,MAAA,EAAQ,MAAA,CAAO,CAAA,CAAE,IAAI,CAAA,IAAM,QAAA;AAC5C,MAAA,WAAA,CAAY,GAAA,CAAI,CAAA,CAAE,IAAA,EAAM,SAAS,CAAA;AAAA,IACnC;AAEA,IAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,IAAA,KAAA,MAAW,CAAA,IAAK,IAAA,EAAM,KAAA,IAAS,MAAA,CAAO,EAAE,IAAI,CAAA;AAG5C,IAAA,MAAM,UAAoB,EAAC;AAC3B,IAAA,IAAI,QAAA,GAAqB,OAAA;AACzB,IAAA,KAAA,MAAW,KAAK,IAAA,EAAM;AACpB,MAAA,IAAI,EAAE,UAAA,IAAc,WAAA,CAAY,GAAA,CAAI,CAAA,CAAE,IAAI,CAAA,EAAG;AAC3C,QAAA,QAAA,GAAW,OAAA;AACX,QAAA,OAAA,CAAQ,IAAA,CAAK,CAAA,EAAG,CAAA,CAAE,IAAI,CAAA,iBAAA,CAAmB,CAAA;AAAA,MAC3C;AAAA,IACF;AACA,IAAA,IAAI,aAAa,OAAA,EAAS;AACxB,MAAA,IAAI,KAAA,IAAS,GAAG,KAAA,EAAO;AACrB,QAAA,QAAA,GAAW,OAAA;AACX,QAAA,OAAA,CAAQ,IAAA,CAAK,eAAe,KAAA,CAAM,KAAK,CAAC,CAAA,cAAA,EAAY,EAAA,CAAG,KAAK,CAAA,CAAE,CAAA;AAAA,MAChE,CAAA,MAAA,IAAW,KAAA,IAAS,EAAA,CAAG,MAAA,EAAQ;AAC7B,QAAA,QAAA,GAAW,QAAA;AACX,QAAA,OAAA,CAAQ,IAAA,CAAK,eAAe,KAAA,CAAM,KAAK,CAAC,CAAA,eAAA,EAAa,EAAA,CAAG,MAAM,CAAA,CAAE,CAAA;AAAA,MAClE;AACA,MAAA,KAAA,MAAW,KAAK,IAAA,EAAM;AACpB,QAAA,IAAI,CAAA,CAAE,eAAe,WAAA,CAAY,GAAA,CAAI,EAAE,IAAI,CAAA,IAAK,aAAa,OAAA,EAAS;AACpE,UAAA,QAAA,GAAW,QAAA;AACX,UAAA,OAAA,CAAQ,IAAA,CAAK,CAAA,EAAG,CAAA,CAAE,IAAI,CAAA,kBAAA,CAAoB,CAAA;AAAA,QAC5C;AAAA,MACF;AAAA,IACF;AACA,IAAA,IAAI,QAAA,KAAa,OAAA,EAAS,OAAA,CAAQ,IAAA,CAAK,wBAAwB,CAAA;AAG/D,IAAA,IAAA,CAAK,KAAK,CAAC,CAAA,EAAG,MAAM,CAAA,CAAE,GAAA,GAAM,EAAE,GAAA,IAAO,CAAA,CAAE,IAAI,aAAA,CAAc,CAAA,CAAE,GAAG,CAAA,IAAK,CAAA,CAAE,KAAK,aAAA,CAAc,CAAA,CAAE,IAAI,CAAC,CAAA;AAE/F,IAAA,OAAO,EAAE,QAAA,EAAU,KAAA,EAAO,KAAA,CAAM,KAAK,CAAA,EAAG,MAAA,EAAQ,QAAA,CAAS,MAAM,CAAA,EAAG,IAAA,EAAM,MAAA,EAAQ,OAAA,EAAQ;AAAA,EAC1F,CAAA,CAAA;AAEA,EAAA,MAAA,CAAO,cAAA,CAAe,QAAQ,QAAA,EAAU,EAAE,OAAO,MAAA,EAAQ,UAAA,EAAY,MAAM,CAAA;AAC3E,EAAA,OAAO,MAAA;AACT;AAGO,SAAS,UAAA,CAAW,MAAc,MAAA,EAAoC;AAC3E,EAAA,OAAO,YAAA,CAAa,MAAM,CAAA,CAAE,IAAI,CAAA;AAClC;AAEA,SAAS,YAAA,CAAa,MAAe,OAAA,EAAyB;AAE5D,EAAA,IAAI,IAAA,GAAO,EAAA;AACX,EAAA,IAAI,KAAA,GAAQ,QAAA;AACZ,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,IAAA,CAAK,QAAQ,CAAA,EAAA,EAAK;AACpC,IAAA,MAAM,IAAI,IAAA,CAAK,GAAA,CAAI,KAAK,CAAC,CAAA,CAAG,QAAQ,OAAO,CAAA;AAC3C,IAAA,IAAI,IAAI,KAAA,EAAO;AACb,MAAA,KAAA,GAAQ,CAAA;AACR,MAAA,IAAA,GAAO,CAAA;AAAA,IACT;AAAA,EACF;AACA,EAAA,OAAO,IAAA;AACT;AAEA,SAAS,SAAS,CAAA,EAAmB;AACnC,EAAA,OAAO,CAAA,CAAE,OAAA,CAAQ,qBAAA,EAAuB,MAAM,CAAA;AAChD;AACA,SAAS,MAAM,CAAA,EAAmB;AAChC,EAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,GAAI,GAAI,CAAA,GAAI,GAAA;AAChC;AACA,SAAS,SAAS,CAAA,EAAmD;AACnE,EAAA,MAAM,MAA8B,EAAC;AACrC,EAAA,KAAA,MAAW,CAAA,IAAK,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,EAAG,GAAA,CAAI,CAAC,CAAA,GAAI,KAAA,CAAM,CAAA,CAAE,CAAC,CAAE,CAAA;AACpD,EAAA,OAAO,GAAA;AACT","file":"index.cjs","sourcesContent":["/**\n * @lacspace/screen — a cheap lexical pre-screen that decides whether text even\n * needs an expensive model. You supply weighted term lexicons per dimension\n * (multi-language), optional negation patterns and a named-entity gazetteer;\n * `screen(text)` returns per-dimension scores, the matched terms, and a\n * clear / review / block decision. Deterministic and zero-dependency.\n */\n\nexport interface DimensionSpec {\n  /** Terms/phrases that signal this dimension. Latin matched case-insensitively on word boundaries; non-Latin (e.g. Devanagari) matched as substrings. */\n  terms: string[];\n  /** Score added per matched term. Default 1. */\n  weight?: number;\n  /** If any single hit on this dimension appears, the decision is at least \"review\" (never \"clear\"). Good for minor / election-sensitive. */\n  forceReview?: boolean;\n  /** If any single (non-negated) hit appears, the decision is \"block\". Use sparingly. */\n  forceBlock?: boolean;\n}\n\nexport interface ScreenConfig {\n  dimensions: Record<string, DimensionSpec>;\n  /**\n   * Words/patterns that flip a nearby hit to \"negated\" (not counted toward the score).\n   * Latin words match whole; a pattern ending in \"*\" is a prefix, and a value beginning\n   * with \"-\" is a SUFFIX pattern (for languages like Nepali where negation is a verb\n   * suffix, e.g. \"-न\", \"-नन्\").\n   */\n  negations?: string[];\n  /** How many tokens on each side of a hit are scanned for a negation. Default 4. */\n  contextWindow?: number;\n  /** Named entities (people/places) — a hit near one adds `gazetteerBoost` to every active dimension. */\n  gazetteer?: string[];\n  /** Score added to a dimension when the text also contains a gazetteer entity. Default 0.5. */\n  gazetteerBoost?: number;\n  /** Total-score thresholds. `clear`: at or below → clear. `review`: at or above (and below block) → review. */\n  thresholds?: { clear?: number; review?: number; block?: number };\n}\n\nexport type Decision = \"clear\" | \"review\" | \"block\";\n\nexport interface ScreenHit {\n  dim: string;\n  term: string;\n  /** Token position of the hit. */\n  pos: number;\n  weight: number;\n  negated: boolean;\n}\n\nexport interface ScreenResult {\n  decision: Decision;\n  /** Total score across dimensions (negated and gazetteer-only hits excluded from term totals). */\n  score: number;\n  /** Per-dimension score (non-negated hits × weight, plus gazetteer boost when present). */\n  scores: Record<string, number>;\n  hits: ScreenHit[];\n  /** Whether a gazetteer entity was present. */\n  entity: boolean;\n  /** Human-readable \"held because\" reasons for an audit log. */\n  reasons: string[];\n}\n\ninterface Token {\n  raw: string;\n  norm: string; // lowercased\n  start: number;\n}\n\nconst WORD_RE = /[\\p{L}\\p{N}][\\p{L}\\p{N}‌‍]*/gu;\n\nfunction tokenize(text: string): Token[] {\n  const out: Token[] = [];\n  let m: RegExpExecArray | null;\n  WORD_RE.lastIndex = 0;\n  while ((m = WORD_RE.exec(text)) !== null) out.push({ raw: m[0], norm: m[0].toLowerCase(), start: m.index });\n  return out;\n}\n\nfunction termWords(term: string): string[] {\n  const out: string[] = [];\n  let m: RegExpExecArray | null;\n  WORD_RE.lastIndex = 0;\n  while ((m = WORD_RE.exec(term)) !== null) out.push(m[0].toLowerCase());\n  return out;\n}\n\nfunction isLatin(s: string): boolean {\n  return !/[^\\u0000-ɏ]/.test(s);\n}\n\ninterface NegRule {\n  kind: \"word\" | \"prefix\" | \"suffix\";\n  value: string;\n}\n\nfunction parseNegations(neg: string[]): NegRule[] {\n  return neg.map((n) => {\n    if (n.startsWith(\"-\")) return { kind: \"suffix\" as const, value: n.slice(1).toLowerCase() };\n    if (n.endsWith(\"*\")) return { kind: \"prefix\" as const, value: n.slice(0, -1).toLowerCase() };\n    return { kind: \"word\" as const, value: n.toLowerCase() };\n  });\n}\n\nfunction tokenMatchesNeg(tok: Token, rules: NegRule[]): boolean {\n  for (const r of rules) {\n    if (r.kind === \"word\" && tok.norm === r.value) return true;\n    if (r.kind === \"prefix\" && tok.norm.startsWith(r.value)) return true;\n    if (r.kind === \"suffix\" && tok.norm.endsWith(r.value) && tok.norm.length > r.value.length) return true;\n  }\n  return false;\n}\n\nexport interface Screen {\n  (text: string): ScreenResult;\n  readonly config: ScreenConfig;\n}\n\n/** Build a reusable screener from a config. Compiles term matchers once. */\nexport function createScreen(config: ScreenConfig): Screen {\n  const window = config.contextWindow ?? 4;\n  const negRules = parseNegations(config.negations ?? []);\n  const gaz = (config.gazetteer ?? []).filter(Boolean);\n  const gazLatin = gaz.filter(isLatin).map((g) => g.toLowerCase());\n  const gazOther = gaz.filter((g) => !isLatin(g));\n  const gazBoost = config.gazetteerBoost ?? 0.5;\n  const th = { clear: 0, review: 1, block: Infinity, ...(config.thresholds ?? {}) };\n\n  // Pre-split each dimension's terms into latin (token match) and substring (non-latin).\n  const dims = Object.entries(config.dimensions).map(([name, spec]) => ({\n    name,\n    weight: spec.weight ?? 1,\n    forceReview: spec.forceReview ?? false,\n    forceBlock: spec.forceBlock ?? false,\n    latin: spec.terms.filter(isLatin).map((t) => ({ term: t, words: termWords(t) })),\n    other: spec.terms.filter((t) => !isLatin(t)),\n  }));\n\n  const screen = ((text: string): ScreenResult => {\n    const toks = tokenize(text);\n    const lower = text.toLowerCase();\n    const hits: ScreenHit[] = [];\n    const scores: Record<string, number> = {};\n    for (const d of dims) scores[d.name] = 0;\n\n    const entity =\n      gazLatin.some((g) => new RegExp(`(?:^|[^a-z0-9])${escapeRe(g)}(?:[^a-z0-9]|$)`).test(lower)) ||\n      gazOther.some((g) => text.includes(g));\n\n    const negatedNear = (pos: number): boolean => {\n      const from = Math.max(0, pos - window);\n      const to = Math.min(toks.length - 1, pos + window);\n      for (let i = from; i <= to; i++) if (i !== pos && tokenMatchesNeg(toks[i]!, negRules)) return true;\n      return false;\n    };\n\n    const activeByDim = new Map<string, boolean>();\n    for (const d of dims) {\n      let anyActive = false;\n      // Latin multi-word phrase matching over the token stream.\n      for (const { term, words } of d.latin) {\n        if (words.length === 0) continue;\n        for (let i = 0; i + words.length <= toks.length; i++) {\n          let ok = true;\n          for (let j = 0; j < words.length; j++) if (toks[i + j]!.norm !== words[j]) { ok = false; break; }\n          if (!ok) continue;\n          const neg = negatedNear(i) || negatedNear(i + words.length - 1);\n          hits.push({ dim: d.name, term, pos: i, weight: d.weight, negated: neg });\n          if (!neg) {\n            scores[d.name]! += d.weight;\n            anyActive = true;\n          }\n        }\n      }\n      // Non-Latin substring matching (Devanagari etc.), position by nearest token.\n      for (const term of d.other) {\n        let idx = text.indexOf(term);\n        while (idx !== -1) {\n          const pos = nearestToken(toks, idx);\n          const neg = pos >= 0 ? negatedNear(pos) : false;\n          hits.push({ dim: d.name, term, pos, weight: d.weight, negated: neg });\n          if (!neg) {\n            scores[d.name]! += d.weight;\n            anyActive = true;\n          }\n          idx = text.indexOf(term, idx + term.length);\n        }\n      }\n      if (anyActive && entity) scores[d.name]! += gazBoost;\n      activeByDim.set(d.name, anyActive);\n    }\n\n    let total = 0;\n    for (const d of dims) total += scores[d.name]!;\n\n    // Decision.\n    const reasons: string[] = [];\n    let decision: Decision = \"clear\";\n    for (const d of dims) {\n      if (d.forceBlock && activeByDim.get(d.name)) {\n        decision = \"block\";\n        reasons.push(`${d.name}: force-block hit`);\n      }\n    }\n    if (decision !== \"block\") {\n      if (total >= th.block) {\n        decision = \"block\";\n        reasons.push(`total score ${round(total)} ≥ block ${th.block}`);\n      } else if (total >= th.review) {\n        decision = \"review\";\n        reasons.push(`total score ${round(total)} ≥ review ${th.review}`);\n      }\n      for (const d of dims) {\n        if (d.forceReview && activeByDim.get(d.name) && decision === \"clear\") {\n          decision = \"review\";\n          reasons.push(`${d.name}: force-review hit`);\n        }\n      }\n    }\n    if (decision === \"clear\") reasons.push(\"below review threshold\");\n\n    // Order hits deterministically.\n    hits.sort((a, b) => a.pos - b.pos || a.dim.localeCompare(b.dim) || a.term.localeCompare(b.term));\n\n    return { decision, score: round(total), scores: roundAll(scores), hits, entity, reasons };\n  }) as Screen;\n\n  Object.defineProperty(screen, \"config\", { value: config, enumerable: true });\n  return screen;\n}\n\n/** One-shot convenience: build and run in a single call. */\nexport function screenText(text: string, config: ScreenConfig): ScreenResult {\n  return createScreen(config)(text);\n}\n\nfunction nearestToken(toks: Token[], charPos: number): number {\n  // binary-ish: find the token whose start is closest to charPos\n  let best = -1;\n  let bestD = Infinity;\n  for (let i = 0; i < toks.length; i++) {\n    const d = Math.abs(toks[i]!.start - charPos);\n    if (d < bestD) {\n      bestD = d;\n      best = i;\n    }\n  }\n  return best;\n}\n\nfunction escapeRe(s: string): string {\n  return s.replace(/[.*+?^${}()|[\\]\\\\]/g, \"\\\\$&\");\n}\nfunction round(n: number): number {\n  return Math.round(n * 1000) / 1000;\n}\nfunction roundAll(o: Record<string, number>): Record<string, number> {\n  const out: Record<string, number> = {};\n  for (const k of Object.keys(o)) out[k] = round(o[k]!);\n  return out;\n}\n"]}

package/dist/index.d.cts

@@ -0,0 +1,70 @@
+/**
+ * @lacspace/screen — a cheap lexical pre-screen that decides whether text even
+ * needs an expensive model. You supply weighted term lexicons per dimension
+ * (multi-language), optional negation patterns and a named-entity gazetteer;
+ * `screen(text)` returns per-dimension scores, the matched terms, and a
+ * clear / review / block decision. Deterministic and zero-dependency.
+ */
+interface DimensionSpec {
+    /** Terms/phrases that signal this dimension. Latin matched case-insensitively on word boundaries; non-Latin (e.g. Devanagari) matched as substrings. */
+    terms: string[];
+    /** Score added per matched term. Default 1. */
+    weight?: number;
+    /** If any single hit on this dimension appears, the decision is at least "review" (never "clear"). Good for minor / election-sensitive. */
+    forceReview?: boolean;
+    /** If any single (non-negated) hit appears, the decision is "block". Use sparingly. */
+    forceBlock?: boolean;
+}
+interface ScreenConfig {
+    dimensions: Record<string, DimensionSpec>;
+    /**
+     * Words/patterns that flip a nearby hit to "negated" (not counted toward the score).
+     * Latin words match whole; a pattern ending in "*" is a prefix, and a value beginning
+     * with "-" is a SUFFIX pattern (for languages like Nepali where negation is a verb
+     * suffix, e.g. "-न", "-नन्").
+     */
+    negations?: string[];
+    /** How many tokens on each side of a hit are scanned for a negation. Default 4. */
+    contextWindow?: number;
+    /** Named entities (people/places) — a hit near one adds `gazetteerBoost` to every active dimension. */
+    gazetteer?: string[];
+    /** Score added to a dimension when the text also contains a gazetteer entity. Default 0.5. */
+    gazetteerBoost?: number;
+    /** Total-score thresholds. `clear`: at or below → clear. `review`: at or above (and below block) → review. */
+    thresholds?: {
+        clear?: number;
+        review?: number;
+        block?: number;
+    };
+}
+type Decision = "clear" | "review" | "block";
+interface ScreenHit {
+    dim: string;
+    term: string;
+    /** Token position of the hit. */
+    pos: number;
+    weight: number;
+    negated: boolean;
+}
+interface ScreenResult {
+    decision: Decision;
+    /** Total score across dimensions (negated and gazetteer-only hits excluded from term totals). */
+    score: number;
+    /** Per-dimension score (non-negated hits × weight, plus gazetteer boost when present). */
+    scores: Record<string, number>;
+    hits: ScreenHit[];
+    /** Whether a gazetteer entity was present. */
+    entity: boolean;
+    /** Human-readable "held because" reasons for an audit log. */
+    reasons: string[];
+}
+interface Screen {
+    (text: string): ScreenResult;
+    readonly config: ScreenConfig;
+}
+/** Build a reusable screener from a config. Compiles term matchers once. */
+declare function createScreen(config: ScreenConfig): Screen;
+/** One-shot convenience: build and run in a single call. */
+declare function screenText(text: string, config: ScreenConfig): ScreenResult;
+
+export { type Decision, type DimensionSpec, type Screen, type ScreenConfig, type ScreenHit, type ScreenResult, createScreen, screenText };

package/dist/index.d.ts

@@ -0,0 +1,70 @@
+/**
+ * @lacspace/screen — a cheap lexical pre-screen that decides whether text even
+ * needs an expensive model. You supply weighted term lexicons per dimension
+ * (multi-language), optional negation patterns and a named-entity gazetteer;
+ * `screen(text)` returns per-dimension scores, the matched terms, and a
+ * clear / review / block decision. Deterministic and zero-dependency.
+ */
+interface DimensionSpec {
+    /** Terms/phrases that signal this dimension. Latin matched case-insensitively on word boundaries; non-Latin (e.g. Devanagari) matched as substrings. */
+    terms: string[];
+    /** Score added per matched term. Default 1. */
+    weight?: number;
+    /** If any single hit on this dimension appears, the decision is at least "review" (never "clear"). Good for minor / election-sensitive. */
+    forceReview?: boolean;
+    /** If any single (non-negated) hit appears, the decision is "block". Use sparingly. */
+    forceBlock?: boolean;
+}
+interface ScreenConfig {
+    dimensions: Record<string, DimensionSpec>;
+    /**
+     * Words/patterns that flip a nearby hit to "negated" (not counted toward the score).
+     * Latin words match whole; a pattern ending in "*" is a prefix, and a value beginning
+     * with "-" is a SUFFIX pattern (for languages like Nepali where negation is a verb
+     * suffix, e.g. "-न", "-नन्").
+     */
+    negations?: string[];
+    /** How many tokens on each side of a hit are scanned for a negation. Default 4. */
+    contextWindow?: number;
+    /** Named entities (people/places) — a hit near one adds `gazetteerBoost` to every active dimension. */
+    gazetteer?: string[];
+    /** Score added to a dimension when the text also contains a gazetteer entity. Default 0.5. */
+    gazetteerBoost?: number;
+    /** Total-score thresholds. `clear`: at or below → clear. `review`: at or above (and below block) → review. */
+    thresholds?: {
+        clear?: number;
+        review?: number;
+        block?: number;
+    };
+}
+type Decision = "clear" | "review" | "block";
+interface ScreenHit {
+    dim: string;
+    term: string;
+    /** Token position of the hit. */
+    pos: number;
+    weight: number;
+    negated: boolean;
+}
+interface ScreenResult {
+    decision: Decision;
+    /** Total score across dimensions (negated and gazetteer-only hits excluded from term totals). */
+    score: number;
+    /** Per-dimension score (non-negated hits × weight, plus gazetteer boost when present). */
+    scores: Record<string, number>;
+    hits: ScreenHit[];
+    /** Whether a gazetteer entity was present. */
+    entity: boolean;
+    /** Human-readable "held because" reasons for an audit log. */
+    reasons: string[];
+}
+interface Screen {
+    (text: string): ScreenResult;
+    readonly config: ScreenConfig;
+}
+/** Build a reusable screener from a config. Compiles term matchers once. */
+declare function createScreen(config: ScreenConfig): Screen;
+/** One-shot convenience: build and run in a single call. */
+declare function screenText(text: string, config: ScreenConfig): ScreenResult;
+
+export { type Decision, type DimensionSpec, type Screen, type ScreenConfig, type ScreenHit, type ScreenResult, createScreen, screenText };

package/dist/index.js

@@ -0,0 +1,161 @@
+// src/index.ts
+var WORD_RE = /[\p{L}\p{N}][\p{L}\p{N}‌‍]*/gu;
+function tokenize(text) {
+  const out = [];
+  let m;
+  WORD_RE.lastIndex = 0;
+  while ((m = WORD_RE.exec(text)) !== null) out.push({ raw: m[0], norm: m[0].toLowerCase(), start: m.index });
+  return out;
+}
+function termWords(term) {
+  const out = [];
+  let m;
+  WORD_RE.lastIndex = 0;
+  while ((m = WORD_RE.exec(term)) !== null) out.push(m[0].toLowerCase());
+  return out;
+}
+function isLatin(s) {
+  return !/[^\u0000-ɏ]/.test(s);
+}
+function parseNegations(neg) {
+  return neg.map((n) => {
+    if (n.startsWith("-")) return { kind: "suffix", value: n.slice(1).toLowerCase() };
+    if (n.endsWith("*")) return { kind: "prefix", value: n.slice(0, -1).toLowerCase() };
+    return { kind: "word", value: n.toLowerCase() };
+  });
+}
+function tokenMatchesNeg(tok, rules) {
+  for (const r of rules) {
+    if (r.kind === "word" && tok.norm === r.value) return true;
+    if (r.kind === "prefix" && tok.norm.startsWith(r.value)) return true;
+    if (r.kind === "suffix" && tok.norm.endsWith(r.value) && tok.norm.length > r.value.length) return true;
+  }
+  return false;
+}
+function createScreen(config) {
+  const window = config.contextWindow ?? 4;
+  const negRules = parseNegations(config.negations ?? []);
+  const gaz = (config.gazetteer ?? []).filter(Boolean);
+  const gazLatin = gaz.filter(isLatin).map((g) => g.toLowerCase());
+  const gazOther = gaz.filter((g) => !isLatin(g));
+  const gazBoost = config.gazetteerBoost ?? 0.5;
+  const th = { review: 1, block: Infinity, ...config.thresholds ?? {} };
+  const dims = Object.entries(config.dimensions).map(([name, spec]) => ({
+    name,
+    weight: spec.weight ?? 1,
+    forceReview: spec.forceReview ?? false,
+    forceBlock: spec.forceBlock ?? false,
+    latin: spec.terms.filter(isLatin).map((t) => ({ term: t, words: termWords(t) })),
+    other: spec.terms.filter((t) => !isLatin(t))
+  }));
+  const screen = ((text) => {
+    const toks = tokenize(text);
+    const lower = text.toLowerCase();
+    const hits = [];
+    const scores = {};
+    for (const d of dims) scores[d.name] = 0;
+    const entity = gazLatin.some((g) => new RegExp(`(?:^|[^a-z0-9])${escapeRe(g)}(?:[^a-z0-9]|$)`).test(lower)) || gazOther.some((g) => text.includes(g));
+    const negatedNear = (pos) => {
+      const from = Math.max(0, pos - window);
+      const to = Math.min(toks.length - 1, pos + window);
+      for (let i = from; i <= to; i++) if (i !== pos && tokenMatchesNeg(toks[i], negRules)) return true;
+      return false;
+    };
+    const activeByDim = /* @__PURE__ */ new Map();
+    for (const d of dims) {
+      let anyActive = false;
+      for (const { term, words } of d.latin) {
+        if (words.length === 0) continue;
+        for (let i = 0; i + words.length <= toks.length; i++) {
+          let ok = true;
+          for (let j = 0; j < words.length; j++) if (toks[i + j].norm !== words[j]) {
+            ok = false;
+            break;
+          }
+          if (!ok) continue;
+          const neg = negatedNear(i) || negatedNear(i + words.length - 1);
+          hits.push({ dim: d.name, term, pos: i, weight: d.weight, negated: neg });
+          if (!neg) {
+            scores[d.name] += d.weight;
+            anyActive = true;
+          }
+        }
+      }
+      for (const term of d.other) {
+        let idx = text.indexOf(term);
+        while (idx !== -1) {
+          const pos = nearestToken(toks, idx);
+          const neg = pos >= 0 ? negatedNear(pos) : false;
+          hits.push({ dim: d.name, term, pos, weight: d.weight, negated: neg });
+          if (!neg) {
+            scores[d.name] += d.weight;
+            anyActive = true;
+          }
+          idx = text.indexOf(term, idx + term.length);
+        }
+      }
+      if (anyActive && entity) scores[d.name] += gazBoost;
+      activeByDim.set(d.name, anyActive);
+    }
+    let total = 0;
+    for (const d of dims) total += scores[d.name];
+    const reasons = [];
+    let decision = "clear";
+    for (const d of dims) {
+      if (d.forceBlock && activeByDim.get(d.name)) {
+        decision = "block";
+        reasons.push(`${d.name}: force-block hit`);
+      }
+    }
+    if (decision !== "block") {
+      if (total >= th.block) {
+        decision = "block";
+        reasons.push(`total score ${round(total)} \u2265 block ${th.block}`);
+      } else if (total >= th.review) {
+        decision = "review";
+        reasons.push(`total score ${round(total)} \u2265 review ${th.review}`);
+      }
+      for (const d of dims) {
+        if (d.forceReview && activeByDim.get(d.name) && decision === "clear") {
+          decision = "review";
+          reasons.push(`${d.name}: force-review hit`);
+        }
+      }
+    }
+    if (decision === "clear") reasons.push("below review threshold");
+    hits.sort((a, b) => a.pos - b.pos || a.dim.localeCompare(b.dim) || a.term.localeCompare(b.term));
+    return { decision, score: round(total), scores: roundAll(scores), hits, entity, reasons };
+  });
+  Object.defineProperty(screen, "config", { value: config, enumerable: true });
+  return screen;
+}
+function screenText(text, config) {
+  return createScreen(config)(text);
+}
+function nearestToken(toks, charPos) {
+  let best = -1;
+  let bestD = Infinity;
+  for (let i = 0; i < toks.length; i++) {
+    const d = Math.abs(toks[i].start - charPos);
+    if (d < bestD) {
+      bestD = d;
+      best = i;
+    }
+  }
+  return best;
+}
+function escapeRe(s) {
+  return s.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
+}
+function round(n) {
+  return Math.round(n * 1e3) / 1e3;
+}
+function roundAll(o) {
+  const out = {};
+  for (const k of Object.keys(o)) out[k] = round(o[k]);
+  return out;
+}
+
+export { createScreen, screenText };
+//# sourceMappingURL=index.js.map
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/index.ts"],"names":[],"mappings":";AAoEA,IAAM,OAAA,GAAU,+BAAA;AAEhB,SAAS,SAAS,IAAA,EAAuB;AACvC,EAAA,MAAM,MAAe,EAAC;AACtB,EAAA,IAAI,CAAA;AACJ,EAAA,OAAA,CAAQ,SAAA,GAAY,CAAA;AACpB,EAAA,OAAA,CAAQ,CAAA,GAAI,QAAQ,IAAA,CAAK,IAAI,OAAO,IAAA,EAAM,GAAA,CAAI,IAAA,CAAK,EAAE,GAAA,EAAK,CAAA,CAAE,CAAC,CAAA,EAAG,IAAA,EAAM,EAAE,CAAC,CAAA,CAAE,aAAY,EAAG,KAAA,EAAO,CAAA,CAAE,KAAA,EAAO,CAAA;AAC1G,EAAA,OAAO,GAAA;AACT;AAEA,SAAS,UAAU,IAAA,EAAwB;AACzC,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,IAAI,CAAA;AACJ,EAAA,OAAA,CAAQ,SAAA,GAAY,CAAA;AACpB,EAAA,OAAA,CAAQ,CAAA,GAAI,OAAA,CAAQ,IAAA,CAAK,IAAI,CAAA,MAAO,IAAA,EAAM,GAAA,CAAI,IAAA,CAAK,CAAA,CAAE,CAAC,CAAA,CAAE,WAAA,EAAa,CAAA;AACrE,EAAA,OAAO,GAAA;AACT;AAEA,SAAS,QAAQ,CAAA,EAAoB;AACnC,EAAA,OAAO,CAAC,aAAA,CAAc,IAAA,CAAK,CAAC,CAAA;AAC9B;AAOA,SAAS,eAAe,GAAA,EAA0B;AAChD,EAAA,OAAO,GAAA,CAAI,GAAA,CAAI,CAAC,CAAA,KAAM;AACpB,IAAA,IAAI,CAAA,CAAE,UAAA,CAAW,GAAG,CAAA,SAAU,EAAE,IAAA,EAAM,QAAA,EAAmB,KAAA,EAAO,CAAA,CAAE,KAAA,CAAM,CAAC,CAAA,CAAE,aAAY,EAAE;AACzF,IAAA,IAAI,CAAA,CAAE,QAAA,CAAS,GAAG,CAAA,SAAU,EAAE,IAAA,EAAM,QAAA,EAAmB,KAAA,EAAO,EAAE,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA,CAAE,aAAY,EAAE;AAC3F,IAAA,OAAO,EAAE,IAAA,EAAM,MAAA,EAAiB,KAAA,EAAO,CAAA,CAAE,aAAY,EAAE;AAAA,EACzD,CAAC,CAAA;AACH;AAEA,SAAS,eAAA,CAAgB,KAAY,KAAA,EAA2B;AAC9D,EAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,IAAA,IAAI,EAAE,IAAA,KAAS,MAAA,IAAU,IAAI,IAAA,KAAS,CAAA,CAAE,OAAO,OAAO,IAAA;AACtD,IAAA,IAAI,CAAA,CAAE,SAAS,QAAA,IAAY,GAAA,CAAI,KAAK,UAAA,CAAW,CAAA,CAAE,KAAK,CAAA,EAAG,OAAO,IAAA;AAChE,IAAA,IAAI,CAAA,CAAE,IAAA,KAAS,QAAA,IAAY,GAAA,CAAI,KAAK,QAAA,CAAS,CAAA,CAAE,KAAK,CAAA,IAAK,IAAI,IAAA,CAAK,MAAA,GAAS,CAAA,CAAE,KAAA,CAAM,QAAQ,OAAO,IAAA;AAAA,EACpG;AACA,EAAA,OAAO,KAAA;AACT;AAQO,SAAS,aAAa,MAAA,EAA8B;AACzD,EAAA,MAAM,MAAA,GAAS,OAAO,aAAA,IAAiB,CAAA;AACvC,EAAA,MAAM,QAAA,GAAW,cAAA,CAAe,MAAA,CAAO,SAAA,IAAa,EAAE,CAAA;AACtD,EAAA,MAAM,OAAO,MAAA,CAAO,SAAA,IAAa,EAAC,EAAG,OAAO,OAAO,CAAA;AACnD,EAAA,MAAM,QAAA,GAAW,GAAA,CAAI,MAAA,CAAO,OAAO,CAAA,CAAE,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,WAAA,EAAa,CAAA;AAC/D,EAAA,MAAM,QAAA,GAAW,IAAI,MAAA,CAAO,CAAC,MAAM,CAAC,OAAA,CAAQ,CAAC,CAAC,CAAA;AAC9C,EAAA,MAAM,QAAA,GAAW,OAAO,cAAA,IAAkB,GAAA;AAC1C,EAAA,MAAM,EAAA,GAAK,EAAY,MAAA,EAAQ,CAAA,EAAG,KAAA,EAAO,QAAA,EAAU,GAAI,MAAA,CAAO,UAAA,IAAc,EAAC,EAAG;AAGhF,EAAA,MAAM,IAAA,GAAO,MAAA,CAAO,OAAA,CAAQ,MAAA,CAAO,UAAU,CAAA,CAAE,GAAA,CAAI,CAAC,CAAC,IAAA,EAAM,IAAI,CAAA,MAAO;AAAA,IACpE,IAAA;AAAA,IACA,MAAA,EAAQ,KAAK,MAAA,IAAU,CAAA;AAAA,IACvB,WAAA,EAAa,KAAK,WAAA,IAAe,KAAA;AAAA,IACjC,UAAA,EAAY,KAAK,UAAA,IAAc,KAAA;AAAA,IAC/B,OAAO,IAAA,CAAK,KAAA,CAAM,MAAA,CAAO,OAAO,EAAE,GAAA,CAAI,CAAC,CAAA,MAAO,EAAE,MAAM,CAAA,EAAG,KAAA,EAAO,SAAA,CAAU,CAAC,GAAE,CAAE,CAAA;AAAA,IAC/E,KAAA,EAAO,KAAK,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,KAAM,CAAC,OAAA,CAAQ,CAAC,CAAC;AAAA,GAC7C,CAAE,CAAA;AAEF,EAAA,MAAM,MAAA,IAAU,CAAC,IAAA,KAA+B;AAC9C,IAAA,MAAM,IAAA,GAAO,SAAS,IAAI,CAAA;AAC1B,IAAA,MAAM,KAAA,GAAQ,KAAK,WAAA,EAAY;AAC/B,IAAA,MAAM,OAAoB,EAAC;AAC3B,IAAA,MAAM,SAAiC,EAAC;AACxC,IAAA,KAAA,MAAW,CAAA,IAAK,IAAA,EAAM,MAAA,CAAO,CAAA,CAAE,IAAI,CAAA,GAAI,CAAA;AAEvC,IAAA,MAAM,MAAA,GACJ,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,IAAI,MAAA,CAAO,CAAA,eAAA,EAAkB,QAAA,CAAS,CAAC,CAAC,CAAA,eAAA,CAAiB,EAAE,IAAA,CAAK,KAAK,CAAC,CAAA,IAC3F,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,IAAA,CAAK,QAAA,CAAS,CAAC,CAAC,CAAA;AAEvC,IAAA,MAAM,WAAA,GAAc,CAAC,GAAA,KAAyB;AAC5C,MAAA,MAAM,IAAA,GAAO,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,MAAM,MAAM,CAAA;AACrC,MAAA,MAAM,KAAK,IAAA,CAAK,GAAA,CAAI,KAAK,MAAA,GAAS,CAAA,EAAG,MAAM,MAAM,CAAA;AACjD,MAAA,KAAA,IAAS,CAAA,GAAI,IAAA,EAAM,CAAA,IAAK,EAAA,EAAI,KAAK,IAAI,CAAA,KAAM,GAAA,IAAO,eAAA,CAAgB,IAAA,CAAK,CAAC,CAAA,EAAI,QAAQ,GAAG,OAAO,IAAA;AAC9F,MAAA,OAAO,KAAA;AAAA,IACT,CAAA;AAEA,IAAA,MAAM,WAAA,uBAAkB,GAAA,EAAqB;AAC7C,IAAA,KAAA,MAAW,KAAK,IAAA,EAAM;AACpB,MAAA,IAAI,SAAA,GAAY,KAAA;AAEhB,MAAA,KAAA,MAAW,EAAE,IAAA,EAAM,KAAA,EAAM,IAAK,EAAE,KAAA,EAAO;AACrC,QAAA,IAAI,KAAA,CAAM,WAAW,CAAA,EAAG;AACxB,QAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,MAAM,MAAA,IAAU,IAAA,CAAK,QAAQ,CAAA,EAAA,EAAK;AACpD,UAAA,IAAI,EAAA,GAAK,IAAA;AACT,UAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK,IAAI,IAAA,CAAK,CAAA,GAAI,CAAC,CAAA,CAAG,IAAA,KAAS,KAAA,CAAM,CAAC,CAAA,EAAG;AAAE,YAAA,EAAA,GAAK,KAAA;AAAO,YAAA;AAAA,UAAO;AAChG,UAAA,IAAI,CAAC,EAAA,EAAI;AACT,UAAA,MAAM,GAAA,GAAM,YAAY,CAAC,CAAA,IAAK,YAAY,CAAA,GAAI,KAAA,CAAM,SAAS,CAAC,CAAA;AAC9D,UAAA,IAAA,CAAK,IAAA,CAAK,EAAE,GAAA,EAAK,CAAA,CAAE,IAAA,EAAM,IAAA,EAAM,GAAA,EAAK,CAAA,EAAG,MAAA,EAAQ,CAAA,CAAE,MAAA,EAAQ,OAAA,EAAS,KAAK,CAAA;AACvE,UAAA,IAAI,CAAC,GAAA,EAAK;AACR,YAAA,MAAA,CAAO,CAAA,CAAE,IAAI,CAAA,IAAM,CAAA,CAAE,MAAA;AACrB,YAAA,SAAA,GAAY,IAAA;AAAA,UACd;AAAA,QACF;AAAA,MACF;AAEA,MAAA,KAAA,MAAW,IAAA,IAAQ,EAAE,KAAA,EAAO;AAC1B,QAAA,IAAI,GAAA,GAAM,IAAA,CAAK,OAAA,CAAQ,IAAI,CAAA;AAC3B,QAAA,OAAO,QAAQ,EAAA,EAAI;AACjB,UAAA,MAAM,GAAA,GAAM,YAAA,CAAa,IAAA,EAAM,GAAG,CAAA;AAClC,UAAA,MAAM,GAAA,GAAM,GAAA,IAAO,CAAA,GAAI,WAAA,CAAY,GAAG,CAAA,GAAI,KAAA;AAC1C,UAAA,IAAA,CAAK,IAAA,CAAK,EAAE,GAAA,EAAK,CAAA,CAAE,IAAA,EAAM,IAAA,EAAM,GAAA,EAAK,MAAA,EAAQ,CAAA,CAAE,MAAA,EAAQ,OAAA,EAAS,GAAA,EAAK,CAAA;AACpE,UAAA,IAAI,CAAC,GAAA,EAAK;AACR,YAAA,MAAA,CAAO,CAAA,CAAE,IAAI,CAAA,IAAM,CAAA,CAAE,MAAA;AACrB,YAAA,SAAA,GAAY,IAAA;AAAA,UACd;AACA,UAAA,GAAA,GAAM,IAAA,CAAK,OAAA,CAAQ,IAAA,EAAM,GAAA,GAAM,KAAK,MAAM,CAAA;AAAA,QAC5C;AAAA,MACF;AACA,MAAA,IAAI,SAAA,IAAa,MAAA,EAAQ,MAAA,CAAO,CAAA,CAAE,IAAI,CAAA,IAAM,QAAA;AAC5C,MAAA,WAAA,CAAY,GAAA,CAAI,CAAA,CAAE,IAAA,EAAM,SAAS,CAAA;AAAA,IACnC;AAEA,IAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,IAAA,KAAA,MAAW,CAAA,IAAK,IAAA,EAAM,KAAA,IAAS,MAAA,CAAO,EAAE,IAAI,CAAA;AAG5C,IAAA,MAAM,UAAoB,EAAC;AAC3B,IAAA,IAAI,QAAA,GAAqB,OAAA;AACzB,IAAA,KAAA,MAAW,KAAK,IAAA,EAAM;AACpB,MAAA,IAAI,EAAE,UAAA,IAAc,WAAA,CAAY,GAAA,CAAI,CAAA,CAAE,IAAI,CAAA,EAAG;AAC3C,QAAA,QAAA,GAAW,OAAA;AACX,QAAA,OAAA,CAAQ,IAAA,CAAK,CAAA,EAAG,CAAA,CAAE,IAAI,CAAA,iBAAA,CAAmB,CAAA;AAAA,MAC3C;AAAA,IACF;AACA,IAAA,IAAI,aAAa,OAAA,EAAS;AACxB,MAAA,IAAI,KAAA,IAAS,GAAG,KAAA,EAAO;AACrB,QAAA,QAAA,GAAW,OAAA;AACX,QAAA,OAAA,CAAQ,IAAA,CAAK,eAAe,KAAA,CAAM,KAAK,CAAC,CAAA,cAAA,EAAY,EAAA,CAAG,KAAK,CAAA,CAAE,CAAA;AAAA,MAChE,CAAA,MAAA,IAAW,KAAA,IAAS,EAAA,CAAG,MAAA,EAAQ;AAC7B,QAAA,QAAA,GAAW,QAAA;AACX,QAAA,OAAA,CAAQ,IAAA,CAAK,eAAe,KAAA,CAAM,KAAK,CAAC,CAAA,eAAA,EAAa,EAAA,CAAG,MAAM,CAAA,CAAE,CAAA;AAAA,MAClE;AACA,MAAA,KAAA,MAAW,KAAK,IAAA,EAAM;AACpB,QAAA,IAAI,CAAA,CAAE,eAAe,WAAA,CAAY,GAAA,CAAI,EAAE,IAAI,CAAA,IAAK,aAAa,OAAA,EAAS;AACpE,UAAA,QAAA,GAAW,QAAA;AACX,UAAA,OAAA,CAAQ,IAAA,CAAK,CAAA,EAAG,CAAA,CAAE,IAAI,CAAA,kBAAA,CAAoB,CAAA;AAAA,QAC5C;AAAA,MACF;AAAA,IACF;AACA,IAAA,IAAI,QAAA,KAAa,OAAA,EAAS,OAAA,CAAQ,IAAA,CAAK,wBAAwB,CAAA;AAG/D,IAAA,IAAA,CAAK,KAAK,CAAC,CAAA,EAAG,MAAM,CAAA,CAAE,GAAA,GAAM,EAAE,GAAA,IAAO,CAAA,CAAE,IAAI,aAAA,CAAc,CAAA,CAAE,GAAG,CAAA,IAAK,CAAA,CAAE,KAAK,aAAA,CAAc,CAAA,CAAE,IAAI,CAAC,CAAA;AAE/F,IAAA,OAAO,EAAE,QAAA,EAAU,KAAA,EAAO,KAAA,CAAM,KAAK,CAAA,EAAG,MAAA,EAAQ,QAAA,CAAS,MAAM,CAAA,EAAG,IAAA,EAAM,MAAA,EAAQ,OAAA,EAAQ;AAAA,EAC1F,CAAA,CAAA;AAEA,EAAA,MAAA,CAAO,cAAA,CAAe,QAAQ,QAAA,EAAU,EAAE,OAAO,MAAA,EAAQ,UAAA,EAAY,MAAM,CAAA;AAC3E,EAAA,OAAO,MAAA;AACT;AAGO,SAAS,UAAA,CAAW,MAAc,MAAA,EAAoC;AAC3E,EAAA,OAAO,YAAA,CAAa,MAAM,CAAA,CAAE,IAAI,CAAA;AAClC;AAEA,SAAS,YAAA,CAAa,MAAe,OAAA,EAAyB;AAE5D,EAAA,IAAI,IAAA,GAAO,EAAA;AACX,EAAA,IAAI,KAAA,GAAQ,QAAA;AACZ,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,IAAA,CAAK,QAAQ,CAAA,EAAA,EAAK;AACpC,IAAA,MAAM,IAAI,IAAA,CAAK,GAAA,CAAI,KAAK,CAAC,CAAA,CAAG,QAAQ,OAAO,CAAA;AAC3C,IAAA,IAAI,IAAI,KAAA,EAAO;AACb,MAAA,KAAA,GAAQ,CAAA;AACR,MAAA,IAAA,GAAO,CAAA;AAAA,IACT;AAAA,EACF;AACA,EAAA,OAAO,IAAA;AACT;AAEA,SAAS,SAAS,CAAA,EAAmB;AACnC,EAAA,OAAO,CAAA,CAAE,OAAA,CAAQ,qBAAA,EAAuB,MAAM,CAAA;AAChD;AACA,SAAS,MAAM,CAAA,EAAmB;AAChC,EAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,GAAI,GAAI,CAAA,GAAI,GAAA;AAChC;AACA,SAAS,SAAS,CAAA,EAAmD;AACnE,EAAA,MAAM,MAA8B,EAAC;AACrC,EAAA,KAAA,MAAW,CAAA,IAAK,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,EAAG,GAAA,CAAI,CAAC,CAAA,GAAI,KAAA,CAAM,CAAA,CAAE,CAAC,CAAE,CAAA;AACpD,EAAA,OAAO,GAAA;AACT","file":"index.js","sourcesContent":["/**\n * @lacspace/screen — a cheap lexical pre-screen that decides whether text even\n * needs an expensive model. You supply weighted term lexicons per dimension\n * (multi-language), optional negation patterns and a named-entity gazetteer;\n * `screen(text)` returns per-dimension scores, the matched terms, and a\n * clear / review / block decision. Deterministic and zero-dependency.\n */\n\nexport interface DimensionSpec {\n  /** Terms/phrases that signal this dimension. Latin matched case-insensitively on word boundaries; non-Latin (e.g. Devanagari) matched as substrings. */\n  terms: string[];\n  /** Score added per matched term. Default 1. */\n  weight?: number;\n  /** If any single hit on this dimension appears, the decision is at least \"review\" (never \"clear\"). Good for minor / election-sensitive. */\n  forceReview?: boolean;\n  /** If any single (non-negated) hit appears, the decision is \"block\". Use sparingly. */\n  forceBlock?: boolean;\n}\n\nexport interface ScreenConfig {\n  dimensions: Record<string, DimensionSpec>;\n  /**\n   * Words/patterns that flip a nearby hit to \"negated\" (not counted toward the score).\n   * Latin words match whole; a pattern ending in \"*\" is a prefix, and a value beginning\n   * with \"-\" is a SUFFIX pattern (for languages like Nepali where negation is a verb\n   * suffix, e.g. \"-न\", \"-नन्\").\n   */\n  negations?: string[];\n  /** How many tokens on each side of a hit are scanned for a negation. Default 4. */\n  contextWindow?: number;\n  /** Named entities (people/places) — a hit near one adds `gazetteerBoost` to every active dimension. */\n  gazetteer?: string[];\n  /** Score added to a dimension when the text also contains a gazetteer entity. Default 0.5. */\n  gazetteerBoost?: number;\n  /** Total-score thresholds. `clear`: at or below → clear. `review`: at or above (and below block) → review. */\n  thresholds?: { clear?: number; review?: number; block?: number };\n}\n\nexport type Decision = \"clear\" | \"review\" | \"block\";\n\nexport interface ScreenHit {\n  dim: string;\n  term: string;\n  /** Token position of the hit. */\n  pos: number;\n  weight: number;\n  negated: boolean;\n}\n\nexport interface ScreenResult {\n  decision: Decision;\n  /** Total score across dimensions (negated and gazetteer-only hits excluded from term totals). */\n  score: number;\n  /** Per-dimension score (non-negated hits × weight, plus gazetteer boost when present). */\n  scores: Record<string, number>;\n  hits: ScreenHit[];\n  /** Whether a gazetteer entity was present. */\n  entity: boolean;\n  /** Human-readable \"held because\" reasons for an audit log. */\n  reasons: string[];\n}\n\ninterface Token {\n  raw: string;\n  norm: string; // lowercased\n  start: number;\n}\n\nconst WORD_RE = /[\\p{L}\\p{N}][\\p{L}\\p{N}‌‍]*/gu;\n\nfunction tokenize(text: string): Token[] {\n  const out: Token[] = [];\n  let m: RegExpExecArray | null;\n  WORD_RE.lastIndex = 0;\n  while ((m = WORD_RE.exec(text)) !== null) out.push({ raw: m[0], norm: m[0].toLowerCase(), start: m.index });\n  return out;\n}\n\nfunction termWords(term: string): string[] {\n  const out: string[] = [];\n  let m: RegExpExecArray | null;\n  WORD_RE.lastIndex = 0;\n  while ((m = WORD_RE.exec(term)) !== null) out.push(m[0].toLowerCase());\n  return out;\n}\n\nfunction isLatin(s: string): boolean {\n  return !/[^\\u0000-ɏ]/.test(s);\n}\n\ninterface NegRule {\n  kind: \"word\" | \"prefix\" | \"suffix\";\n  value: string;\n}\n\nfunction parseNegations(neg: string[]): NegRule[] {\n  return neg.map((n) => {\n    if (n.startsWith(\"-\")) return { kind: \"suffix\" as const, value: n.slice(1).toLowerCase() };\n    if (n.endsWith(\"*\")) return { kind: \"prefix\" as const, value: n.slice(0, -1).toLowerCase() };\n    return { kind: \"word\" as const, value: n.toLowerCase() };\n  });\n}\n\nfunction tokenMatchesNeg(tok: Token, rules: NegRule[]): boolean {\n  for (const r of rules) {\n    if (r.kind === \"word\" && tok.norm === r.value) return true;\n    if (r.kind === \"prefix\" && tok.norm.startsWith(r.value)) return true;\n    if (r.kind === \"suffix\" && tok.norm.endsWith(r.value) && tok.norm.length > r.value.length) return true;\n  }\n  return false;\n}\n\nexport interface Screen {\n  (text: string): ScreenResult;\n  readonly config: ScreenConfig;\n}\n\n/** Build a reusable screener from a config. Compiles term matchers once. */\nexport function createScreen(config: ScreenConfig): Screen {\n  const window = config.contextWindow ?? 4;\n  const negRules = parseNegations(config.negations ?? []);\n  const gaz = (config.gazetteer ?? []).filter(Boolean);\n  const gazLatin = gaz.filter(isLatin).map((g) => g.toLowerCase());\n  const gazOther = gaz.filter((g) => !isLatin(g));\n  const gazBoost = config.gazetteerBoost ?? 0.5;\n  const th = { clear: 0, review: 1, block: Infinity, ...(config.thresholds ?? {}) };\n\n  // Pre-split each dimension's terms into latin (token match) and substring (non-latin).\n  const dims = Object.entries(config.dimensions).map(([name, spec]) => ({\n    name,\n    weight: spec.weight ?? 1,\n    forceReview: spec.forceReview ?? false,\n    forceBlock: spec.forceBlock ?? false,\n    latin: spec.terms.filter(isLatin).map((t) => ({ term: t, words: termWords(t) })),\n    other: spec.terms.filter((t) => !isLatin(t)),\n  }));\n\n  const screen = ((text: string): ScreenResult => {\n    const toks = tokenize(text);\n    const lower = text.toLowerCase();\n    const hits: ScreenHit[] = [];\n    const scores: Record<string, number> = {};\n    for (const d of dims) scores[d.name] = 0;\n\n    const entity =\n      gazLatin.some((g) => new RegExp(`(?:^|[^a-z0-9])${escapeRe(g)}(?:[^a-z0-9]|$)`).test(lower)) ||\n      gazOther.some((g) => text.includes(g));\n\n    const negatedNear = (pos: number): boolean => {\n      const from = Math.max(0, pos - window);\n      const to = Math.min(toks.length - 1, pos + window);\n      for (let i = from; i <= to; i++) if (i !== pos && tokenMatchesNeg(toks[i]!, negRules)) return true;\n      return false;\n    };\n\n    const activeByDim = new Map<string, boolean>();\n    for (const d of dims) {\n      let anyActive = false;\n      // Latin multi-word phrase matching over the token stream.\n      for (const { term, words } of d.latin) {\n        if (words.length === 0) continue;\n        for (let i = 0; i + words.length <= toks.length; i++) {\n          let ok = true;\n          for (let j = 0; j < words.length; j++) if (toks[i + j]!.norm !== words[j]) { ok = false; break; }\n          if (!ok) continue;\n          const neg = negatedNear(i) || negatedNear(i + words.length - 1);\n          hits.push({ dim: d.name, term, pos: i, weight: d.weight, negated: neg });\n          if (!neg) {\n            scores[d.name]! += d.weight;\n            anyActive = true;\n          }\n        }\n      }\n      // Non-Latin substring matching (Devanagari etc.), position by nearest token.\n      for (const term of d.other) {\n        let idx = text.indexOf(term);\n        while (idx !== -1) {\n          const pos = nearestToken(toks, idx);\n          const neg = pos >= 0 ? negatedNear(pos) : false;\n          hits.push({ dim: d.name, term, pos, weight: d.weight, negated: neg });\n          if (!neg) {\n            scores[d.name]! += d.weight;\n            anyActive = true;\n          }\n          idx = text.indexOf(term, idx + term.length);\n        }\n      }\n      if (anyActive && entity) scores[d.name]! += gazBoost;\n      activeByDim.set(d.name, anyActive);\n    }\n\n    let total = 0;\n    for (const d of dims) total += scores[d.name]!;\n\n    // Decision.\n    const reasons: string[] = [];\n    let decision: Decision = \"clear\";\n    for (const d of dims) {\n      if (d.forceBlock && activeByDim.get(d.name)) {\n        decision = \"block\";\n        reasons.push(`${d.name}: force-block hit`);\n      }\n    }\n    if (decision !== \"block\") {\n      if (total >= th.block) {\n        decision = \"block\";\n        reasons.push(`total score ${round(total)} ≥ block ${th.block}`);\n      } else if (total >= th.review) {\n        decision = \"review\";\n        reasons.push(`total score ${round(total)} ≥ review ${th.review}`);\n      }\n      for (const d of dims) {\n        if (d.forceReview && activeByDim.get(d.name) && decision === \"clear\") {\n          decision = \"review\";\n          reasons.push(`${d.name}: force-review hit`);\n        }\n      }\n    }\n    if (decision === \"clear\") reasons.push(\"below review threshold\");\n\n    // Order hits deterministically.\n    hits.sort((a, b) => a.pos - b.pos || a.dim.localeCompare(b.dim) || a.term.localeCompare(b.term));\n\n    return { decision, score: round(total), scores: roundAll(scores), hits, entity, reasons };\n  }) as Screen;\n\n  Object.defineProperty(screen, \"config\", { value: config, enumerable: true });\n  return screen;\n}\n\n/** One-shot convenience: build and run in a single call. */\nexport function screenText(text: string, config: ScreenConfig): ScreenResult {\n  return createScreen(config)(text);\n}\n\nfunction nearestToken(toks: Token[], charPos: number): number {\n  // binary-ish: find the token whose start is closest to charPos\n  let best = -1;\n  let bestD = Infinity;\n  for (let i = 0; i < toks.length; i++) {\n    const d = Math.abs(toks[i]!.start - charPos);\n    if (d < bestD) {\n      bestD = d;\n      best = i;\n    }\n  }\n  return best;\n}\n\nfunction escapeRe(s: string): string {\n  return s.replace(/[.*+?^${}()|[\\]\\\\]/g, \"\\\\$&\");\n}\nfunction round(n: number): number {\n  return Math.round(n * 1000) / 1000;\n}\nfunction roundAll(o: Record<string, number>): Record<string, number> {\n  const out: Record<string, number> = {};\n  for (const k of Object.keys(o)) out[k] = round(o[k]!);\n  return out;\n}\n"]}

package/package.json

@@ -0,0 +1,26 @@
+{
+  "name": "@lacspace/screen",
+  "version": "1.0.0",
+  "description": "A cheap, zero-dependency lexical content screener and LLM admission gate — score text against your own weighted term lexicons (multi-language, with negation and proximity windows and an optional named-entity gazetteer) and get back a clear / review / block decision, so obviously-clean and obviously-flagged text never has to reach an expensive model. Deterministic, isomorphic, auditable.",
+  "type": "module",
+  "main": "./dist/index.cjs",
+  "module": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "exports": {
+    ".": {
+      "import": { "types": "./dist/index.d.ts", "default": "./dist/index.js" },
+      "require": { "types": "./dist/index.d.cts", "default": "./dist/index.cjs" }
+    }
+  },
+  "files": ["dist"],
+  "sideEffects": false,
+  "scripts": { "build": "tsup", "prepublishOnly": "npm run build" },
+  "keywords": ["content-moderation", "lexical", "screener", "triage", "llm-gate", "admission-control", "classifier", "keyword-scoring", "negation", "gazetteer", "sensitivity", "nepali", "devanagari", "zero-dependency", "isomorphic", "typescript"],
+  "author": "Lacspace <contact@lacspace.com>",
+  "license": "SEE LICENSE IN LICENSE",
+  "homepage": "https://developer.lacspace.com/packages/screen",
+  "repository": { "type": "git", "url": "git+https://github.com/lacspace/npm-packages.git", "directory": "screen" },
+  "bugs": { "url": "https://github.com/lacspace/npm-packages/issues" },
+  "engines": { "node": ">=18" },
+  "publishConfig": { "access": "public" }
+}