@melandlabs/memory-store 0.1.5 → 0.2.0

package/dist/mcp.js

@@ -249,7 +249,14 @@ function clampUnifiedMemorySearchThreshold(threshold) {
   }
   return Math.min(1, Math.max(-1, parsed));
 }
-function mergeUnifiedMemorySearchResults(results, limit) {
+function mergeUnifiedMemorySearchResults(results, limit, options = {}) {
+  const strategy = normalizeUnifiedMemoryMergeStrategy(options.strategy);
+  if (strategy === "rrf") {
+    const lists = options.rankedLists ?? [
+      { name: "memory-semantic", hits: results }
+    ];
+    return mergeUnifiedMemorySearchResultsRrf(lists, limit);
+  }
   return [...results].sort((a, b) => {
     const scoreDelta = b.similarity - a.similarity;
     if (scoreDelta !== 0) {
@@ -258,6 +265,42 @@ function mergeUnifiedMemorySearchResults(results, limit) {
     return a.type.localeCompare(b.type) || a.id.localeCompare(b.id);
   }).slice(0, limit);
 }
+function normalizeUnifiedMemoryMergeStrategy(value) {
+  return value === "rrf" ? "rrf" : "similarity";
+}
+var DEFAULT_RRF_K = 60;
+function mergeUnifiedMemorySearchResultsRrf(lists, limit, k = DEFAULT_RRF_K) {
+  if (!Array.isArray(lists) || lists.length === 0) {
+    return [];
+  }
+  const safeK = Number.isFinite(k) && k > 0 ? k : DEFAULT_RRF_K;
+  const scores = /* @__PURE__ */ new Map();
+  const order = [];
+  for (const list of lists) {
+    for (let index = 0; index < list.hits.length; index += 1) {
+      const hit = list.hits[index];
+      const key = `${hit.type}::${hit.id}`;
+      const contribution = 1 / (safeK + index + 1);
+      const existing = scores.get(key);
+      if (existing) {
+        existing.rrf += contribution;
+      } else {
+        scores.set(key, { hit, rrf: contribution });
+        order.push(key);
+      }
+    }
+  }
+  const ranked = order.map((key) => scores.get(key)).sort((a, b) => {
+    if (b.rrf !== a.rrf) {
+      return b.rrf - a.rrf;
+    }
+    return a.hit.type.localeCompare(b.hit.type) || a.hit.id.localeCompare(b.hit.id);
+  }).slice(0, limit);
+  return ranked.map(({ hit, rrf }) => ({
+    ...hit,
+    metadata: { ...hit.metadata, rrfScore: rrf }
+  }));
+}
 function toKnowledgeResult(result) {
   return {
     type: "knowledge",
@@ -289,6 +332,9 @@ function isRawMemorySemanticResult(result) {
 }
 
 // src/search/unified-search.ts
+function deriveLexicalKeywords(query) {
+  return query.toLowerCase().split(/[^\p{L}\p{N}]+/u).filter((token) => token.length >= 2).slice(0, 16);
+}
 function createUnifiedSearch(deps = {}) {
   const logger = deps.logger ?? console;
   async function searchUnifiedMemory(input) {
@@ -296,8 +342,8 @@ function createUnifiedSearch(deps = {}) {
     const sources = normalizeUnifiedMemorySearchSources(input.sources);
     const limit = clampUnifiedMemorySearchLimit(input.limit);
     const threshold = clampUnifiedMemorySearchThreshold(input.threshold);
+    const mergeStrategy = normalizeUnifiedMemoryMergeStrategy(input.mergeStrategy);
     const warnings = [];
-    const results = [];
     if (!query) {
       return {
         query,
@@ -307,11 +353,11 @@ function createUnifiedSearch(deps = {}) {
         warnings
       };
     }
+    let memorySubs;
     if (sources.includes("memory")) {
       if (isRawMessageStorageAvailable()) {
         try {
-          const memoryHits = await runMemorySource(input, limit, threshold);
-          results.push(...memoryHits);
+          memorySubs = await runMemorySource(input, limit, threshold, warnings);
         } catch (error) {
           logger.warn?.("[memory-store] memory source failed:", error);
           warnings.push({
@@ -328,9 +374,10 @@ function createUnifiedSearch(deps = {}) {
         });
       }
     }
+    const insightHits = [];
     if (sources.includes("insights") && typeof deps.searchInsights === "function") {
       try {
-        const insightHits = await deps.searchInsights({
+        const hits = await deps.searchInsights({
           userId: input.userId,
           query: input.query,
           limit,
@@ -339,8 +386,8 @@ function createUnifiedSearch(deps = {}) {
           includeArchived: input.includeArchivedInsights,
           authToken: input.authToken
         });
-        for (const hit of insightHits) {
-          results.push({
+        for (const hit of hits) {
+          insightHits.push({
             type: "insight",
             id: hit.id,
             content: hit.content,
@@ -363,9 +410,10 @@ function createUnifiedSearch(deps = {}) {
         message: "Insights search is not configured for this host."
       });
     }
+    const knowledgeHits = [];
     if (sources.includes("knowledge") && typeof deps.searchKnowledge === "function") {
       try {
-        const knowledgeHits = await deps.searchKnowledge({
+        const hits = await deps.searchKnowledge({
           userId: input.userId,
           query: input.query,
           options: {
@@ -375,8 +423,8 @@ function createUnifiedSearch(deps = {}) {
           },
           authToken: input.authToken
         });
-        for (const hit of knowledgeHits) {
-          results.push(toKnowledgeResult(hit));
+        for (const hit of hits) {
+          knowledgeHits.push(toKnowledgeResult(hit));
         }
       } catch (error) {
         logger.warn?.("[memory-store] knowledge source failed:", error);
@@ -393,7 +441,13 @@ function createUnifiedSearch(deps = {}) {
         message: "Knowledge search is not configured for this host."
       });
     }
-    const merged = mergeUnifiedMemorySearchResults(results, limit);
+    const merged = mergeAcrossSources({
+      memorySubs,
+      insightHits,
+      knowledgeHits,
+      limit,
+      strategy: mergeStrategy
+    });
     return {
       query: input.query,
       sources,
@@ -402,7 +456,7 @@ function createUnifiedSearch(deps = {}) {
       warnings
     };
   }
-  async function runMemorySource(input, limit, threshold) {
+  async function runMemorySource(input, limit, threshold, warnings) {
     if (typeof deps.embedQuery !== "function") {
       throw new Error("embedQuery is not configured");
     }
@@ -412,9 +466,10 @@ function createUnifiedSearch(deps = {}) {
       authToken: input.authToken
     });
     const filters = input.botIds && input.botIds.length > 0 ? input.botIds.map((botId) => ({ botId })) : [{}];
+    let semantic = [];
     if (isRawMessageChromaEnabled()) {
       try {
-        const chromaHits = (await Promise.all(
+        semantic = (await Promise.all(
           filters.map((filter) => {
             const botId = "botId" in filter ? filter.botId : void 0;
             return searchRawMessagesWithChroma({
@@ -429,18 +484,16 @@ function createUnifiedSearch(deps = {}) {
         logger.log?.("[memory-store] Raw message semantic search completed", {
           backend: "chroma",
           dimensions: queryEmbedding.length,
-          count: chromaHits.length
+          count: semantic.length
         });
-        return chromaHits;
       } catch (error) {
         logger.warn?.(
           "[memory-store] Chroma raw message search failed; falling back to database search:",
           error
         );
       }
-    }
-    if (typeof deps.searchRawMessagesAnn === "function") {
-      const rows = (await Promise.all(
+    } else if (typeof deps.searchRawMessagesAnn === "function") {
+      semantic = (await Promise.all(
         filters.map(
           (filter) => deps.searchRawMessagesAnn({
             userId: input.userId,
@@ -451,17 +504,87 @@ function createUnifiedSearch(deps = {}) {
           })
         )
       )).flat().filter(isRawMemorySemanticResult).map(toMemoryResult);
-      return rows;
     }
-    return [];
+    let lexical = [];
+    if (typeof deps.searchRawMessagesLexical === "function") {
+      const keywords = deriveLexicalKeywords(input.query);
+      if (keywords.length > 0) {
+        try {
+          const lexFilters = input.botIds && input.botIds.length > 0 ? input.botIds : [void 0];
+          lexical = (await Promise.all(
+            lexFilters.map(
+              (botId) => deps.searchRawMessagesLexical({
+                userId: input.userId,
+                keywords,
+                limit,
+                botId
+              })
+            )
+          )).flat().filter(isRawMemorySemanticResult).map((hit) => ({
+            ...toMemoryResult(hit),
+            metadata: { ...hit.metadata, scoring: "bm25" }
+          }));
+        } catch (error) {
+          logger.warn?.("[memory-store] lexical memory search failed:", error);
+          warnings.push({
+            source: "memory",
+            code: "memory_lexical_search_failed",
+            message: error.message ?? "memory_lexical_search_failed"
+          });
+        }
+      }
+    } else if (input.mergeStrategy === "rrf") {
+      warnings.push({
+        source: "memory",
+        code: "memory_lexical_search_not_configured",
+        message: "RRF merge requested but lexical search is not configured; falling back to semantic-only RRF."
+      });
+    }
+    return { semantic, lexical };
   }
   async function searchRawMemorySemantically(input) {
     const limit = clampUnifiedMemorySearchLimit(input.limit);
     const threshold = clampUnifiedMemorySearchThreshold(input.threshold);
-    return runMemorySource(input, limit, threshold);
+    const sub = await runMemorySource(input, limit, threshold, []);
+    return mergeAcrossSources({
+      memorySubs: sub,
+      insightHits: [],
+      knowledgeHits: [],
+      limit,
+      strategy: normalizeUnifiedMemoryMergeStrategy(input.mergeStrategy)
+    });
   }
   return { searchUnifiedMemory, searchRawMemorySemantically };
 }
+function mergeAcrossSources(input) {
+  const memorySubs = input.memorySubs ?? { semantic: [], lexical: [] };
+  const all = [
+    ...memorySubs.semantic,
+    ...memorySubs.lexical,
+    ...input.insightHits,
+    ...input.knowledgeHits
+  ];
+  if (input.strategy !== "rrf") {
+    return mergeUnifiedMemorySearchResults(all, input.limit);
+  }
+  const lists = [];
+  if (memorySubs.semantic.length > 0) {
+    lists.push({ name: "memory-semantic", hits: memorySubs.semantic });
+  }
+  if (memorySubs.lexical.length > 0) {
+    lists.push({ name: "memory-bm25", hits: memorySubs.lexical });
+  }
+  if (input.insightHits.length > 0) {
+    lists.push({ name: "insights", hits: input.insightHits });
+  }
+  if (input.knowledgeHits.length > 0) {
+    lists.push({ name: "knowledge", hits: input.knowledgeHits });
+  }
+  if (lists.length <= 1) {
+    return mergeUnifiedMemorySearchResults(all, input.limit);
+  }
+  return mergeUnifiedMemorySearchResultsRrf(lists, input.limit);
+}
 
 // src/mcp.ts
 var DEFAULT_NAME = "@melandlabs/memory-store";
@@ -623,5 +746,3 @@ async function startMcpServer(options = {}) {
 }
 
 export { startMcpServer };
-//# sourceMappingURL=mcp.js.map
-//# sourceMappingURL=mcp.js.map

package/dist/policies/memory-graph-correction-policy.js

@@ -37,5 +37,3 @@ function resolveMemoryGraphCorrectionPolicy(userId, environment = process.env) {
 }
 
 export { resolveMemoryGraphCorrectionPolicy };
-//# sourceMappingURL=memory-graph-correction-policy.js.map
-//# sourceMappingURL=memory-graph-correction-policy.js.map

package/dist/policies/memory-graph-write-policy.js

@@ -74,5 +74,3 @@ function resolveUntrustedRawMemoryGraphWritePolicy() {
 }
 
 export { CHAT_MEMORY_EVIDENCE_ID_PREFIX, MEMORY_GRAPH_SUMMARY_ID_PREFIXES, isReservedChatMemoryEvidenceId, isReservedMemoryGraphSummaryId, resolveAllowlistedMemoryGraphPolicy, resolveMemoryGraphWritePolicy, resolveUntrustedRawMemoryGraphWritePolicy, sanitizeUntrustedMemoryMetadata };
-//# sourceMappingURL=memory-graph-write-policy.js.map
-//# sourceMappingURL=memory-graph-write-policy.js.map

package/dist/search/unified-search.d.ts

@@ -1,4 +1,4 @@
-import { d as UnifiedSearchDeps } from '../config-D6MzksfT.js';
+import { d as UnifiedSearchDeps } from '../config-BYfTzG3h.js';
 
 /**
  * Pure helpers used by the unified memory search pipeline.
@@ -23,6 +23,30 @@ interface UnifiedMemorySearchInput {
     includeArchivedInsights?: boolean;
     botIds?: string[];
     documentIds?: string[];
+    /**
+     * Optional ISO-8601 timestamp. When set, graph-aware retrieval and other
+     * snapshot consumers drop nodes / edges whose `applicability.validFrom` /
+     * `validUntil` window is closed at that instant. Backward-compatible:
+     * omitted `asOf` keeps the legacy behaviour exactly.
+     */
+    asOf?: string;
+    /**
+     * How to merge per-source result lists. Defaults to `"similarity"` —
+     * the legacy global sort by similarity, then type/id tie-break. The
+     * alternate value `"rrf"` invokes reciprocal-rank fusion across the
+     * lists fed via the (internal) `rankedLists` option.
+     */
+    mergeStrategy?: UnifiedMemoryMergeStrategy;
+}
+type UnifiedMemoryMergeStrategy = "similarity" | "rrf";
+/**
+ * A single ranked list from one retrieval channel. Used by the RRF merge to
+ * combine multiple signals (semantic + lexical + insights + knowledge) without
+ * flattening them into a single similarity score first.
+ */
+interface UnifiedMemoryRankedList {
+    name: "memory-bm25" | "memory-semantic" | "insights" | "knowledge";
+    hits: UnifiedMemorySearchResult[];
 }
 interface UnifiedMemorySearchResult {
     type: "memory" | "insight" | "knowledge";
@@ -41,7 +65,19 @@ interface UnifiedMemorySearchOutput {
 declare function normalizeUnifiedMemorySearchSources(sources: unknown): UnifiedMemorySearchSource[];
 declare function clampUnifiedMemorySearchLimit(limit: unknown): number;
 declare function clampUnifiedMemorySearchThreshold(threshold: unknown): number;
-declare function mergeUnifiedMemorySearchResults(results: UnifiedMemorySearchResult[], limit: number): UnifiedMemorySearchResult[];
+declare function mergeUnifiedMemorySearchResults(results: UnifiedMemorySearchResult[], limit: number, options?: {
+    strategy?: UnifiedMemoryMergeStrategy;
+    rankedLists?: UnifiedMemoryRankedList[];
+}): UnifiedMemorySearchResult[];
+declare function normalizeUnifiedMemoryMergeStrategy(value: unknown): UnifiedMemoryMergeStrategy;
+/**
+ * Reciprocal Rank Fusion across multiple ranked lists. Each list contributes
+ * `1 / (k + rank + 1)` to a hit's accumulated score. Hits are de-duplicated by
+ * `(type, id)` so the same message surfaced by both lexical and semantic
+ * channels naturally outranks single-channel matches. Tie-break is
+ * deterministic: descending RRF score, then `(type, id)` lexical.
+ */
+declare function mergeUnifiedMemorySearchResultsRrf(lists: UnifiedMemoryRankedList[], limit: number, k?: number): UnifiedMemorySearchResult[];
 declare function toKnowledgeResult(result: {
     chunkId: string;
     documentId: string;
@@ -78,4 +114,4 @@ interface UnifiedSearch {
 }
 declare function createUnifiedSearch(deps?: UnifiedSearchDeps): UnifiedSearch;
 
-export { type UnifiedMemorySearchInput, type UnifiedMemorySearchOutput, type UnifiedMemorySearchResult, type UnifiedMemorySearchSource, type UnifiedMemorySearchWarning, type UnifiedSearch, clampUnifiedMemorySearchLimit, clampUnifiedMemorySearchThreshold, createUnifiedSearch, isRawMemorySemanticResult, mergeUnifiedMemorySearchResults, normalizeUnifiedMemorySearchSources, toKnowledgeResult, toMemoryResult };
+export { type UnifiedMemoryMergeStrategy, type UnifiedMemoryRankedList, type UnifiedMemorySearchInput, type UnifiedMemorySearchOutput, type UnifiedMemorySearchResult, type UnifiedMemorySearchSource, type UnifiedMemorySearchWarning, type UnifiedSearch, clampUnifiedMemorySearchLimit, clampUnifiedMemorySearchThreshold, createUnifiedSearch, isRawMemorySemanticResult, mergeUnifiedMemorySearchResults, mergeUnifiedMemorySearchResultsRrf, normalizeUnifiedMemoryMergeStrategy, normalizeUnifiedMemorySearchSources, toKnowledgeResult, toMemoryResult };

package/dist/search/unified-search.js

@@ -169,7 +169,14 @@ function clampUnifiedMemorySearchThreshold(threshold) {
   }
   return Math.min(1, Math.max(-1, parsed));
 }
-function mergeUnifiedMemorySearchResults(results, limit) {
+function mergeUnifiedMemorySearchResults(results, limit, options = {}) {
+  const strategy = normalizeUnifiedMemoryMergeStrategy(options.strategy);
+  if (strategy === "rrf") {
+    const lists = options.rankedLists ?? [
+      { name: "memory-semantic", hits: results }
+    ];
+    return mergeUnifiedMemorySearchResultsRrf(lists, limit);
+  }
   return [...results].sort((a, b) => {
     const scoreDelta = b.similarity - a.similarity;
     if (scoreDelta !== 0) {
@@ -178,6 +185,42 @@ function mergeUnifiedMemorySearchResults(results, limit) {
     return a.type.localeCompare(b.type) || a.id.localeCompare(b.id);
   }).slice(0, limit);
 }
+function normalizeUnifiedMemoryMergeStrategy(value) {
+  return value === "rrf" ? "rrf" : "similarity";
+}
+var DEFAULT_RRF_K = 60;
+function mergeUnifiedMemorySearchResultsRrf(lists, limit, k = DEFAULT_RRF_K) {
+  if (!Array.isArray(lists) || lists.length === 0) {
+    return [];
+  }
+  const safeK = Number.isFinite(k) && k > 0 ? k : DEFAULT_RRF_K;
+  const scores = /* @__PURE__ */ new Map();
+  const order = [];
+  for (const list of lists) {
+    for (let index = 0; index < list.hits.length; index += 1) {
+      const hit = list.hits[index];
+      const key = `${hit.type}::${hit.id}`;
+      const contribution = 1 / (safeK + index + 1);
+      const existing = scores.get(key);
+      if (existing) {
+        existing.rrf += contribution;
+      } else {
+        scores.set(key, { hit, rrf: contribution });
+        order.push(key);
+      }
+    }
+  }
+  const ranked = order.map((key) => scores.get(key)).sort((a, b) => {
+    if (b.rrf !== a.rrf) {
+      return b.rrf - a.rrf;
+    }
+    return a.hit.type.localeCompare(b.hit.type) || a.hit.id.localeCompare(b.hit.id);
+  }).slice(0, limit);
+  return ranked.map(({ hit, rrf }) => ({
+    ...hit,
+    metadata: { ...hit.metadata, rrfScore: rrf }
+  }));
+}
 function toKnowledgeResult(result) {
   return {
     type: "knowledge",
@@ -209,6 +252,9 @@ function isRawMemorySemanticResult(result) {
 }
 
 // src/search/unified-search.ts
+function deriveLexicalKeywords(query) {
+  return query.toLowerCase().split(/[^\p{L}\p{N}]+/u).filter((token) => token.length >= 2).slice(0, 16);
+}
 function createUnifiedSearch(deps = {}) {
   const logger = deps.logger ?? console;
   async function searchUnifiedMemory(input) {
@@ -216,8 +262,8 @@ function createUnifiedSearch(deps = {}) {
     const sources = normalizeUnifiedMemorySearchSources(input.sources);
     const limit = clampUnifiedMemorySearchLimit(input.limit);
     const threshold = clampUnifiedMemorySearchThreshold(input.threshold);
+    const mergeStrategy = normalizeUnifiedMemoryMergeStrategy(input.mergeStrategy);
     const warnings = [];
-    const results = [];
     if (!query) {
       return {
         query,
@@ -227,11 +273,11 @@ function createUnifiedSearch(deps = {}) {
         warnings
       };
     }
+    let memorySubs;
     if (sources.includes("memory")) {
       if (isRawMessageStorageAvailable()) {
         try {
-          const memoryHits = await runMemorySource(input, limit, threshold);
-          results.push(...memoryHits);
+          memorySubs = await runMemorySource(input, limit, threshold, warnings);
         } catch (error) {
           logger.warn?.("[memory-store] memory source failed:", error);
           warnings.push({
@@ -248,9 +294,10 @@ function createUnifiedSearch(deps = {}) {
         });
       }
     }
+    const insightHits = [];
     if (sources.includes("insights") && typeof deps.searchInsights === "function") {
       try {
-        const insightHits = await deps.searchInsights({
+        const hits = await deps.searchInsights({
           userId: input.userId,
           query: input.query,
           limit,
@@ -259,8 +306,8 @@ function createUnifiedSearch(deps = {}) {
           includeArchived: input.includeArchivedInsights,
           authToken: input.authToken
         });
-        for (const hit of insightHits) {
-          results.push({
+        for (const hit of hits) {
+          insightHits.push({
             type: "insight",
             id: hit.id,
             content: hit.content,
@@ -283,9 +330,10 @@ function createUnifiedSearch(deps = {}) {
         message: "Insights search is not configured for this host."
       });
     }
+    const knowledgeHits = [];
     if (sources.includes("knowledge") && typeof deps.searchKnowledge === "function") {
       try {
-        const knowledgeHits = await deps.searchKnowledge({
+        const hits = await deps.searchKnowledge({
           userId: input.userId,
           query: input.query,
           options: {
@@ -295,8 +343,8 @@ function createUnifiedSearch(deps = {}) {
           },
           authToken: input.authToken
         });
-        for (const hit of knowledgeHits) {
-          results.push(toKnowledgeResult(hit));
+        for (const hit of hits) {
+          knowledgeHits.push(toKnowledgeResult(hit));
         }
       } catch (error) {
         logger.warn?.("[memory-store] knowledge source failed:", error);
@@ -313,7 +361,13 @@ function createUnifiedSearch(deps = {}) {
         message: "Knowledge search is not configured for this host."
       });
     }
-    const merged = mergeUnifiedMemorySearchResults(results, limit);
+    const merged = mergeAcrossSources({
+      memorySubs,
+      insightHits,
+      knowledgeHits,
+      limit,
+      strategy: mergeStrategy
+    });
     return {
       query: input.query,
       sources,
@@ -322,7 +376,7 @@ function createUnifiedSearch(deps = {}) {
       warnings
     };
   }
-  async function runMemorySource(input, limit, threshold) {
+  async function runMemorySource(input, limit, threshold, warnings) {
     if (typeof deps.embedQuery !== "function") {
       throw new Error("embedQuery is not configured");
     }
@@ -332,9 +386,10 @@ function createUnifiedSearch(deps = {}) {
       authToken: input.authToken
     });
     const filters = input.botIds && input.botIds.length > 0 ? input.botIds.map((botId) => ({ botId })) : [{}];
+    let semantic = [];
     if (isRawMessageChromaEnabled()) {
       try {
-        const chromaHits = (await Promise.all(
+        semantic = (await Promise.all(
           filters.map((filter) => {
             const botId = "botId" in filter ? filter.botId : void 0;
             return searchRawMessagesWithChroma({
@@ -349,18 +404,16 @@ function createUnifiedSearch(deps = {}) {
         logger.log?.("[memory-store] Raw message semantic search completed", {
           backend: "chroma",
           dimensions: queryEmbedding.length,
-          count: chromaHits.length
+          count: semantic.length
         });
-        return chromaHits;
       } catch (error) {
         logger.warn?.(
           "[memory-store] Chroma raw message search failed; falling back to database search:",
           error
         );
       }
-    }
-    if (typeof deps.searchRawMessagesAnn === "function") {
-      const rows = (await Promise.all(
+    } else if (typeof deps.searchRawMessagesAnn === "function") {
+      semantic = (await Promise.all(
         filters.map(
           (filter) => deps.searchRawMessagesAnn({
             userId: input.userId,
@@ -371,18 +424,86 @@ function createUnifiedSearch(deps = {}) {
           })
         )
       )).flat().filter(isRawMemorySemanticResult).map(toMemoryResult);
-      return rows;
     }
-    return [];
+    let lexical = [];
+    if (typeof deps.searchRawMessagesLexical === "function") {
+      const keywords = deriveLexicalKeywords(input.query);
+      if (keywords.length > 0) {
+        try {
+          const lexFilters = input.botIds && input.botIds.length > 0 ? input.botIds : [void 0];
+          lexical = (await Promise.all(
+            lexFilters.map(
+              (botId) => deps.searchRawMessagesLexical({
+                userId: input.userId,
+                keywords,
+                limit,
+                botId
+              })
+            )
+          )).flat().filter(isRawMemorySemanticResult).map((hit) => ({
+            ...toMemoryResult(hit),
+            metadata: { ...hit.metadata, scoring: "bm25" }
+          }));
+        } catch (error) {
+          logger.warn?.("[memory-store] lexical memory search failed:", error);
+          warnings.push({
+            source: "memory",
+            code: "memory_lexical_search_failed",
+            message: error.message ?? "memory_lexical_search_failed"
+          });
+        }
+      }
+    } else if (input.mergeStrategy === "rrf") {
+      warnings.push({
+        source: "memory",
+        code: "memory_lexical_search_not_configured",
+        message: "RRF merge requested but lexical search is not configured; falling back to semantic-only RRF."
+      });
+    }
+    return { semantic, lexical };
   }
   async function searchRawMemorySemantically(input) {
     const limit = clampUnifiedMemorySearchLimit(input.limit);
     const threshold = clampUnifiedMemorySearchThreshold(input.threshold);
-    return runMemorySource(input, limit, threshold);
+    const sub = await runMemorySource(input, limit, threshold, []);
+    return mergeAcrossSources({
+      memorySubs: sub,
+      insightHits: [],
+      knowledgeHits: [],
+      limit,
+      strategy: normalizeUnifiedMemoryMergeStrategy(input.mergeStrategy)
+    });
   }
   return { searchUnifiedMemory, searchRawMemorySemantically };
 }
+function mergeAcrossSources(input) {
+  const memorySubs = input.memorySubs ?? { semantic: [], lexical: [] };
+  const all = [
+    ...memorySubs.semantic,
+    ...memorySubs.lexical,
+    ...input.insightHits,
+    ...input.knowledgeHits
+  ];
+  if (input.strategy !== "rrf") {
+    return mergeUnifiedMemorySearchResults(all, input.limit);
+  }
+  const lists = [];
+  if (memorySubs.semantic.length > 0) {
+    lists.push({ name: "memory-semantic", hits: memorySubs.semantic });
+  }
+  if (memorySubs.lexical.length > 0) {
+    lists.push({ name: "memory-bm25", hits: memorySubs.lexical });
+  }
+  if (input.insightHits.length > 0) {
+    lists.push({ name: "insights", hits: input.insightHits });
+  }
+  if (input.knowledgeHits.length > 0) {
+    lists.push({ name: "knowledge", hits: input.knowledgeHits });
+  }
+  if (lists.length <= 1) {
+    return mergeUnifiedMemorySearchResults(all, input.limit);
+  }
+  return mergeUnifiedMemorySearchResultsRrf(lists, input.limit);
+}
 
-export { clampUnifiedMemorySearchLimit, clampUnifiedMemorySearchThreshold, createUnifiedSearch, isRawMemorySemanticResult, mergeUnifiedMemorySearchResults, normalizeUnifiedMemorySearchSources, toKnowledgeResult, toMemoryResult };
-//# sourceMappingURL=unified-search.js.map
-//# sourceMappingURL=unified-search.js.map
+export { clampUnifiedMemorySearchLimit, clampUnifiedMemorySearchThreshold, createUnifiedSearch, isRawMemorySemanticResult, mergeUnifiedMemorySearchResults, mergeUnifiedMemorySearchResultsRrf, normalizeUnifiedMemoryMergeStrategy, normalizeUnifiedMemorySearchSources, toKnowledgeResult, toMemoryResult };