claude-mem-lite 2.49.0 → 2.50.0

package/.claude-plugin/marketplace.json

@@ -10,7 +10,7 @@
   "plugins": [
     {
       "name": "claude-mem-lite",
-      "version": "2.49.0",
+      "version": "2.50.0",
       "source": "./",
       "description": "Lightweight persistent memory system for Claude Code — FTS5 search, episode batching, error-triggered recall"
     }

package/.claude-plugin/plugin.json

@@ -1,6 +1,6 @@
 {
   "name": "claude-mem-lite",
-  "version": "2.49.0",
+  "version": "2.50.0",
   "description": "Lightweight persistent memory system for Claude Code — FTS5 search, episode batching, error-triggered recall",
   "author": {
     "name": "sdsrss"

package/hook-llm.mjs

@@ -7,7 +7,7 @@ import {
   jaccardSimilarity, truncate, clampImportance, computeRuleImportance,
   inferProject, parseJsonFromLLM,
   computeMinHash, estimateJaccardFromMinHash, cjkBigrams, EDIT_TOOLS, LOW_SIGNAL_TITLE, debugCatch, debugLog, OBS_BM25,
-  getCurrentBranch,
+  getCurrentBranch, notLowSignalTitleClause,
 } from './utils.mjs';
 import { acquireLLMSlot, releaseLLMSlot } from './hook-semaphore.mjs';
 import { getVocabulary, computeVector } from './tfidf.mjs';
@@ -802,10 +802,14 @@ export async function handleLLMSummary() {
     const sessionId = process.argv[3] || getSessionId();
     const project = process.argv[4] || inferProject();
 
+    // Exclude LOW_SIGNAL hook-llm fallback titles ("Error: files +2 more: ...",
+    // "Modified X", "Worked on X", etc.) from the Haiku summary input — they
+    // pollute the `completed` field and mislead session-resume context.
     const recentObs = db.prepare(`
       SELECT id, type, title, narrative
       FROM observations
       WHERE memory_session_id = ?
+        AND ${notLowSignalTitleClause('')}
       ORDER BY created_at_epoch DESC
       LIMIT 30
     `).all(sessionId);

package/mem-cli.mjs

@@ -5,6 +5,7 @@
 import { homedir } from 'os';
 import { ensureDb, DB_PATH, REGISTRY_DB_PATH } from './schema.mjs';
 import { sanitizeFtsQuery, relaxFtsQueryToOr, truncate, typeIcon, inferProject, jaccardSimilarity, computeMinHash, estimateJaccardFromMinHash, scrubSecrets, cjkBigrams, isoWeekKey, COMPRESSED_PENDING_PURGE, OBS_BM25, SESS_BM25, TYPE_DECAY_CASE, TYPE_QUALITY_CASE, DEFAULT_DECAY_HALF_LIFE_MS, getCurrentBranch, notLowSignalTitleClause, LOW_SIGNAL_TITLE } from './utils.mjs';
+import { cjkPrecisionOk } from './nlp.mjs';
 import { extractCjkLikePatterns } from './nlp.mjs';
 import { resolveProject } from './project-utils.mjs';
 import { computeTier, TIER_CASE_SQL, tierSqlParams } from './tier.mjs';
@@ -240,9 +241,14 @@ function cmdSearch(db, args) {
         ORDER BY score
         LIMIT ? OFFSET ?
       `).all(...promptParams);
-      for (const r of promptRows) results.push({ ...r, _source: 'prompt' });
+      // CJK precision filter (read-path parity with server.mjs): unicode61
+      // degrades bigram queries to single-char AND, letting common-char
+      // Chinese prose leak through. Drop rows that miss < 20% of query
+      // bigrams/keywords as contiguous substrings.
+      const keptPromptRows = promptRows.filter(r => cjkPrecisionOk(query, r.prompt_text));
+      for (const r of keptPromptRows) results.push({ ...r, _source: 'prompt' });
       // CJK LIKE fallback: FTS5 unicode61 can't tokenize CJK substrings in prompts
-      if (promptRows.length === 0) {
+      if (keptPromptRows.length === 0) {
         const cjkPatterns = extractCjkLikePatterns(query);
         if (cjkPatterns.length > 0) {
           const likeConds = cjkPatterns.map(() => 'p.prompt_text LIKE ?');
@@ -263,7 +269,12 @@ function cmdSearch(db, args) {
             ORDER BY p.created_at_epoch DESC
             LIMIT ? OFFSET ?
           `).all(...likeParams);
-          for (const r of fallbackRows) results.push({ ...r, _source: 'prompt', score: 0 });
+          // CJK precision filter applies here too: the LIKE fallback is just
+          // OR'd substring bigrams; without the precision gate it re-admits
+          // the same common-char noise the FTS path dropped (this was the
+          // actual leak source — FTS returned 0, fallback filled 20).
+          const keptFallback = fallbackRows.filter(r => cjkPrecisionOk(query, r.prompt_text));
+          for (const r of keptFallback) results.push({ ...r, _source: 'prompt', score: 0 });
         }
       }
     } catch { /* prompt FTS may not exist in older DBs */ }
@@ -450,8 +461,13 @@ function searchFts(db, ftsQuery, { type, project, limit, dateFrom, dateTo, minIm
 
 function cmdRecent(db, args) {
   const { positional, flags } = parseArgs(args);
-  const rawLimit = parseInt(positional[0], 10);
-  const limit = (Number.isInteger(rawLimit) && rawLimit > 0) ? rawLimit : 10;
+  const rawArg = positional[0];
+  const rawLimit = parseInt(rawArg, 10);
+  const isValid = Number.isInteger(rawLimit) && rawLimit > 0;
+  if (rawArg !== undefined && !isValid) {
+    process.stderr.write(`[mem] Invalid count "${rawArg}" (must be a positive integer); using default 10\n`);
+  }
+  const limit = isValid ? rawLimit : 10;
   const project = flags.project ? resolveProject(db, flags.project) : inferProject();
 
   const params = [];

package/nlp.mjs

@@ -124,6 +124,58 @@ export function extractCjkLikePatterns(query) {
   return [...new Set([...keywords, ...bigrams])];
 }
 
+/**
+ * Post-FTS precision filter for CJK queries.
+ *
+ * Background: FTS5 unicode61 tokenizer splits every CJK character into its
+ * own token. An application-layer bigram query like "我是" then reduces to
+ * (我 AND 是) at match time — matching any document that happens to contain
+ * both chars anywhere, which is extremely permissive in Chinese prose.
+ *
+ * Precision check: given the raw query and a candidate result's full text,
+ * require that at least `threshold` fraction of the query's CJK bigrams
+ * (or dictionary words, if any matched) appear as contiguous substrings in
+ * the result. Non-CJK queries bypass this filter entirely.
+ *
+ * Applied only to the prompts/user-prompt path — observations have richer
+ * rerank + low-signal filtering that already control noise there. Also,
+ * obs-side synonym expansion ("查询"→"(查询 OR query OR search)") is a
+ * legitimate recall mechanism that this filter would break.
+ *
+ * Threshold default 0.2 is tunable via `CLAUDE_MEM_CJK_PREC_MIN` env var.
+ * Explicit threshold arg still overrides the env value — tests and in-code
+ * callers with domain context stay authoritative.
+ *
+ * Default was tuned from 0.3 → 0.2 after a 20-query production-DB fixture
+ * showed 0.3 over-rejected legitimate multi-bigram queries whose dict-
+ * keyword coverage was incomplete (e.g. "同义词扩展" — neither compound
+ * is in CJK_COMPOUNDS → 4 bigrams required, single-keyword match only
+ * 25% < 30% rejected 19/20 real hits). At 0.2, pure-noise reduction stays
+ * ≥85% on noise fixture while SIG-6 recall recovered to 100%.
+ *
+ * @param {string} query Raw query text
+ * @param {string} text Candidate result text
+ * @param {number} [threshold] Fraction of patterns that must match. If
+ *   omitted, reads CLAUDE_MEM_CJK_PREC_MIN (default 0.2).
+ * @returns {boolean}
+ */
+export function cjkPrecisionOk(query, text, threshold) {
+  if (threshold === undefined) {
+    const envVal = process.env.CLAUDE_MEM_CJK_PREC_MIN;
+    const parsed = envVal ? parseFloat(envVal) : NaN;
+    threshold = Number.isFinite(parsed) && parsed >= 0 && parsed <= 1 ? parsed : 0.2;
+  }
+  if (!query || !text) return true;
+  if (!/[一-鿿㐀-䶿]{2,}/.test(query)) return true;
+  const keywords = extractCjkKeywords(query);
+  const required = keywords.length > 0
+    ? keywords
+    : cjkBigrams(query).split(' ').filter(b => b && !CJK_STOP_WORDS.has(b));
+  if (required.length === 0) return true;
+  const hit = required.filter(w => text.includes(w)).length;
+  return (hit / required.length) >= threshold;
+}
+
 // ─── FTS5 Token Formatting ──────────────────────────────────────────────────
 
 // Format a term for FTS5: quote if it contains spaces, hyphens, or special chars

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "claude-mem-lite",
-  "version": "2.49.0",
+  "version": "2.50.0",
   "description": "Lightweight persistent memory system for Claude Code",
   "type": "module",
   "engines": {

package/scripts/user-prompt-search.js

@@ -5,6 +5,7 @@
 
 import { ensureDb, DB_DIR, REGISTRY_DB_PATH } from '../schema.mjs';
 import { sanitizeFtsQuery, relaxFtsQueryToOr, truncate, typeIcon, inferProject, OBS_BM25, TYPE_DECAY_CASE, TYPE_QUALITY_CASE, notLowSignalTitleClause, noisePenaltyClause } from '../utils.mjs';
+import { cjkPrecisionOk } from '../nlp.mjs';
 import { writeFileSync, readFileSync, existsSync, renameSync } from 'fs';
 import { join } from 'path';
 import Database from 'better-sqlite3';
@@ -216,6 +217,9 @@ function searchByUserPrompts(db, queryText, project, limit) {
   if (!ftsQuery) return [];
 
   const cutoff = Date.now() - LOOKBACK_MS;
+  // Exclude <task-notification> internal protocol messages — parity with
+  // server.mjs mem_search + mem-cli.mjs search (see lesson #8139: read-path
+  // parity across paths querying the same table).
   const sql = `
     SELECT up.id, up.prompt_text, up.created_at_epoch,
            bm25(user_prompts_fts) as relevance
@@ -225,6 +229,7 @@ function searchByUserPrompts(db, queryText, project, limit) {
     WHERE user_prompts_fts MATCH ?
       AND s.project = ?
       AND up.created_at_epoch > ?
+      AND up.prompt_text NOT LIKE '<task-notification>%'
     ORDER BY relevance
     LIMIT ?
   `;
@@ -238,7 +243,11 @@ function searchByUserPrompts(db, queryText, project, limit) {
     }
   }
 
-  return rows;
+  // CJK precision filter (parity with server.mjs + mem-cli.mjs): unicode61
+  // FTS degrades CJK bigram queries to single-char AND, letting any prose
+  // sharing common chars leak through. Drop rows that miss < 20% of query
+  // bigrams/keywords as contiguous substrings. Non-CJK queries bypass.
+  return rows.filter(r => cjkPrecisionOk(queryText, r.prompt_text));
 }
 
 function searchRecent(db, project, limit) {

package/server.mjs

@@ -6,7 +6,7 @@ import { McpServer } from '@modelcontextprotocol/sdk/server/mcp.js';
 import { StdioServerTransport } from '@modelcontextprotocol/sdk/server/stdio.js';
 import { ListToolsRequestSchema } from '@modelcontextprotocol/sdk/types.js';
 import { jaccardSimilarity, truncate, typeIcon, sanitizeFtsQuery, relaxFtsQueryToOr, inferProject, computeMinHash, estimateJaccardFromMinHash, scrubSecrets, cjkBigrams, fmtDate, isoWeekKey, debugLog, debugCatch, COMPRESSED_PENDING_PURGE, OBS_BM25, SESS_BM25, TYPE_DECAY_CASE, TYPE_QUALITY_CASE, getCurrentBranch, DEFAULT_DECAY_HALF_LIFE_MS, isPathConfined, notLowSignalTitleClause, LOW_SIGNAL_TITLE } from './utils.mjs';
-import { extractCjkLikePatterns } from './nlp.mjs';
+import { extractCjkLikePatterns, cjkPrecisionOk } from './nlp.mjs';
 import { resolveProject as _resolveProjectShared } from './project-utils.mjs';
 import { ensureDb, DB_PATH, REGISTRY_DB_PATH } from './schema.mjs';
 import { reRankWithContext, markSuperseded, extractPRFTerms, expandQueryByConcepts, autoBoostIfNeeded, runIdleCleanup, buildServerInstructions } from './server-internals.mjs';
@@ -463,11 +463,15 @@ function searchPrompts(ctx) {
       epochTo, epochTo,
       perSourceLimit, perSourceOffset
     );
-    for (const r of rows) {
+    // CJK precision filter: unicode61 FTS degrades CJK bigram queries to
+    // single-char AND, letting any prose sharing common chars leak through.
+    // Require ≥30% of query's CJK bigrams/keywords as contiguous substrings.
+    const keptRows = args.query ? rows.filter(r => cjkPrecisionOk(args.query, r.prompt_text)) : rows;
+    for (const r of keptRows) {
       results.push({ source: 'prompt', id: r.id, text: r.prompt_text, session: r.content_session_id, date: r.created_at, created_at_epoch: r.created_at_epoch, score: r.score });
     }
     // CJK LIKE fallback: FTS5 unicode61 can't tokenize CJK substrings in prompts
-    if (rows.length === 0 && args.query) {
+    if (keptRows.length === 0 && args.query) {
       const cjkPatterns = extractCjkLikePatterns(args.query);
       if (cjkPatterns.length > 0) {
         const likeConds = cjkPatterns.map(() => 'p.prompt_text LIKE ?');
@@ -490,7 +494,13 @@ function searchPrompts(ctx) {
           epochTo, epochTo,
           perSourceLimit, perSourceOffset
         );
-        for (const r of fallbackRows) {
+        // Parity with mem-cli.mjs: the LIKE fallback is an OR'd bigram
+        // substring scan with no scoring gate. The precision filter must
+        // apply here too — without it, queries whose FTS set is empty
+        // re-admit the full common-char noise band that FTS would have
+        // dropped downstream anyway.
+        const keptFallback = args.query ? fallbackRows.filter(r => cjkPrecisionOk(args.query, r.prompt_text)) : fallbackRows;
+        for (const r of keptFallback) {
           results.push({ source: 'prompt', id: r.id, text: r.prompt_text, session: r.content_session_id, date: r.created_at, created_at_epoch: r.created_at_epoch, score: 0 });
         }
       }

package/tool-schemas.mjs

@@ -423,7 +423,7 @@ export const tools = [
       '  - After a major project phase completes and old per-file observations are noise\n' +
       '  - Stats show thousands of low-importance rows dragging search quality\n' +
       '\n' +
-      'Equivalent CLI: claude-mem-lite compress [--preview] [--age-days 90]',
+      'Equivalent CLI: claude-mem-lite compress [--execute] [--age-days 90]  (preview is default)',
     inputSchema: memCompressSchema,
     hidden: true,
   },
@@ -442,7 +442,7 @@ export const tools = [
       '  - After bulk imports or a long offline period\n' +
       '  - User asks for periodic maintenance / cleanup\n' +
       '\n' +
-      'Equivalent CLI: claude-mem-lite maintain --action scan --operations dedup,decay',
+      'Equivalent CLI: claude-mem-lite maintain scan --ops dedup,decay',
     inputSchema: memMaintainSchema,
     hidden: true,
   },
@@ -461,7 +461,7 @@ export const tools = [
       '  - stats show many degraded (title-only, no lesson) observations\n' +
       '  - Start with action="preview" to see candidates before spending tokens\n' +
       '\n' +
-      'Equivalent CLI: claude-mem-lite optimize [--action preview|run|run_all] [--max-items N]',
+      'Equivalent CLI: claude-mem-lite optimize [--run|--run-all] [--task re-enrich,normalize,cluster-merge,smart-compress] [--max N]  (preview is default)',
     inputSchema: memOptimizeSchema,
     hidden: true,
   },