@icex-labs/openclaw-memory-engine 5.0.3 → 5.1.1

package/extras/migrate-legacy.mjs

@@ -140,9 +140,26 @@ for (const { path, tag } of files) {
       continue;
     }
 
+    // Infer date from filename (e.g., 2026-03-28.md → 2026-03-28, 2026-W13.md → week date)
+    const dateMatch = basename(path).match(/^(\d{4}-\d{2}-\d{2})/);
+    const weekMatch = basename(path).match(/^(\d{4})-W(\d{2})/);
+    let inferredTs;
+    if (dateMatch) {
+      inferredTs = dateMatch[1] + "T12:00:00Z";
+    } else if (weekMatch) {
+      // Approximate: week number × 7 days from Jan 1
+      const year = parseInt(weekMatch[1]);
+      const week = parseInt(weekMatch[2]);
+      const jan1 = new Date(year, 0, 1);
+      const weekDate = new Date(jan1.getTime() + (week - 1) * 7 * 86400000);
+      inferredTs = weekDate.toISOString();
+    } else {
+      inferredTs = new Date().toISOString();
+    }
+
     const record = {
       id: `arch-${Date.now()}-${Math.random().toString(36).slice(2, 8)}`,
-      ts: new Date().toISOString(),
+      ts: inferredTs,
       last_accessed: null,
       access_count: 0,
       importance: 5,

package/index.js

@@ -702,7 +702,7 @@ export default definePluginEntry({
       async execute(_id, params) {
         const wsp = ws(agentId, params);
         try {
-          const result = runQualityPass(wsp, {
+          const result = await runQualityPass(wsp, {
             skipGraph: params.skip_graph || false,
             skipEpisodes: params.skip_episodes || false,
           });

package/lib/graph.js

@@ -1,9 +1,6 @@
 /**
  * Knowledge Graph: triple store (subject, relation, object).
- * Enables relational queries like "who is George's doctor" or "what treats 荨麻疹".
- *
- * Storage: memory/graph.jsonl — one triple per line.
- * Auto-extraction: pattern-based extraction from archival insert content.
+ * v5.1: strict extraction — only extract triples from clear, short, structured statements.
  */
 
 import { readFileSync, writeFileSync, appendFileSync, existsSync, mkdirSync } from "node:fs";
@@ -12,7 +9,7 @@ import { graphPath } from "./paths.js";
 
 // ─── In-memory cache ───
 
-const cache = new Map(); // ws → { triples: [], loaded: false }
+const cache = new Map();
 
 export function loadGraph(ws) {
   if (cache.has(ws) && cache.get(ws).loaded) return cache.get(ws).triples;
@@ -31,7 +28,6 @@ export function loadGraph(ws) {
 export function addTriple(ws, subject, relation, object, sourceId = null) {
   const triples = loadGraph(ws);
 
-  // Deduplicate: same subject+relation+object
   const exists = triples.some(
     (t) => t.s === subject && t.r === relation && t.o === object,
   );
@@ -61,13 +57,6 @@ export function removeTriple(ws, tripleId) {
   return true;
 }
 
-/**
- * Query the graph from a starting entity, optionally filtering by relation.
- * @param {string} entity - starting node
- * @param {string} [relation] - optional relation filter
- * @param {number} [depth=2] - traversal depth
- * @returns {Array<{ path: string[], triple: object }>}
- */
 export function queryGraph(ws, entity, relation = null, depth = 2) {
   const triples = loadGraph(ws);
   const entityLower = entity.toLowerCase();
@@ -82,16 +71,14 @@ export function queryGraph(ws, entity, relation = null, depth = 2) {
 
     const currentLower = current.toLowerCase();
     for (const t of triples) {
-      // Forward: subject matches
       if (t.s.toLowerCase() === currentLower) {
         if (relation && t.r.toLowerCase() !== relation.toLowerCase()) continue;
-        results.push({ path: [...path, `--${t.r}-->`], node: t.o, triple: t });
+        results.push({ path: [...path, `--${t.r}-->`], node: t.o, triple: { id: t.id, s: t.s, r: t.r, o: t.o } });
         traverse(t.o, currentDepth + 1, [...path, `--${t.r}-->`, t.o]);
       }
-      // Reverse: object matches
       if (t.o.toLowerCase() === currentLower) {
         if (relation && t.r.toLowerCase() !== relation.toLowerCase()) continue;
-        results.push({ path: [...path, `<--${t.r}--`], node: t.s, triple: t });
+        results.push({ path: [...path, `<--${t.r}--`], node: t.s, triple: { id: t.id, s: t.s, r: t.r, o: t.o } });
         traverse(t.s, currentDepth + 1, [...path, `<--${t.r}--`, t.s]);
       }
     }
@@ -101,45 +88,65 @@ export function queryGraph(ws, entity, relation = null, depth = 2) {
   return results;
 }
 
-// ─── Auto-extraction patterns ───
+// ─── Auto-extraction: strict patterns only ───
+
+/**
+ * Validate that a string looks like a proper entity name (not a sentence fragment).
+ * - Must be short (≤25 chars)
+ * - Must not contain markdown, code, or sentence-like patterns
+ * - Must start with a capital letter or CJK character
+ */
+function isValidEntity(s) {
+  if (!s || s.length > 25 || s.length < 2) return false;
+  // Reject markdown, code, URLs, punctuation-heavy strings
+  if (/[`*\[\]{}()|→←⚠#>]/.test(s)) return false;
+  // Reject if it looks like a sentence (has verb-like patterns or too many words)
+  if (s.split(/\s+/).length > 5) return false;
+  // Must start with uppercase, CJK, or known pattern
+  if (!/^[A-Z\u4e00-\u9fff\u3040-\u309f\u30a0-\u30ff\uac00-\ud7af]/.test(s)) return false;
+  return true;
+}
 
 const EXTRACTION_PATTERNS = [
-  // "X's doctor is Y" / "X的医生是Y"
-  { re: /(.+?)(?:'s|的)\s*(?:doctor|医生|主治医生)\s*(?:is|是|为)\s*(.+)/i, r: "has_doctor" },
-  // "X lives in Y" / "X住在Y"
-  { re: /(.+?)\s*(?:lives? in|住在|位于)\s*(.+)/i, r: "lives_in" },
-  // "X works at Y" / "X在Y工作"
-  { re: /(.+?)\s*(?:works? at|在(.+?)工作)/i, r: "works_at" },
-  // "X has condition Y" / disease / 疾病
-  { re: /(.+?)\s*(?:has|有|患有)\s*(?:chronic |慢性)?\s*(.+?(?:症|病|urticaria|condition|disease))/i, r: "has_condition" },
-  // "X treated by/takes Y" / 用药
-  { re: /(.+?)\s*(?:takes?|服用|用药|treated (?:by|with))\s*(.+)/i, r: "treated_by" },
+  // "X's doctor is Y"
+  { re: /^([A-Z]\w+)(?:'s)\s+doctor\s+is\s+(.+)$/i, r: "has_doctor" },
+  // "X's lawyer is Y"
+  { re: /^([A-Z]\w+)(?:'s)\s+(?:lawyer|attorney)\s+is\s+(.+)$/i, r: "has_lawyer" },
+  // "X lives in Y"
+  { re: /^([A-Z]\w+)\s+lives?\s+in\s+([A-Z][\w\s,]+)$/i, r: "lives_in" },
+  // "X works at Y"
+  { re: /^([A-Z]\w+)\s+works?\s+at\s+([A-Z][\w\s&.]+)$/i, r: "works_at" },
+  // "X owns Y" — only match short clear statements
+  { re: /^([A-Z]\w+)\s+owns?\s+(?:a\s+)?([A-Z][\w\s]+)$/i, r: "owns" },
+  // "X drives a Y"
+  { re: /^([A-Z]\w+)\s+drives?\s+(?:a\s+)?([A-Z][\w\s]+)$/i, r: "owns" },
+  // "X has chronic Y" / "X has Y disease/condition"
+  { re: /^([A-Z]\w+)\s+has\s+(?:chronic\s+)?(\w[\w\s]*(?:disease|condition|syndrome|urticaria|diabetes|asthma))$/i, r: "has_condition" },
+  // "X takes Y" (medication)
+  { re: /^([A-Z]\w+)\s+takes?\s+([A-Z][\w\s]+\d+\s*mg)$/i, r: "treated_by" },
+  // "X attends Y"
+  { re: /^([A-Z]\w+)\s+attends?\s+([A-Z][\w\s]+)$/i, r: "attends" },
   // "X's wife/husband is Y"
-  { re: /(.+?)(?:'s|的)\s*(wife|husband|妻子|丈夫|老婆|老公)\s*(?:is|是|为)\s*(.+)/i, r: "spouse", triple: true },
+  { re: /^([A-Z]\w+)(?:'s)\s+(?:wife|husband)\s+is\s+(.+)$/i, r: "spouse" },
   // "X's son/daughter is Y"
-  { re: /(.+?)(?:'s|的)\s*(son|daughter|儿子|女儿)\s*(?:is|是|为)\s*(.+)/i, r: "has_child", triple: true },
-  // "X costs/price Y" / 定价
-  { re: /(.+?)\s*(?:costs?|定价|售价|price[ds]?\s*(?:at)?)\s*\$?([\d,.]+)/i, r: "price" },
-  // "X's lawyer is Y"
-  { re: /(.+?)(?:'s|的)\s*(?:lawyer|律师|attorney)\s*(?:is|是|为)\s*(.+)/i, r: "has_lawyer" },
-  // "X owns Y" / 拥有
-  { re: /(.+?)\s*(?:owns?|拥有|有一辆|drives?)\s*(.+)/i, r: "owns" },
-  // "X studies/attends Y" / 就读
-  { re: /(.+?)\s*(?:attends?|studies? at|就读于?|在(.+?)(?:上学|读书))/i, r: "attends" },
+  { re: /^([A-Z]\w+)(?:'s)\s+(?:son|daughter)\s+is\s+(.+)$/i, r: "has_child" },
 ];
 
 /**
  * Extract triples from a text string.
- * @returns {Array<{ s: string, r: string, o: string }>}
+ * Strict: only matches clean, short statements with proper entity names.
  */
 export function extractTriples(text) {
   const results = [];
+  // Only try extraction on short, clear text (not paragraphs)
+  if (text.length > 150) return results;
+
   for (const pat of EXTRACTION_PATTERNS) {
     const m = text.match(pat.re);
     if (m) {
       const s = (m[1] || "").trim();
-      const o = (pat.triple ? m[3] : m[2] || "").trim();
-      if (s && o && s.length < 50 && o.length < 80) {
+      const o = (m[2] || "").trim();
+      if (isValidEntity(s) && o.length >= 2 && o.length <= 40) {
         results.push({ s, r: pat.r, o });
       }
     }

package/lib/quality.js

@@ -67,12 +67,18 @@ export async function runQualityPass(ws, options = {}) {
 }
 
 /**
- * Generate episode summaries from clusters of records on the same day.
+ * Generate episode summaries from records.
+ * Strategy 1: group by date (works when ts reflects original dates)
+ * Strategy 2: group by entity/topic (fallback when all ts are same day, e.g., after migration)
  */
 function generateEpisodesFromRecords(ws, records) {
   const episodes = loadEpisodes(ws);
+  const existingTopics = new Set(episodes.flatMap((e) => e.topics || []));
   const existingDates = new Set(episodes.map((e) => e.ts?.slice(0, 10)));
 
+  let generated = 0;
+
+  // Strategy 1: by date
   const byDate = {};
   for (const r of records) {
     if (!r.ts) continue;
@@ -81,14 +87,15 @@ function generateEpisodesFromRecords(ws, records) {
     byDate[date].push(r);
   }
 
-  let generated = 0;
   for (const [date, dayRecords] of Object.entries(byDate)) {
     if (existingDates.has(date) || dayRecords.length < 3) continue;
+    // Skip if most records share the same date (migration artifact)
+    if (dayRecords.length > records.length * 0.5) continue;
 
     const topics = [...new Set(dayRecords.map((r) => r.entity).filter((e) => e && e !== "general"))];
     const topContent = dayRecords
       .sort((a, b) => (b.importance || 5) - (a.importance || 5))
-      .slice(0, 5)
+      .slice(0, 3)
       .map((r) => r.content.slice(0, 80))
       .join("; ");
 
@@ -103,6 +110,35 @@ function generateEpisodesFromRecords(ws, records) {
     generated++;
   }
 
+  // Strategy 2: by entity (fallback for migration data with same-day ts)
+  const byEntity = {};
+  for (const r of records) {
+    const e = r.entity || "general";
+    if (e === "general") continue;
+    if (!byEntity[e]) byEntity[e] = [];
+    byEntity[e].push(r);
+  }
+
+  for (const [entity, recs] of Object.entries(byEntity)) {
+    if (recs.length < 5) continue;
+    if (existingTopics.has(entity)) continue;
+
+    const top = recs
+      .sort((a, b) => (b.importance || 5) - (a.importance || 5))
+      .slice(0, 3)
+      .map((r) => r.content.slice(0, 80));
+
+    saveEpisode(ws, {
+      summary: `[${entity}] ${top.join("; ")}`,
+      decisions: [],
+      mood: "",
+      topics: [entity],
+      participants: [],
+      source: "topic-summary",
+    });
+    generated++;
+  }
+
   return generated;
 }
 

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@icex-labs/openclaw-memory-engine",
-  "version": "5.0.3",
+  "version": "5.1.1",
   "description": "MemGPT-style hierarchical memory plugin for OpenClaw — core memory block + archival storage with semantic search",
   "type": "module",
   "main": "index.js",