@lucern/contracts 0.1.1-alpha.1 → 0.1.2-alpha.2

package/dist/text-matching.contract.d.ts

@@ -0,0 +1,55 @@
+/**
+ * Shared lexical matching primitives used across MCP handlers and graph utilities.
+ *
+ * The goal is not to replace downstream LLM scoring. It provides a fast,
+ * deterministic substrate for candidate generation, reranking, and light
+ * classification across belief/question/evidence/entity surfaces.
+ */
+type LexicalStrategy = "tokenOverlap" | "bigramJaccard" | "wordOverlap";
+type PreparedLexicalQuery = {
+    raw: string;
+    tokens: string[];
+    words: string[];
+    bigrams: Set<string>;
+};
+type LexicalSignal = {
+    strategy?: LexicalStrategy;
+    text: string | null | undefined;
+    weight: number;
+};
+type LexicalRerankOptions = {
+    lexicalWeight?: number;
+    rankWeight?: number;
+};
+/** Tokenize a string into lowercase words, removing stop words. */
+declare function tokenizeSearchText(text: string): string[];
+/** Simple stemmer: strip common English suffixes for fuzzy matching. */
+declare function stemToken(word: string): string;
+/** Compute token overlap score between query tokens and text tokens. */
+declare function tokenOverlapScore(queryTokens: string[], textTokens: string[]): number;
+/**
+ * Extract character bigrams from text. Normalizes to lowercase, removes
+ * non-alphanumeric characters, and generates overlapping pairs.
+ */
+declare function bigramTokenize(text: string): Set<string>;
+/**
+ * Extract word-level tokens from text (for coarser matching).
+ * Normalizes to lowercase, splits on non-alphanumeric.
+ */
+declare function wordTokenize(text: string): string[];
+/** Jaccard similarity between two sets: |A ∩ B| / |A ∪ B|. */
+declare function jaccardSimilarity(setA: Set<string>, setB: Set<string>): number;
+/** Exact word overlap score: fraction of type words found in input text. */
+declare function wordOverlapScore(inputWords: string[], typeWords: string[]): number;
+/** Pre-compute reusable lexical structures for a query. */
+declare function prepareLexicalQuery(query: string): PreparedLexicalQuery;
+/** Score a single lexical signal against a prepared query. */
+declare function scoreLexicalSignal(query: PreparedLexicalQuery, signal: LexicalSignal): number;
+/** Weighted lexical score across multiple textual signals. */
+declare function scoreLexicalSignals(query: PreparedLexicalQuery, signals: LexicalSignal[]): number;
+/** Map a candidate's original rank position into a 0..1 prior. */
+declare function rankWindowScore(index: number, total: number): number;
+/** Rerank a candidate window by lexical overlap while preserving original-rank prior. */
+declare function rerankLexicalWindow<T>(query: string, items: T[], getText: (item: T) => string | null | undefined, options?: LexicalRerankOptions): T[];
+
+export { type LexicalRerankOptions, type LexicalSignal, type LexicalStrategy, type PreparedLexicalQuery, bigramTokenize, jaccardSimilarity, prepareLexicalQuery, rankWindowScore, rerankLexicalWindow, scoreLexicalSignal, scoreLexicalSignals, stemToken, tokenOverlapScore, tokenizeSearchText, wordOverlapScore, wordTokenize };

package/{src/text-matching.contract.ts → dist/text-matching.contract.js}

@@ -1,36 +1,7 @@
-/**
- * Shared lexical matching primitives used across MCP handlers and graph utilities.
- *
- * The goal is not to replace downstream LLM scoring. It provides a fast,
- * deterministic substrate for candidate generation, reranking, and light
- * classification across belief/question/evidence/entity surfaces.
- */
-
-export type LexicalStrategy = "tokenOverlap" | "bigramJaccard" | "wordOverlap";
-
-export type PreparedLexicalQuery = {
-  raw: string;
-  tokens: string[];
-  words: string[];
-  bigrams: Set<string>;
-};
-
-export type LexicalSignal = {
-  strategy?: LexicalStrategy;
-  text: string | null | undefined;
-  weight: number;
-};
-
-export type LexicalRerankOptions = {
-  lexicalWeight?: number;
-  rankWeight?: number;
-};
-
-const TOKEN_SPLIT_REGEX = /[^a-z0-9]+/;
-const NON_ALPHANUMERIC_REGEX = /[^a-z0-9]/g;
-
-/** Stop words that add noise to scoring. */
-const STOP_WORDS = new Set([
+// src/text-matching.contract.ts
+var TOKEN_SPLIT_REGEX = /[^a-z0-9]+/;
+var NON_ALPHANUMERIC_REGEX = /[^a-z0-9]/g;
+var STOP_WORDS = /* @__PURE__ */ new Set([
   "the",
   "a",
   "an",
@@ -86,19 +57,12 @@ const STOP_WORDS = new Set([
   "their",
   "we",
   "our",
-  "so",
+  "so"
 ]);
-
-/** Tokenize a string into lowercase words, removing stop words. */
-export function tokenizeSearchText(text: string): string[] {
-  return text
-    .toLowerCase()
-    .split(TOKEN_SPLIT_REGEX)
-    .filter((token) => token.length >= 2 && !STOP_WORDS.has(token));
+function tokenizeSearchText(text) {
+  return text.toLowerCase().split(TOKEN_SPLIT_REGEX).filter((token) => token.length >= 2 && !STOP_WORDS.has(token));
 }
-
-/** Simple stemmer: strip common English suffixes for fuzzy matching. */
-export function stemToken(word: string): string {
+function stemToken(word) {
   if (word.length <= 4) {
     return word;
   }
@@ -158,93 +122,54 @@ export function stemToken(word: string): string {
   }
   return word;
 }
-
-/** Compute token overlap score between query tokens and text tokens. */
-export function tokenOverlapScore(
-  queryTokens: string[],
-  textTokens: string[]
-): number {
+function tokenOverlapScore(queryTokens, textTokens) {
   if (queryTokens.length === 0 || textTokens.length === 0) {
     return 0;
   }
-
   const stemmedText = new Set(textTokens.map(stemToken));
   let matchCount = 0;
-
   for (const queryToken of queryTokens) {
     const stemmedQuery = stemToken(queryToken);
-
     if (stemmedText.has(stemmedQuery)) {
       matchCount += 1;
       continue;
     }
-
     for (const textToken of stemmedText) {
-      if (
-        textToken.startsWith(stemmedQuery) ||
-        stemmedQuery.startsWith(textToken)
-      ) {
+      if (textToken.startsWith(stemmedQuery) || stemmedQuery.startsWith(textToken)) {
         matchCount += 0.5;
         break;
       }
     }
   }
-
   return matchCount / queryTokens.length;
 }
-
-/**
- * Extract character bigrams from text. Normalizes to lowercase, removes
- * non-alphanumeric characters, and generates overlapping pairs.
- */
-export function bigramTokenize(text: string): Set<string> {
+function bigramTokenize(text) {
   const normalized = text.toLowerCase().replace(NON_ALPHANUMERIC_REGEX, "");
-  const bigrams = new Set<string>();
+  const bigrams = /* @__PURE__ */ new Set();
   for (let i = 0; i < normalized.length - 1; i++) {
     bigrams.add(normalized.slice(i, i + 2));
   }
   return bigrams;
 }
-
-/**
- * Extract word-level tokens from text (for coarser matching).
- * Normalizes to lowercase, splits on non-alphanumeric.
- */
-export function wordTokenize(text: string): string[] {
-  return text
-    .toLowerCase()
-    .split(TOKEN_SPLIT_REGEX)
-    .filter((token) => token.length > 1);
+function wordTokenize(text) {
+  return text.toLowerCase().split(TOKEN_SPLIT_REGEX).filter((token) => token.length > 1);
 }
-
-/** Jaccard similarity between two sets: |A ∩ B| / |A ∪ B|. */
-export function jaccardSimilarity(
-  setA: Set<string>,
-  setB: Set<string>
-): number {
+function jaccardSimilarity(setA, setB) {
   if (setA.size === 0 && setB.size === 0) {
     return 0;
   }
-
   let intersectionSize = 0;
   const smaller = setA.size <= setB.size ? setA : setB;
   const larger = setA.size <= setB.size ? setB : setA;
-
   for (const item of smaller) {
     if (larger.has(item)) {
       intersectionSize++;
     }
   }
-
   const unionSize = setA.size + setB.size - intersectionSize;
   return unionSize === 0 ? 0 : intersectionSize / unionSize;
 }
-
-/** Exact word overlap score: fraction of type words found in input text. */
-export function wordOverlapScore(
-  inputWords: string[],
-  typeWords: string[]
-): number {
+function wordOverlapScore(inputWords, typeWords) {
   if (typeWords.length === 0) {
     return 0;
   }
@@ -256,27 +181,19 @@ export function wordOverlapScore(
   }
   return matches / typeWords.length;
 }
-
-/** Pre-compute reusable lexical structures for a query. */
-export function prepareLexicalQuery(query: string): PreparedLexicalQuery {
+function prepareLexicalQuery(query) {
   return {
     raw: query,
     tokens: tokenizeSearchText(query),
     words: wordTokenize(query),
-    bigrams: bigramTokenize(query),
+    bigrams: bigramTokenize(query)
   };
 }
-
-/** Score a single lexical signal against a prepared query. */
-export function scoreLexicalSignal(
-  query: PreparedLexicalQuery,
-  signal: LexicalSignal
-): number {
+function scoreLexicalSignal(query, signal) {
   const text = signal.text?.trim();
   if (!text) {
     return 0;
   }
-
   switch (signal.strategy ?? "tokenOverlap") {
     case "bigramJaccard":
       return jaccardSimilarity(query.bigrams, bigramTokenize(text));
@@ -286,15 +203,9 @@ export function scoreLexicalSignal(
       return tokenOverlapScore(query.tokens, tokenizeSearchText(text));
   }
 }
-
-/** Weighted lexical score across multiple textual signals. */
-export function scoreLexicalSignals(
-  query: PreparedLexicalQuery,
-  signals: LexicalSignal[]
-): number {
+function scoreLexicalSignals(query, signals) {
   let weightedScore = 0;
   let totalWeight = 0;
-
   for (const signal of signals) {
     if (!signal.text?.trim() || signal.weight <= 0) {
       continue;
@@ -302,46 +213,34 @@ export function scoreLexicalSignals(
     weightedScore += scoreLexicalSignal(query, signal) * signal.weight;
     totalWeight += signal.weight;
   }
-
   return totalWeight === 0 ? 0 : weightedScore / totalWeight;
 }
-
-/** Map a candidate's original rank position into a 0..1 prior. */
-export function rankWindowScore(index: number, total: number): number {
+function rankWindowScore(index, total) {
   if (total <= 1) {
     return 1;
   }
   const clampedIndex = Math.max(0, Math.min(index, total - 1));
   return 1 - clampedIndex / (total - 1);
 }
-
-/** Rerank a candidate window by lexical overlap while preserving original-rank prior. */
-export function rerankLexicalWindow<T>(
-  query: string,
-  items: T[],
-  getText: (item: T) => string | null | undefined,
-  options?: LexicalRerankOptions
-): T[] {
+function rerankLexicalWindow(query, items, getText, options) {
   const preparedQuery = prepareLexicalQuery(query);
   if (preparedQuery.tokens.length === 0 || items.length <= 1) {
     return items;
   }
-
   const lexicalWeight = options?.lexicalWeight ?? 0.65;
   const rankWeight = options?.rankWeight ?? 0.35;
-
-  return items
-    .map((item, index) => {
-      const lexicalScore = scoreLexicalSignals(preparedQuery, [
-        { text: getText(item) ?? "", weight: 1, strategy: "tokenOverlap" },
-      ]);
-      const rankScore = rankWindowScore(index, items.length);
-
-      return {
-        item,
-        combinedScore: lexicalScore * lexicalWeight + rankScore * rankWeight,
-      };
-    })
-    .sort((left, right) => right.combinedScore - left.combinedScore)
-    .map(({ item }) => item);
+  return items.map((item, index) => {
+    const lexicalScore = scoreLexicalSignals(preparedQuery, [
+      { text: getText(item) ?? "", weight: 1, strategy: "tokenOverlap" }
+    ]);
+    const rankScore = rankWindowScore(index, items.length);
+    return {
+      item,
+      combinedScore: lexicalScore * lexicalWeight + rankScore * rankWeight
+    };
+  }).sort((left, right) => right.combinedScore - left.combinedScore).map(({ item }) => item);
 }
+
+export { bigramTokenize, jaccardSimilarity, prepareLexicalQuery, rankWindowScore, rerankLexicalWindow, scoreLexicalSignal, scoreLexicalSignals, stemToken, tokenOverlapScore, tokenizeSearchText, wordOverlapScore, wordTokenize };
+//# sourceMappingURL=text-matching.contract.js.map
+//# sourceMappingURL=text-matching.contract.js.map

package/dist/text-matching.contract.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/text-matching.contract.ts"],"names":[],"mappings":";AA4BA,IAAM,iBAAA,GAAoB,YAAA;AAC1B,IAAM,sBAAA,GAAyB,YAAA;AAG/B,IAAM,UAAA,uBAAiB,GAAA,CAAI;AAAA,EACzB,KAAA;AAAA,EACA,GAAA;AAAA,EACA,IAAA;AAAA,EACA,KAAA;AAAA,EACA,IAAA;AAAA,EACA,KAAA;AAAA,EACA,IAAA;AAAA,EACA,IAAA;AAAA,EACA,IAAA;AAAA,EACA,IAAA;AAAA,EACA,KAAA;AAAA,EACA,IAAA;AAAA,EACA,MAAA;AAAA,EACA,IAAA;AAAA,EACA,MAAA;AAAA,EACA,IAAA;AAAA,EACA,IAAA;AAAA,EACA,IAAA;AAAA,EACA,IAAA;AAAA,EACA,KAAA;AAAA,EACA,KAAA;AAAA,EACA,MAAA;AAAA,EACA,MAAA;AAAA,EACA,KAAA;AAAA,EACA,KAAA;AAAA,EACA,MAAA;AAAA,EACA,KAAA;AAAA,EACA,KAAA;AAAA,EACA,KAAA;AAAA,EACA,IAAA;AAAA,EACA,KAAA;AAAA,EACA,KAAA;AAAA,EACA,MAAA;AAAA,EACA,KAAA;AAAA,EACA,MAAA;AAAA,EACA,OAAA;AAAA,EACA,KAAA;AAAA,EACA,MAAA;AAAA,EACA,OAAA;AAAA,EACA,MAAA;AAAA,EACA,MAAA;AAAA,EACA,MAAA;AAAA,EACA,MAAA;AAAA,EACA,MAAA;AAAA,EACA,KAAA;AAAA,EACA,MAAA;AAAA,EACA,IAAA;AAAA,EACA,OAAA;AAAA,EACA,OAAA;AAAA,EACA,QAAA;AAAA,EACA,OAAA;AAAA,EACA,OAAA;AAAA,EACA,OAAA;AAAA,EACA,IAAA;AAAA,EACA,KAAA;AAAA,EACA;AACF,CAAC,CAAA;AAGM,SAAS,mBAAmB,IAAA,EAAwB;AACzD,EAAA,OAAO,KACJ,WAAA,EAAY,CACZ,KAAA,CAAM,iBAAiB,EACvB,MAAA,CAAO,CAAC,KAAA,KAAU,KAAA,CAAM,UAAU,CAAA,IAAK,CAAC,UAAA,CAAW,GAAA,CAAI,KAAK,CAAC,CAAA;AAClE;AAGO,SAAS,UAAU,IAAA,EAAsB;AAC9C,EAAA,IAAI,IAAA,CAAK,UAAU,CAAA,EAAG;AACpB,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,OAAO,CAAA,EAAG;AAC1B,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,MAAM,CAAA,EAAG;AACzB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,MAAM,CAAA,EAAG;AACzB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,MAAM,CAAA,EAAG;AACzB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,MAAM,CAAA,EAAG;AACzB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,MAAM,CAAA,EAAG;AACzB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,KAAK,CAAA,EAAG;AACxB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,KAAK,CAAA,EAAG;AACxB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,KAAK,CAAA,EAAG;AACxB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,KAAK,CAAA,EAAG;AACxB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,KAAK,CAAA,EAAG;AACxB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,IAAI,CAAA,EAAG;AACvB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,IAAI,CAAA,EAAG;AACvB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,IAAI,CAAA,EAAG;AACvB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,IAAI,CAAA,EAAG;AACvB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,IAAI,CAAA,EAAG;AACvB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,IAAI,CAAA,EAAG;AACvB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,SAAS,GAAG,CAAA,IAAK,CAAC,IAAA,CAAK,QAAA,CAAS,IAAI,CAAA,EAAG;AAC9C,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,OAAO,IAAA;AACT;AAGO,SAAS,iBAAA,CACd,aACA,UAAA,EACQ;AACR,EAAA,IAAI,WAAA,CAAY,MAAA,KAAW,CAAA,IAAK,UAAA,CAAW,WAAW,CAAA,EAAG;AACvD,IAAA,OAAO,CAAA;AAAA,EACT;AAEA,EAAA,MAAM,cAAc,IAAI,GAAA,CAAI,UAAA,CAAW,GAAA,CAAI,SAAS,CAAC,CAAA;AACrD,EAAA,IAAI,UAAA,GAAa,CAAA;AAEjB,EAAA,KAAA,MAAW,cAAc,WAAA,EAAa;AACpC,IAAA,MAAM,YAAA,GAAe,UAAU,UAAU,CAAA;AAEzC,IAAA,IAAI,WAAA,CAAY,GAAA,CAAI,YAAY,CAAA,EAAG;AACjC,MAAA,UAAA,IAAc,CAAA;AACd,MAAA;AAAA,IACF;AAEA,IAAA,KAAA,MAAW,aAAa,WAAA,EAAa;AACnC,MAAA,IACE,UAAU,UAAA,CAAW,YAAY,KACjC,YAAA,CAAa,UAAA,CAAW,SAAS,CAAA,EACjC;AACA,QAAA,UAAA,IAAc,GAAA;AACd,QAAA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,aAAa,WAAA,CAAY,MAAA;AAClC;AAMO,SAAS,eAAe,IAAA,EAA2B;AACxD,EAAA,MAAM,aAAa,IAAA,CAAK,WAAA,EAAY,CAAE,OAAA,CAAQ,wBAAwB,EAAE,CAAA;AACxE,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,UAAA,CAAW,MAAA,GAAS,GAAG,CAAA,EAAA,EAAK;AAC9C,IAAA,OAAA,CAAQ,IAAI,UAAA,CAAW,KAAA,CAAM,CAAA,EAAG,CAAA,GAAI,CAAC,CAAC,CAAA;AAAA,EACxC;AACA,EAAA,OAAO,OAAA;AACT;AAMO,SAAS,aAAa,IAAA,EAAwB;AACnD,EAAA,OAAO,IAAA,CACJ,WAAA,EAAY,CACZ,KAAA,CAAM,iBAAiB,CAAA,CACvB,MAAA,CAAO,CAAC,KAAA,KAAU,KAAA,CAAM,MAAA,GAAS,CAAC,CAAA;AACvC;AAGO,SAAS,iBAAA,CACd,MACA,IAAA,EACQ;AACR,EAAA,IAAI,IAAA,CAAK,IAAA,KAAS,CAAA,IAAK,IAAA,CAAK,SAAS,CAAA,EAAG;AACtC,IAAA,OAAO,CAAA;AAAA,EACT;AAEA,EAAA,IAAI,gBAAA,GAAmB,CAAA;AACvB,EAAA,MAAM,OAAA,GAAU,IAAA,CAAK,IAAA,IAAQ,IAAA,CAAK,OAAO,IAAA,GAAO,IAAA;AAChD,EAAA,MAAM,MAAA,GAAS,IAAA,CAAK,IAAA,IAAQ,IAAA,CAAK,OAAO,IAAA,GAAO,IAAA;AAE/C,EAAA,KAAA,MAAW,QAAQ,OAAA,EAAS;AAC1B,IAAA,IAAI,MAAA,CAAO,GAAA,CAAI,IAAI,CAAA,EAAG;AACpB,MAAA,gBAAA,EAAA;AAAA,IACF;AAAA,EACF;AAEA,EAAA,MAAM,SAAA,GAAY,IAAA,CAAK,IAAA,GAAO,IAAA,CAAK,IAAA,GAAO,gBAAA;AAC1C,EAAA,OAAO,SAAA,KAAc,CAAA,GAAI,CAAA,GAAI,gBAAA,GAAmB,SAAA;AAClD;AAGO,SAAS,gBAAA,CACd,YACA,SAAA,EACQ;AACR,EAAA,IAAI,SAAA,CAAU,WAAW,CAAA,EAAG;AAC1B,IAAA,OAAO,CAAA;AAAA,EACT;AACA,EAAA,IAAI,OAAA,GAAU,CAAA;AACd,EAAA,KAAA,MAAW,QAAQ,SAAA,EAAW;AAC5B,IAAA,IAAI,UAAA,CAAW,QAAA,CAAS,IAAI,CAAA,EAAG;AAC7B,MAAA,OAAA,EAAA;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,UAAU,SAAA,CAAU,MAAA;AAC7B;AAGO,SAAS,oBAAoB,KAAA,EAAqC;AACvE,EAAA,OAAO;AAAA,IACL,GAAA,EAAK,KAAA;AAAA,IACL,MAAA,EAAQ,mBAAmB,KAAK,CAAA;AAAA,IAChC,KAAA,EAAO,aAAa,KAAK,CAAA;AAAA,IACzB,OAAA,EAAS,eAAe,KAAK;AAAA,GAC/B;AACF;AAGO,SAAS,kBAAA,CACd,OACA,MAAA,EACQ;AACR,EAAA,MAAM,IAAA,GAAO,MAAA,CAAO,IAAA,EAAM,IAAA,EAAK;AAC/B,EAAA,IAAI,CAAC,IAAA,EAAM;AACT,IAAA,OAAO,CAAA;AAAA,EACT;AAEA,EAAA,QAAQ,MAAA,CAAO,YAAY,cAAA;AAAgB,IACzC,KAAK,eAAA;AACH,MAAA,OAAO,iBAAA,CAAkB,KAAA,CAAM,OAAA,EAAS,cAAA,CAAe,IAAI,CAAC,CAAA;AAAA,IAC9D,KAAK,aAAA;AACH,MAAA,OAAO,gBAAA,CAAiB,KAAA,CAAM,KAAA,EAAO,YAAA,CAAa,IAAI,CAAC,CAAA;AAAA,IACzD;AACE,MAAA,OAAO,iBAAA,CAAkB,KAAA,CAAM,MAAA,EAAQ,kBAAA,CAAmB,IAAI,CAAC,CAAA;AAAA;AAErE;AAGO,SAAS,mBAAA,CACd,OACA,OAAA,EACQ;AACR,EAAA,IAAI,aAAA,GAAgB,CAAA;AACpB,EAAA,IAAI,WAAA,GAAc,CAAA;AAElB,EAAA,KAAA,MAAW,UAAU,OAAA,EAAS;AAC5B,IAAA,IAAI,CAAC,MAAA,CAAO,IAAA,EAAM,MAAK,IAAK,MAAA,CAAO,UAAU,CAAA,EAAG;AAC9C,MAAA;AAAA,IACF;AACA,IAAA,aAAA,IAAiB,kBAAA,CAAmB,KAAA,EAAO,MAAM,CAAA,GAAI,MAAA,CAAO,MAAA;AAC5D,IAAA,WAAA,IAAe,MAAA,CAAO,MAAA;AAAA,EACxB;AAEA,EAAA,OAAO,WAAA,KAAgB,CAAA,GAAI,CAAA,GAAI,aAAA,GAAgB,WAAA;AACjD;AAGO,SAAS,eAAA,CAAgB,OAAe,KAAA,EAAuB;AACpE,EAAA,IAAI,SAAS,CAAA,EAAG;AACd,IAAA,OAAO,CAAA;AAAA,EACT;AACA,EAAA,MAAM,YAAA,GAAe,KAAK,GAAA,CAAI,CAAA,EAAG,KAAK,GAAA,CAAI,KAAA,EAAO,KAAA,GAAQ,CAAC,CAAC,CAAA;AAC3D,EAAA,OAAO,CAAA,GAAI,gBAAgB,KAAA,GAAQ,CAAA,CAAA;AACrC;AAGO,SAAS,mBAAA,CACd,KAAA,EACA,KAAA,EACA,OAAA,EACA,OAAA,EACK;AACL,EAAA,MAAM,aAAA,GAAgB,oBAAoB,KAAK,CAAA;AAC/C,EAAA,IAAI,cAAc,MAAA,CAAO,MAAA,KAAW,CAAA,IAAK,KAAA,CAAM,UAAU,CAAA,EAAG;AAC1D,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,MAAM,aAAA,GAAgB,SAAS,aAAA,IAAiB,IAAA;AAChD,EAAA,MAAM,UAAA,GAAa,SAAS,UAAA,IAAc,IAAA;AAE1C,EAAA,OAAO,KAAA,CACJ,GAAA,CAAI,CAAC,IAAA,EAAM,KAAA,KAAU;AACpB,IAAA,MAAM,YAAA,GAAe,oBAAoB,aAAA,EAAe;AAAA,MACtD,EAAE,MAAM,OAAA,CAAQ,IAAI,KAAK,EAAA,EAAI,MAAA,EAAQ,CAAA,EAAG,QAAA,EAAU,cAAA;AAAe,KAClE,CAAA;AACD,IAAA,MAAM,SAAA,GAAY,eAAA,CAAgB,KAAA,EAAO,KAAA,CAAM,MAAM,CAAA;AAErD,IAAA,OAAO;AAAA,MACL,IAAA;AAAA,MACA,aAAA,EAAe,YAAA,GAAe,aAAA,GAAgB,SAAA,GAAY;AAAA,KAC5D;AAAA,EACF,CAAC,CAAA,CACA,IAAA,CAAK,CAAC,IAAA,EAAM,UAAU,KAAA,CAAM,aAAA,GAAgB,IAAA,CAAK,aAAa,EAC9D,GAAA,CAAI,CAAC,EAAE,IAAA,OAAW,IAAI,CAAA;AAC3B","file":"text-matching.contract.js","sourcesContent":["/**\n * Shared lexical matching primitives used across MCP handlers and graph utilities.\n *\n * The goal is not to replace downstream LLM scoring. It provides a fast,\n * deterministic substrate for candidate generation, reranking, and light\n * classification across belief/question/evidence/entity surfaces.\n */\n\nexport type LexicalStrategy = \"tokenOverlap\" | \"bigramJaccard\" | \"wordOverlap\";\n\nexport type PreparedLexicalQuery = {\n  raw: string;\n  tokens: string[];\n  words: string[];\n  bigrams: Set<string>;\n};\n\nexport type LexicalSignal = {\n  strategy?: LexicalStrategy;\n  text: string | null | undefined;\n  weight: number;\n};\n\nexport type LexicalRerankOptions = {\n  lexicalWeight?: number;\n  rankWeight?: number;\n};\n\nconst TOKEN_SPLIT_REGEX = /[^a-z0-9]+/;\nconst NON_ALPHANUMERIC_REGEX = /[^a-z0-9]/g;\n\n/** Stop words that add noise to scoring. */\nconst STOP_WORDS = new Set([\n  \"the\",\n  \"a\",\n  \"an\",\n  \"and\",\n  \"or\",\n  \"but\",\n  \"in\",\n  \"on\",\n  \"at\",\n  \"to\",\n  \"for\",\n  \"of\",\n  \"with\",\n  \"by\",\n  \"from\",\n  \"is\",\n  \"it\",\n  \"as\",\n  \"be\",\n  \"was\",\n  \"are\",\n  \"this\",\n  \"that\",\n  \"has\",\n  \"had\",\n  \"have\",\n  \"not\",\n  \"all\",\n  \"can\",\n  \"do\",\n  \"its\",\n  \"may\",\n  \"will\",\n  \"how\",\n  \"what\",\n  \"which\",\n  \"who\",\n  \"when\",\n  \"where\",\n  \"than\",\n  \"then\",\n  \"each\",\n  \"into\",\n  \"such\",\n  \"any\",\n  \"been\",\n  \"if\",\n  \"would\",\n  \"about\",\n  \"should\",\n  \"these\",\n  \"those\",\n  \"their\",\n  \"we\",\n  \"our\",\n  \"so\",\n]);\n\n/** Tokenize a string into lowercase words, removing stop words. */\nexport function tokenizeSearchText(text: string): string[] {\n  return text\n    .toLowerCase()\n    .split(TOKEN_SPLIT_REGEX)\n    .filter((token) => token.length >= 2 && !STOP_WORDS.has(token));\n}\n\n/** Simple stemmer: strip common English suffixes for fuzzy matching. */\nexport function stemToken(word: string): string {\n  if (word.length <= 4) {\n    return word;\n  }\n  if (word.endsWith(\"ation\")) {\n    return word.slice(0, -5);\n  }\n  if (word.endsWith(\"ment\")) {\n    return word.slice(0, -4);\n  }\n  if (word.endsWith(\"ness\")) {\n    return word.slice(0, -4);\n  }\n  if (word.endsWith(\"ical\")) {\n    return word.slice(0, -4);\n  }\n  if (word.endsWith(\"tion\")) {\n    return word.slice(0, -4);\n  }\n  if (word.endsWith(\"sion\")) {\n    return word.slice(0, -4);\n  }\n  if (word.endsWith(\"ing\")) {\n    return word.slice(0, -3);\n  }\n  if (word.endsWith(\"ous\")) {\n    return word.slice(0, -3);\n  }\n  if (word.endsWith(\"ive\")) {\n    return word.slice(0, -3);\n  }\n  if (word.endsWith(\"ity\")) {\n    return word.slice(0, -3);\n  }\n  if (word.endsWith(\"ics\")) {\n    return word.slice(0, -3);\n  }\n  if (word.endsWith(\"ly\")) {\n    return word.slice(0, -2);\n  }\n  if (word.endsWith(\"ed\")) {\n    return word.slice(0, -2);\n  }\n  if (word.endsWith(\"er\")) {\n    return word.slice(0, -2);\n  }\n  if (word.endsWith(\"es\")) {\n    return word.slice(0, -2);\n  }\n  if (word.endsWith(\"al\")) {\n    return word.slice(0, -2);\n  }\n  if (word.endsWith(\"ic\")) {\n    return word.slice(0, -2);\n  }\n  if (word.endsWith(\"s\") && !word.endsWith(\"ss\")) {\n    return word.slice(0, -1);\n  }\n  return word;\n}\n\n/** Compute token overlap score between query tokens and text tokens. */\nexport function tokenOverlapScore(\n  queryTokens: string[],\n  textTokens: string[]\n): number {\n  if (queryTokens.length === 0 || textTokens.length === 0) {\n    return 0;\n  }\n\n  const stemmedText = new Set(textTokens.map(stemToken));\n  let matchCount = 0;\n\n  for (const queryToken of queryTokens) {\n    const stemmedQuery = stemToken(queryToken);\n\n    if (stemmedText.has(stemmedQuery)) {\n      matchCount += 1;\n      continue;\n    }\n\n    for (const textToken of stemmedText) {\n      if (\n        textToken.startsWith(stemmedQuery) ||\n        stemmedQuery.startsWith(textToken)\n      ) {\n        matchCount += 0.5;\n        break;\n      }\n    }\n  }\n\n  return matchCount / queryTokens.length;\n}\n\n/**\n * Extract character bigrams from text. Normalizes to lowercase, removes\n * non-alphanumeric characters, and generates overlapping pairs.\n */\nexport function bigramTokenize(text: string): Set<string> {\n  const normalized = text.toLowerCase().replace(NON_ALPHANUMERIC_REGEX, \"\");\n  const bigrams = new Set<string>();\n  for (let i = 0; i < normalized.length - 1; i++) {\n    bigrams.add(normalized.slice(i, i + 2));\n  }\n  return bigrams;\n}\n\n/**\n * Extract word-level tokens from text (for coarser matching).\n * Normalizes to lowercase, splits on non-alphanumeric.\n */\nexport function wordTokenize(text: string): string[] {\n  return text\n    .toLowerCase()\n    .split(TOKEN_SPLIT_REGEX)\n    .filter((token) => token.length > 1);\n}\n\n/** Jaccard similarity between two sets: |A ∩ B| / |A ∪ B|. */\nexport function jaccardSimilarity(\n  setA: Set<string>,\n  setB: Set<string>\n): number {\n  if (setA.size === 0 && setB.size === 0) {\n    return 0;\n  }\n\n  let intersectionSize = 0;\n  const smaller = setA.size <= setB.size ? setA : setB;\n  const larger = setA.size <= setB.size ? setB : setA;\n\n  for (const item of smaller) {\n    if (larger.has(item)) {\n      intersectionSize++;\n    }\n  }\n\n  const unionSize = setA.size + setB.size - intersectionSize;\n  return unionSize === 0 ? 0 : intersectionSize / unionSize;\n}\n\n/** Exact word overlap score: fraction of type words found in input text. */\nexport function wordOverlapScore(\n  inputWords: string[],\n  typeWords: string[]\n): number {\n  if (typeWords.length === 0) {\n    return 0;\n  }\n  let matches = 0;\n  for (const word of typeWords) {\n    if (inputWords.includes(word)) {\n      matches++;\n    }\n  }\n  return matches / typeWords.length;\n}\n\n/** Pre-compute reusable lexical structures for a query. */\nexport function prepareLexicalQuery(query: string): PreparedLexicalQuery {\n  return {\n    raw: query,\n    tokens: tokenizeSearchText(query),\n    words: wordTokenize(query),\n    bigrams: bigramTokenize(query),\n  };\n}\n\n/** Score a single lexical signal against a prepared query. */\nexport function scoreLexicalSignal(\n  query: PreparedLexicalQuery,\n  signal: LexicalSignal\n): number {\n  const text = signal.text?.trim();\n  if (!text) {\n    return 0;\n  }\n\n  switch (signal.strategy ?? \"tokenOverlap\") {\n    case \"bigramJaccard\":\n      return jaccardSimilarity(query.bigrams, bigramTokenize(text));\n    case \"wordOverlap\":\n      return wordOverlapScore(query.words, wordTokenize(text));\n    default:\n      return tokenOverlapScore(query.tokens, tokenizeSearchText(text));\n  }\n}\n\n/** Weighted lexical score across multiple textual signals. */\nexport function scoreLexicalSignals(\n  query: PreparedLexicalQuery,\n  signals: LexicalSignal[]\n): number {\n  let weightedScore = 0;\n  let totalWeight = 0;\n\n  for (const signal of signals) {\n    if (!signal.text?.trim() || signal.weight <= 0) {\n      continue;\n    }\n    weightedScore += scoreLexicalSignal(query, signal) * signal.weight;\n    totalWeight += signal.weight;\n  }\n\n  return totalWeight === 0 ? 0 : weightedScore / totalWeight;\n}\n\n/** Map a candidate's original rank position into a 0..1 prior. */\nexport function rankWindowScore(index: number, total: number): number {\n  if (total <= 1) {\n    return 1;\n  }\n  const clampedIndex = Math.max(0, Math.min(index, total - 1));\n  return 1 - clampedIndex / (total - 1);\n}\n\n/** Rerank a candidate window by lexical overlap while preserving original-rank prior. */\nexport function rerankLexicalWindow<T>(\n  query: string,\n  items: T[],\n  getText: (item: T) => string | null | undefined,\n  options?: LexicalRerankOptions\n): T[] {\n  const preparedQuery = prepareLexicalQuery(query);\n  if (preparedQuery.tokens.length === 0 || items.length <= 1) {\n    return items;\n  }\n\n  const lexicalWeight = options?.lexicalWeight ?? 0.65;\n  const rankWeight = options?.rankWeight ?? 0.35;\n\n  return items\n    .map((item, index) => {\n      const lexicalScore = scoreLexicalSignals(preparedQuery, [\n        { text: getText(item) ?? \"\", weight: 1, strategy: \"tokenOverlap\" },\n      ]);\n      const rankScore = rankWindowScore(index, items.length);\n\n      return {\n        item,\n        combinedScore: lexicalScore * lexicalWeight + rankScore * rankWeight,\n      };\n    })\n    .sort((left, right) => right.combinedScore - left.combinedScore)\n    .map(({ item }) => item);\n}\n"]}

package/dist/topic-scope.contract.d.ts

@@ -0,0 +1 @@
+export { ROOT_TOPIC_ID, TopicDoc, collectTopicNeighborhood } from './v1/topics/v1.js';

package/{src/v1/topics/v1.ts → dist/topic-scope.contract.js}

@@ -1,31 +1,8 @@
-/**
- * @lucern/contracts — TopicsV1 namespace (resource contracts)
- *
- * Moved from src/topic-scope.contract.ts in EK-16 T1 PR 2.
- * Compat shim remains at the old path until the Lucern 1.0.0 cut.
- */
-
-export const ROOT_TOPIC_ID = "n17tm38rwet7wqgzrmwahyt1z582590y";
-
-export type TopicDoc = {
-  _id: string;
-  name?: string;
-  parentTopicId?: string;
-  depth?: number;
-  type?: string;
-};
-
-/**
- * BFS traversal collecting a topic and its neighborhood:
- * ancestors up to root + descendants down to maxDescendantDepth.
- */
-export function collectTopicNeighborhood(
-  topics: TopicDoc[],
-  rootTopicId: string,
-  maxDescendantDepth = 2
-): string[] {
-  const byId = new Map<string, TopicDoc>();
-  const children = new Map<string, string[]>();
+// src/v1/topics/v1.ts
+var ROOT_TOPIC_ID = "n17tm38rwet7wqgzrmwahyt1z582590y";
+function collectTopicNeighborhood(topics, rootTopicId, maxDescendantDepth = 2) {
+  const byId = /* @__PURE__ */ new Map();
+  const children = /* @__PURE__ */ new Map();
   for (const topic of topics) {
     const id = String(topic._id);
     byId.set(id, topic);
@@ -43,11 +20,8 @@ export function collectTopicNeighborhood(
     list.push(id);
     children.set(parent, list);
   }
-
-  const selected = new Set<string>();
+  const selected = /* @__PURE__ */ new Set();
   selected.add(rootTopicId);
-
-  // Ancestors
   let cursor = byId.get(rootTopicId);
   while (cursor?.parentTopicId) {
     const parentId = String(cursor.parentTopicId);
@@ -57,13 +31,11 @@ export function collectTopicNeighborhood(
     selected.add(parentId);
     cursor = byId.get(parentId);
   }
-
-  // Descendants
-  const queue: Array<{ id: string; depth: number }> = [
-    { id: rootTopicId, depth: 0 },
+  const queue = [
+    { id: rootTopicId, depth: 0 }
   ];
   while (queue.length > 0) {
-    const current = queue.shift()!;
+    const current = queue.shift();
     if (current.depth >= maxDescendantDepth) {
       continue;
     }
@@ -74,6 +46,9 @@ export function collectTopicNeighborhood(
       queue.push({ id: childId, depth: current.depth + 1 });
     }
   }
-
   return Array.from(selected);
 }
+
+export { ROOT_TOPIC_ID, collectTopicNeighborhood };
+//# sourceMappingURL=topic-scope.contract.js.map
+//# sourceMappingURL=topic-scope.contract.js.map

package/dist/topic-scope.contract.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/v1/topics/v1.ts"],"names":[],"mappings":";AAOO,IAAM,aAAA,GAAgB;AActB,SAAS,wBAAA,CACd,MAAA,EACA,WAAA,EACA,kBAAA,GAAqB,CAAA,EACX;AACV,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAsB;AACvC,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAsB;AAC3C,EAAA,KAAA,MAAW,SAAS,MAAA,EAAQ;AAC1B,IAAA,MAAM,EAAA,GAAK,MAAA,CAAO,KAAA,CAAM,GAAG,CAAA;AAC3B,IAAA,IAAA,CAAK,GAAA,CAAI,IAAI,KAAK,CAAA;AAClB,IAAA,IAAI,CAAC,QAAA,CAAS,GAAA,CAAI,EAAE,CAAA,EAAG;AACrB,MAAA,QAAA,CAAS,GAAA,CAAI,EAAA,EAAI,EAAE,CAAA;AAAA,IACrB;AAAA,EACF;AACA,EAAA,KAAA,MAAW,SAAS,MAAA,EAAQ;AAC1B,IAAA,IAAI,CAAC,MAAM,aAAA,EAAe;AACxB,MAAA;AAAA,IACF;AACA,IAAA,MAAM,MAAA,GAAS,MAAA,CAAO,KAAA,CAAM,aAAa,CAAA;AACzC,IAAA,MAAM,EAAA,GAAK,MAAA,CAAO,KAAA,CAAM,GAAG,CAAA;AAC3B,IAAA,MAAM,IAAA,GAAO,QAAA,CAAS,GAAA,CAAI,MAAM,KAAK,EAAC;AACtC,IAAA,IAAA,CAAK,KAAK,EAAE,CAAA;AACZ,IAAA,QAAA,CAAS,GAAA,CAAI,QAAQ,IAAI,CAAA;AAAA,EAC3B;AAEA,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAY;AACjC,EAAA,QAAA,CAAS,IAAI,WAAW,CAAA;AAGxB,EAAA,IAAI,MAAA,GAAS,IAAA,CAAK,GAAA,CAAI,WAAW,CAAA;AACjC,EAAA,OAAO,QAAQ,aAAA,EAAe;AAC5B,IAAA,MAAM,QAAA,GAAW,MAAA,CAAO,MAAA,CAAO,aAAa,CAAA;AAC5C,IAAA,IAAI,QAAA,CAAS,GAAA,CAAI,QAAQ,CAAA,EAAG;AAC1B,MAAA;AAAA,IACF;AACA,IAAA,QAAA,CAAS,IAAI,QAAQ,CAAA;AACrB,IAAA,MAAA,GAAS,IAAA,CAAK,IAAI,QAAQ,CAAA;AAAA,EAC5B;AAGA,EAAA,MAAM,KAAA,GAA8C;AAAA,IAClD,EAAE,EAAA,EAAI,WAAA,EAAa,KAAA,EAAO,CAAA;AAAE,GAC9B;AACA,EAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,IAAA,MAAM,OAAA,GAAU,MAAM,KAAA,EAAM;AAC5B,IAAA,IAAI,OAAA,CAAQ,SAAS,kBAAA,EAAoB;AACvC,MAAA;AAAA,IACF;AACA,IAAA,KAAA,MAAW,WAAW,QAAA,CAAS,GAAA,CAAI,QAAQ,EAAE,CAAA,IAAK,EAAC,EAAG;AACpD,MAAA,IAAI,CAAC,QAAA,CAAS,GAAA,CAAI,OAAO,CAAA,EAAG;AAC1B,QAAA,QAAA,CAAS,IAAI,OAAO,CAAA;AAAA,MACtB;AACA,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,EAAA,EAAI,OAAA,EAAS,OAAO,OAAA,CAAQ,KAAA,GAAQ,GAAG,CAAA;AAAA,IACtD;AAAA,EACF;AAEA,EAAA,OAAO,KAAA,CAAM,KAAK,QAAQ,CAAA;AAC5B","file":"topic-scope.contract.js","sourcesContent":["/**\n * @lucern/contracts — TopicsV1 namespace (resource contracts)\n *\n * Moved from src/topic-scope.contract.ts in EK-16 T1 PR 2.\n * Compat shim remains at the old path until the Lucern 1.0.0 cut.\n */\n\nexport const ROOT_TOPIC_ID = \"n17tm38rwet7wqgzrmwahyt1z582590y\";\n\nexport type TopicDoc = {\n  _id: string;\n  name?: string;\n  parentTopicId?: string;\n  depth?: number;\n  type?: string;\n};\n\n/**\n * BFS traversal collecting a topic and its neighborhood:\n * ancestors up to root + descendants down to maxDescendantDepth.\n */\nexport function collectTopicNeighborhood(\n  topics: TopicDoc[],\n  rootTopicId: string,\n  maxDescendantDepth = 2\n): string[] {\n  const byId = new Map<string, TopicDoc>();\n  const children = new Map<string, string[]>();\n  for (const topic of topics) {\n    const id = String(topic._id);\n    byId.set(id, topic);\n    if (!children.has(id)) {\n      children.set(id, []);\n    }\n  }\n  for (const topic of topics) {\n    if (!topic.parentTopicId) {\n      continue;\n    }\n    const parent = String(topic.parentTopicId);\n    const id = String(topic._id);\n    const list = children.get(parent) || [];\n    list.push(id);\n    children.set(parent, list);\n  }\n\n  const selected = new Set<string>();\n  selected.add(rootTopicId);\n\n  // Ancestors\n  let cursor = byId.get(rootTopicId);\n  while (cursor?.parentTopicId) {\n    const parentId = String(cursor.parentTopicId);\n    if (selected.has(parentId)) {\n      break;\n    }\n    selected.add(parentId);\n    cursor = byId.get(parentId);\n  }\n\n  // Descendants\n  const queue: Array<{ id: string; depth: number }> = [\n    { id: rootTopicId, depth: 0 },\n  ];\n  while (queue.length > 0) {\n    const current = queue.shift()!;\n    if (current.depth >= maxDescendantDepth) {\n      continue;\n    }\n    for (const childId of children.get(current.id) || []) {\n      if (!selected.has(childId)) {\n        selected.add(childId);\n      }\n      queue.push({ id: childId, depth: current.depth + 1 });\n    }\n  }\n\n  return Array.from(selected);\n}\n"]}

package/dist/topics/v1.d.ts

@@ -0,0 +1,2 @@
+
+export {  }

package/dist/topics/v1.js

@@ -0,0 +1,3 @@
+
+//# sourceMappingURL=v1.js.map
+//# sourceMappingURL=v1.js.map

package/dist/topics/v1.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"names":[],"mappings":"","file":"v1.js"}

package/dist/v1/agents/v1.d.ts

@@ -0,0 +1,2 @@
+
+export {  }

package/dist/v1/agents/v1.js

@@ -0,0 +1,3 @@
+
+//# sourceMappingURL=v1.js.map
+//# sourceMappingURL=v1.js.map

package/dist/v1/agents/v1.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"names":[],"mappings":"","file":"v1.js"}

package/dist/v1/beliefs/v1.d.ts

@@ -0,0 +1,2 @@
+
+export {  }

package/dist/v1/beliefs/v1.js

@@ -0,0 +1,3 @@
+
+//# sourceMappingURL=v1.js.map
+//# sourceMappingURL=v1.js.map

package/dist/v1/beliefs/v1.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"names":[],"mappings":"","file":"v1.js"}

package/dist/v1/evidence/v1.d.ts

@@ -0,0 +1,2 @@
+
+export {  }

package/dist/v1/evidence/v1.js

@@ -0,0 +1,3 @@
+
+//# sourceMappingURL=v1.js.map
+//# sourceMappingURL=v1.js.map

package/dist/v1/evidence/v1.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"names":[],"mappings":"","file":"v1.js"}

package/dist/v1/graph/v1.d.ts

@@ -0,0 +1,2 @@
+
+export {  }

package/dist/v1/graph/v1.js

@@ -0,0 +1,3 @@
+
+//# sourceMappingURL=v1.js.map
+//# sourceMappingURL=v1.js.map

package/dist/v1/graph/v1.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"names":[],"mappings":"","file":"v1.js"}

package/dist/v1/ontologies/v1.d.ts

@@ -0,0 +1,78 @@
+/**
+ * @lucern/contracts — OntologiesV1 namespace (resource contracts)
+ *
+ * Ontology Matching Engine — L0 entity type classification and similarity scoring.
+ * Provides bigram-based text similarity for matching free text against
+ * ontology entity types. Domain-agnostic: works identically for companies,
+ * molecules, code modules, or any tenant-defined entity vocabulary.
+ *
+ * Moved from src/ontology-matching.contract.ts in EK-16 T1 PR 2.
+ * Compat shim remains at the old path until the Lucern 1.0.0 cut.
+ */
+/** An entity type definition from a resolved ontology version. */
+type OntologyEntityType = {
+    value: string;
+    label: string;
+    description?: string;
+    subtypes?: Array<{
+        value: string;
+        label: string;
+        description?: string;
+    }>;
+};
+/** A scored match between input text and an entity type. */
+type EntityTypeMatch = {
+    entityType: string;
+    label: string;
+    score: number;
+    reason: string;
+};
+/** A candidate entity node that can be matched against a target node. */
+type EntityMatchCandidate = {
+    nodeId: string;
+    entityType: string;
+    title: string;
+    canonicalText: string;
+    connectedBeliefCount: number;
+    connectedEvidenceCount: number;
+};
+/** A scored entity match with suggested bridge edge type. */
+type EntityConnectionMatch = {
+    entityNodeId: string;
+    entityType: string;
+    title: string;
+    score: number;
+    suggestedEdgeType: string;
+    reason: string;
+};
+/**
+ * Score how well input text matches a single entity type definition.
+ * Combines bigram Jaccard similarity, word overlap, and description matching.
+ */
+declare function scoreEntityTypeMatch(inputText: string, entityType: OntologyEntityType): EntityTypeMatch;
+/**
+ * Rank all entity types in an ontology against input text.
+ * Returns matches sorted by score (descending), filtered to score > minScore.
+ */
+declare function rankEntityTypeMatches(inputText: string, entityTypes: OntologyEntityType[], options?: {
+    minScore?: number;
+    limit?: number;
+}): EntityTypeMatch[];
+/**
+ * Score how well a node's text matches an entity candidate.
+ * Used by discover_entity_connections to suggest missing bridge edges.
+ */
+declare function scoreEntityConnection(nodeText: string, candidate: EntityMatchCandidate, options?: {
+    connectivityWeight?: number;
+}): EntityConnectionMatch;
+/**
+ * Rank entity candidates against a node's text.
+ * Returns sorted matches above the minimum score threshold.
+ */
+declare function rankEntityConnections(nodeText: string, candidates: EntityMatchCandidate[], options?: {
+    minScore?: number;
+    limit?: number;
+    connectivityWeight?: number;
+}): EntityConnectionMatch[];
+
+export { type EntityConnectionMatch, type EntityMatchCandidate, type EntityTypeMatch, type OntologyEntityType, rankEntityConnections, rankEntityTypeMatches, scoreEntityConnection, scoreEntityTypeMatch };