@shrkcrft/knowledge 0.1.0-alpha.18 → 0.1.0-alpha.19

package/dist/index/relevance-score.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"relevance-score.d.ts","sourceRoot":"","sources":["../../src/index/relevance-score.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AACnE,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AACnE,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,qCAAqC,CAAC;AAGjF,MAAM,WAAW,WAAW;IAC1B,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,qBAAqB,EAAE,CAAC;CAClC;AAYD,wBAAgB,UAAU,CAAC,KAAK,EAAE,eAAe,EAAE,KAAK,EAAE,eAAe,GAAG,WAAW,CAiFtF"}
+{"version":3,"file":"relevance-score.d.ts","sourceRoot":"","sources":["../../src/index/relevance-score.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AACnE,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AACnE,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,qCAAqC,CAAC;AAGjF,MAAM,WAAW,WAAW;IAC1B,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,qBAAqB,EAAE,CAAC;CAClC;AAYD,wBAAgB,UAAU,CAAC,KAAK,EAAE,eAAe,EAAE,KAAK,EAAE,eAAe,GAAG,WAAW,CAmHtF"}

package/dist/index/relevance-score.js

@@ -11,8 +11,18 @@ const FIELD_WEIGHTS = {
 export function scoreEntry(entry, query) {
     let score = 0;
     const reasons = [];
-    // Priority baseline always contributes (so a critical rule outranks a low-priority match).
-    score += priorityWeight(entry.priority) / 10;
+    // Priority baseline always contributes so that — once an entry has *any*
+    // match reason — a foundational critical rule (e.g. architecture.layer-order)
+    // outranks a non-critical entry that merely shares a keyword. The old
+    // `/ 10` shrank Critical (weight 100) to a baseline of 10, an order of
+    // magnitude below a single lexical hit (id 80, title 50, appliesWhen 40), so
+    // critical rules were reliably buried. Use the full priority weight: Critical
+    // 100, High 70, Medium 40, Low 10 — on par with a strong lexical hit, while
+    // a *strong* multi-field lexical match (which sums well past 100) still wins.
+    // This does not surface no-reason entries: the index drops score>0 results
+    // with empty reasons, so an irrelevant critical rule never leaks in on
+    // priority alone.
+    score += priorityWeight(entry.priority);
     // Type filter is a hard match — only score the rest if type matches when types specified.
     const queryText = (query.query ?? '').trim().toLowerCase();
     const queryWords = queryText
@@ -25,13 +35,39 @@ export function scoreEntry(entry, query) {
             score += FIELD_WEIGHTS.id;
             reasons.push({ field: 'id', match: queryText });
         }
-        if (entry.title.toLowerCase().includes(queryText)) {
+        // Title / summary: an exact full-phrase hit earns the full weight; otherwise
+        // credit by the SHARE of query words present. Matching per-word — not only
+        // the whole query string — lets a semantically relevant title (e.g.
+        // "Catalog i18n overlay" for "localize product catalog translations
+        // currency") outscore an entry that merely shares one incidental tag. The
+        // old full-phrase-only check earned title/summary zero on every multi-word
+        // query, so a single off-topic tag hit could win.
+        const wordCount = Math.max(1, queryWords.length);
+        const titleLc = entry.title.toLowerCase();
+        if (titleLc.includes(queryText)) {
             score += FIELD_WEIGHTS.title;
             reasons.push({ field: 'title', match: queryText });
         }
-        if (entry.summary?.toLowerCase().includes(queryText)) {
-            score += FIELD_WEIGHTS.summary;
-            reasons.push({ field: 'summary', match: queryText });
+        else {
+            const hits = queryWords.filter((w) => titleLc.includes(w));
+            if (hits.length > 0) {
+                score += FIELD_WEIGHTS.title * (hits.length / wordCount);
+                reasons.push({ field: 'title', match: hits.join(' ') });
+            }
+        }
+        const summaryLc = entry.summary?.toLowerCase() ?? '';
+        if (summaryLc.length > 0) {
+            if (summaryLc.includes(queryText)) {
+                score += FIELD_WEIGHTS.summary;
+                reasons.push({ field: 'summary', match: queryText });
+            }
+            else {
+                const hits = queryWords.filter((w) => summaryLc.includes(w));
+                if (hits.length > 0) {
+                    score += FIELD_WEIGHTS.summary * (hits.length / wordCount);
+                    reasons.push({ field: 'summary', match: hits.join(' ') });
+                }
+            }
         }
         if (entry.content.toLowerCase().includes(queryText)) {
             score += FIELD_WEIGHTS.content;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@shrkcrft/knowledge",
-  "version": "0.1.0-alpha.18",
+  "version": "0.1.0-alpha.19",
   "description": "SharkCraft structured knowledge model: typed entries, index, search, loaders (TS + markdown), validation.",
   "license": "MIT",
   "author": "SharkCraft contributors",
@@ -44,7 +44,7 @@
     "typecheck": "tsc --noEmit -p tsconfig.json"
   },
   "dependencies": {
-    "@shrkcrft/core": "^0.1.0-alpha.18"
+    "@shrkcrft/core": "^0.1.0-alpha.19"
   },
   "publishConfig": {
     "access": "public"