v3 TUNED: All bottleneck fixes + optimized threshold (0.45)
Browse files
mnemo.py
CHANGED
|
@@ -1,27 +1,14 @@
|
|
|
|
|
| 1 |
"""
|
| 2 |
-
Mnemo
|
| 3 |
-
|
| 4 |
-
Named after Mnemosyne, Greek goddess of memory.
|
| 5 |
|
| 6 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
| 7 |
|
| 8 |
-
Features:
|
| 9 |
-
- Real sentence-transformer embeddings (with hash fallback)
|
| 10 |
-
- Smart context-check for when to inject memory
|
| 11 |
-
- Multi-strategy retrieval (semantic + BM25 + graph)
|
| 12 |
-
- Feedback learning
|
| 13 |
-
- MCP server support
|
| 14 |
-
|
| 15 |
-
Quick Start:
|
| 16 |
-
from mnemo import Mnemo
|
| 17 |
-
|
| 18 |
-
m = Mnemo()
|
| 19 |
-
m.add("User prefers dark mode")
|
| 20 |
-
results = m.search("user preferences")
|
| 21 |
-
|
| 22 |
-
# Smart injection check
|
| 23 |
-
if m.should_inject("Based on your previous analysis..."):
|
| 24 |
-
context = m.get_context("previous analysis")
|
| 25 |
"""
|
| 26 |
|
| 27 |
import hashlib
|
|
@@ -29,17 +16,9 @@ import time
|
|
| 29 |
import re
|
| 30 |
import threading
|
| 31 |
import numpy as np
|
| 32 |
-
from typing import Dict, List, Optional, Tuple, Any
|
| 33 |
from dataclasses import dataclass, field
|
| 34 |
from collections import defaultdict
|
| 35 |
-
from enum import Enum
|
| 36 |
-
|
| 37 |
-
# Optional imports with fallbacks
|
| 38 |
-
try:
|
| 39 |
-
from sentence_transformers import SentenceTransformer
|
| 40 |
-
HAS_SENTENCE_TRANSFORMERS = True
|
| 41 |
-
except ImportError:
|
| 42 |
-
HAS_SENTENCE_TRANSFORMERS = False
|
| 43 |
|
| 44 |
try:
|
| 45 |
import faiss
|
|
@@ -60,208 +39,168 @@ except ImportError:
|
|
| 60 |
HAS_BM25 = False
|
| 61 |
|
| 62 |
|
| 63 |
-
# =============================================================================
|
| 64 |
-
# ENUMS AND DATA CLASSES
|
| 65 |
-
# =============================================================================
|
| 66 |
-
|
| 67 |
-
class QueryIntent(Enum):
|
| 68 |
-
"""Query intent types for smart routing"""
|
| 69 |
-
FACTUAL = "factual"
|
| 70 |
-
ANALYTICAL = "analytical"
|
| 71 |
-
PROCEDURAL = "procedural"
|
| 72 |
-
EXPLORATORY = "exploratory"
|
| 73 |
-
NAVIGATIONAL = "navigational"
|
| 74 |
-
TRANSACTIONAL = "transactional"
|
| 75 |
-
|
| 76 |
-
|
| 77 |
@dataclass
|
| 78 |
class Memory:
|
| 79 |
-
"""A single memory unit"""
|
| 80 |
id: str
|
| 81 |
content: str
|
| 82 |
embedding: np.ndarray
|
|
|
|
|
|
|
|
|
|
|
|
|
| 83 |
metadata: Dict = field(default_factory=dict)
|
| 84 |
created_at: float = field(default_factory=time.time)
|
| 85 |
|
| 86 |
|
| 87 |
-
@dataclass
|
| 88 |
class SearchResult:
|
| 89 |
-
"""Search result with multi-strategy scores"""
|
| 90 |
id: str
|
| 91 |
content: str
|
| 92 |
score: float
|
|
|
|
| 93 |
strategy_scores: Dict[str, float] = field(default_factory=dict)
|
| 94 |
metadata: Dict = field(default_factory=dict)
|
| 95 |
|
| 96 |
|
| 97 |
-
#
|
| 98 |
-
# SMART MEMORY INJECTION
|
| 99 |
-
# =============================================================================
|
| 100 |
-
|
| 101 |
-
# Keywords that indicate query needs prior context
|
| 102 |
MEMORY_INJECTION_SIGNALS = [
|
| 103 |
-
# Explicit references
|
| 104 |
"previous", "earlier", "before", "you said", "you mentioned",
|
| 105 |
"as you", "based on", "using your", "your analysis", "your framework",
|
| 106 |
"we discussed", "we analyzed", "refer to", "from your",
|
| 107 |
-
# Synthesis indicators
|
| 108 |
"compare", "contrast", "synthesize", "combine", "integrate",
|
| 109 |
-
# Application indicators
|
| 110 |
"apply your", "using your", "based on your",
|
| 111 |
-
# Context expectations
|
| 112 |
"you previously", "your earlier", "you have analyzed"
|
| 113 |
]
|
| 114 |
|
| 115 |
-
|
| 116 |
-
|
| 117 |
-
Smart context-check
|
| 118 |
-
|
| 119 |
-
Based on benchmark testing showing 90% accuracy with this approach.
|
| 120 |
-
|
| 121 |
-
Args:
|
| 122 |
-
query: The user's question
|
| 123 |
-
context: Optional additional context
|
| 124 |
-
|
| 125 |
-
Returns:
|
| 126 |
-
Tuple of (should_inject: bool, reason: str)
|
| 127 |
-
|
| 128 |
-
Example:
|
| 129 |
-
>>> should_inject_memory("What is Python?")
|
| 130 |
-
(False, 'no_signal')
|
| 131 |
-
>>> should_inject_memory("Based on your previous analysis, explain...")
|
| 132 |
-
(True, 'signal:previous')
|
| 133 |
-
"""
|
| 134 |
combined = (query + " " + context).lower()
|
| 135 |
|
| 136 |
for signal in MEMORY_INJECTION_SIGNALS:
|
| 137 |
if signal in combined:
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 138 |
return True, f"signal:{signal}"
|
| 139 |
|
| 140 |
return False, "no_signal"
|
| 141 |
|
| 142 |
|
| 143 |
-
|
| 144 |
-
|
| 145 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 146 |
|
| 147 |
class Mnemo:
|
| 148 |
"""
|
| 149 |
-
Mnemo
|
| 150 |
-
|
| 151 |
-
|
| 152 |
-
-
|
| 153 |
-
-
|
| 154 |
-
- Multi-strategy retrieval (semantic + BM25 + graph)
|
| 155 |
-
- Query intent detection
|
| 156 |
-
- Feedback learning
|
| 157 |
-
- Knowledge graph
|
| 158 |
-
|
| 159 |
-
Example:
|
| 160 |
-
m = Mnemo()
|
| 161 |
-
m.add("User likes coffee with 2 sugars")
|
| 162 |
-
|
| 163 |
-
# Check if memory should be used
|
| 164 |
-
if m.should_inject("Based on user preferences..."):
|
| 165 |
-
results = m.search("coffee preferences")
|
| 166 |
-
context = m.get_context("preferences", top_k=3)
|
| 167 |
"""
|
| 168 |
|
| 169 |
-
#
|
| 170 |
-
|
| 171 |
-
|
| 172 |
-
|
| 173 |
-
|
| 174 |
-
|
| 175 |
-
|
| 176 |
-
|
| 177 |
-
|
| 178 |
-
|
| 179 |
-
STOP_WORDS = {"a", "an", "the", "is", "are", "was", "were", "be", "been", "have", "has",
|
| 180 |
-
"do", "does", "did", "will", "would", "could", "should", "may", "might",
|
| 181 |
-
"to", "of", "in", "for", "on", "with", "at", "by", "from", "as", "into",
|
| 182 |
-
"and", "but", "or", "not", "this", "that", "these", "those", "i", "me", "my"}
|
| 183 |
-
|
| 184 |
-
def __init__(self,
|
| 185 |
-
embedding_model: str = "all-MiniLM-L6-v2",
|
| 186 |
embedding_dim: int = 384,
|
|
|
|
|
|
|
| 187 |
semantic_weight: float = 0.5,
|
| 188 |
bm25_weight: float = 0.3,
|
| 189 |
-
graph_weight: float = 0.2
|
| 190 |
-
|
| 191 |
-
"""
|
| 192 |
-
Initialize Mnemo.
|
| 193 |
-
|
| 194 |
-
Args:
|
| 195 |
-
embedding_model: Sentence-transformer model name (default: all-MiniLM-L6-v2)
|
| 196 |
-
embedding_dim: Dimension for embeddings (default 384)
|
| 197 |
-
semantic_weight: Weight for semantic search (default 0.5)
|
| 198 |
-
bm25_weight: Weight for BM25 keyword search (default 0.3)
|
| 199 |
-
graph_weight: Weight for graph traversal (default 0.2)
|
| 200 |
-
use_real_embeddings: Use sentence-transformers if available (default True)
|
| 201 |
-
"""
|
| 202 |
self.embedding_dim = embedding_dim
|
|
|
|
|
|
|
| 203 |
self.semantic_weight = semantic_weight
|
| 204 |
self.bm25_weight = bm25_weight
|
| 205 |
self.graph_weight = graph_weight
|
| 206 |
|
| 207 |
-
# Initialize embedding model
|
| 208 |
-
self._embedding_model = None
|
| 209 |
-
self._use_real_embeddings = use_real_embeddings and HAS_SENTENCE_TRANSFORMERS
|
| 210 |
-
|
| 211 |
-
if self._use_real_embeddings:
|
| 212 |
-
try:
|
| 213 |
-
self._embedding_model = SentenceTransformer(embedding_model)
|
| 214 |
-
self.embedding_dim = self._embedding_model.get_sentence_embedding_dimension()
|
| 215 |
-
except Exception as e:
|
| 216 |
-
print(f"Warning: Could not load {embedding_model}: {e}")
|
| 217 |
-
print("Falling back to hash-based embeddings.")
|
| 218 |
-
self._use_real_embeddings = False
|
| 219 |
-
|
| 220 |
-
# Storage
|
| 221 |
self.memories: Dict[str, Memory] = {}
|
|
|
|
| 222 |
self._embeddings: List[np.ndarray] = []
|
| 223 |
self._ids: List[str] = []
|
| 224 |
|
| 225 |
-
# FAISS index
|
| 226 |
if HAS_FAISS:
|
| 227 |
-
self.index = faiss.IndexFlatIP(
|
| 228 |
else:
|
| 229 |
self.index = None
|
| 230 |
|
| 231 |
-
# BM25
|
| 232 |
self.bm25 = None
|
| 233 |
self._tokenized_docs: List[List[str]] = []
|
| 234 |
|
| 235 |
-
# Knowledge Graph
|
| 236 |
if HAS_NETWORKX:
|
| 237 |
self.graph = nx.DiGraph()
|
| 238 |
else:
|
| 239 |
self.graph = None
|
| 240 |
|
| 241 |
-
# Feedback learning
|
| 242 |
self._doc_boosts: Dict[str, float] = defaultdict(float)
|
| 243 |
self._query_doc_scores: Dict[str, Dict[str, float]] = defaultdict(dict)
|
| 244 |
-
self._feedback_count = 0
|
| 245 |
|
| 246 |
-
# Cache
|
| 247 |
self._cache: Dict[str, Any] = {}
|
| 248 |
self._cache_lock = threading.Lock()
|
| 249 |
|
| 250 |
-
# Stats
|
| 251 |
self.stats = {
|
| 252 |
-
"adds": 0,
|
| 253 |
-
"
|
| 254 |
-
"
|
| 255 |
-
"
|
| 256 |
-
"cache_misses": 0,
|
| 257 |
-
"strategy_wins": defaultdict(int),
|
| 258 |
-
"injections_triggered": 0,
|
| 259 |
-
"injections_skipped": 0
|
| 260 |
}
|
| 261 |
|
| 262 |
def _get_embedding(self, text: str) -> np.ndarray:
|
| 263 |
-
"""Generate embedding for text using real model or hash fallback"""
|
| 264 |
-
# Check cache
|
| 265 |
cache_key = f"emb:{hashlib.md5(text.encode()).hexdigest()}"
|
| 266 |
with self._cache_lock:
|
| 267 |
if cache_key in self._cache:
|
|
@@ -269,19 +208,12 @@ class Mnemo:
|
|
| 269 |
return self._cache[cache_key]
|
| 270 |
self.stats["cache_misses"] += 1
|
| 271 |
|
| 272 |
-
|
| 273 |
-
|
| 274 |
-
|
| 275 |
-
|
| 276 |
-
|
| 277 |
-
|
| 278 |
-
embedding = np.zeros(self.embedding_dim, dtype=np.float32)
|
| 279 |
-
words = text.lower().split()
|
| 280 |
-
for i, word in enumerate(words):
|
| 281 |
-
idx = hash(word) % self.embedding_dim
|
| 282 |
-
embedding[idx] += 1.0 / (i + 1)
|
| 283 |
-
|
| 284 |
-
# Normalize
|
| 285 |
norm = np.linalg.norm(embedding)
|
| 286 |
if norm > 0:
|
| 287 |
embedding = embedding / norm
|
|
@@ -291,20 +223,8 @@ class Mnemo:
|
|
| 291 |
|
| 292 |
return embedding
|
| 293 |
|
| 294 |
-
def should_inject(self, query: str, context: str = "") -> bool:
|
| 295 |
-
|
| 296 |
-
Check if memory should be injected for this query.
|
| 297 |
-
|
| 298 |
-
Uses context-check algorithm with 90% accuracy based on benchmarks.
|
| 299 |
-
|
| 300 |
-
Args:
|
| 301 |
-
query: The user's question
|
| 302 |
-
context: Optional additional context
|
| 303 |
-
|
| 304 |
-
Returns:
|
| 305 |
-
True if memory should be injected, False otherwise
|
| 306 |
-
"""
|
| 307 |
-
should, reason = should_inject_memory(query, context)
|
| 308 |
|
| 309 |
if should:
|
| 310 |
self.stats["injections_triggered"] += 1
|
|
@@ -313,100 +233,44 @@ class Mnemo:
|
|
| 313 |
|
| 314 |
return should
|
| 315 |
|
| 316 |
-
def
|
| 317 |
-
|
| 318 |
-
Get formatted memory context for injection into prompts.
|
| 319 |
-
|
| 320 |
-
Args:
|
| 321 |
-
query: Search query
|
| 322 |
-
top_k: Number of memories to retrieve
|
| 323 |
-
threshold: Minimum similarity score (0-1)
|
| 324 |
-
|
| 325 |
-
Returns:
|
| 326 |
-
Formatted context string ready for prompt injection
|
| 327 |
-
"""
|
| 328 |
-
results = self.search(query, top_k=top_k)
|
| 329 |
-
|
| 330 |
-
# Filter by threshold
|
| 331 |
-
results = [r for r in results if r.score >= threshold]
|
| 332 |
-
|
| 333 |
-
if not results:
|
| 334 |
-
return ""
|
| 335 |
-
|
| 336 |
-
context_parts = ["[RELEVANT CONTEXT FROM MEMORY]"]
|
| 337 |
-
for r in results:
|
| 338 |
-
context_parts.append(f"• {r.content}")
|
| 339 |
-
context_parts.append("[END CONTEXT]\n")
|
| 340 |
-
|
| 341 |
-
return "\n".join(context_parts)
|
| 342 |
-
|
| 343 |
-
def _detect_intent(self, query: str) -> Tuple[QueryIntent, float]:
|
| 344 |
-
"""Detect query intent for smart routing"""
|
| 345 |
-
query_lower = query.lower()
|
| 346 |
|
| 347 |
-
|
| 348 |
-
for pattern in patterns:
|
| 349 |
-
if re.search(pattern, query_lower):
|
| 350 |
-
return intent, 0.85
|
| 351 |
|
| 352 |
-
|
| 353 |
-
|
| 354 |
-
|
| 355 |
-
"""Extract keywords from text"""
|
| 356 |
-
words = re.findall(r'\b\w+\b', text.lower())
|
| 357 |
-
return [w for w in words if w not in self.STOP_WORDS and len(w) > 2]
|
| 358 |
-
|
| 359 |
-
def _rebuild_bm25(self):
|
| 360 |
-
"""Rebuild BM25 index"""
|
| 361 |
-
if HAS_BM25 and self._tokenized_docs:
|
| 362 |
-
self.bm25 = BM25Okapi(self._tokenized_docs)
|
| 363 |
-
|
| 364 |
-
def add(self, content: str, metadata: Dict = None, memory_id: str = None) -> str:
|
| 365 |
-
"""
|
| 366 |
-
Add a memory.
|
| 367 |
|
| 368 |
-
|
| 369 |
-
content: Text content to store
|
| 370 |
-
metadata: Optional metadata dict
|
| 371 |
-
memory_id: Optional custom ID (auto-generated if not provided)
|
| 372 |
-
|
| 373 |
-
Returns:
|
| 374 |
-
Memory ID
|
| 375 |
-
"""
|
| 376 |
-
# Generate ID
|
| 377 |
-
if memory_id is None:
|
| 378 |
-
memory_id = f"mem_{hashlib.md5(content.encode()).hexdigest()[:8]}"
|
| 379 |
-
|
| 380 |
-
# Get embedding
|
| 381 |
embedding = self._get_embedding(content)
|
| 382 |
|
| 383 |
-
# Create memory
|
| 384 |
memory = Memory(
|
| 385 |
id=memory_id,
|
| 386 |
content=content,
|
| 387 |
embedding=embedding,
|
|
|
|
|
|
|
| 388 |
metadata=metadata or {}
|
| 389 |
)
|
| 390 |
|
| 391 |
-
# Store
|
| 392 |
self.memories[memory_id] = memory
|
|
|
|
| 393 |
self._embeddings.append(embedding)
|
| 394 |
self._ids.append(memory_id)
|
| 395 |
|
| 396 |
-
# Update FAISS
|
| 397 |
if HAS_FAISS and self.index is not None:
|
| 398 |
self.index.add(embedding.reshape(1, -1))
|
| 399 |
|
| 400 |
-
# Update BM25
|
| 401 |
tokens = content.lower().split()
|
| 402 |
self._tokenized_docs.append(tokens)
|
| 403 |
-
|
|
|
|
| 404 |
|
| 405 |
-
# Update graph
|
| 406 |
if HAS_NETWORKX and self.graph is not None:
|
| 407 |
-
self.graph.add_node(memory_id, content=content,
|
| 408 |
-
keywords = self.
|
| 409 |
-
for kw in keywords
|
| 410 |
entity_id = f"entity_{kw}"
|
| 411 |
if not self.graph.has_node(entity_id):
|
| 412 |
self.graph.add_node(entity_id, type="keyword")
|
|
@@ -415,43 +279,26 @@ class Mnemo:
|
|
| 415 |
self.stats["adds"] += 1
|
| 416 |
return memory_id
|
| 417 |
|
| 418 |
-
def search(self, query: str, top_k: int = 5) -> List[SearchResult]:
|
| 419 |
-
"""
|
| 420 |
-
Search memories using multi-strategy retrieval.
|
| 421 |
-
|
| 422 |
-
Args:
|
| 423 |
-
query: Search query
|
| 424 |
-
top_k: Number of results to return
|
| 425 |
-
|
| 426 |
-
Returns:
|
| 427 |
-
List of SearchResult objects
|
| 428 |
-
"""
|
| 429 |
if not self.memories:
|
| 430 |
return []
|
| 431 |
|
| 432 |
self.stats["searches"] += 1
|
| 433 |
-
|
| 434 |
-
# Detect intent
|
| 435 |
-
intent, confidence = self._detect_intent(query)
|
| 436 |
-
|
| 437 |
-
# Get query embedding
|
| 438 |
query_embedding = self._get_embedding(query)
|
| 439 |
|
| 440 |
-
#
|
| 441 |
semantic_scores = {}
|
| 442 |
if HAS_FAISS and self.index is not None and self.index.ntotal > 0:
|
| 443 |
-
k = min(top_k *
|
| 444 |
scores, indices = self.index.search(query_embedding.reshape(1, -1), k)
|
| 445 |
for score, idx in zip(scores[0], indices[0]):
|
| 446 |
-
if
|
| 447 |
semantic_scores[self._ids[idx]] = float(score)
|
| 448 |
else:
|
| 449 |
-
# Fallback: numpy dot product
|
| 450 |
for mem_id, embedding in zip(self._ids, self._embeddings):
|
| 451 |
-
|
| 452 |
-
semantic_scores[mem_id] = score
|
| 453 |
|
| 454 |
-
#
|
| 455 |
bm25_scores = {}
|
| 456 |
if HAS_BM25 and self.bm25 is not None:
|
| 457 |
tokens = query.lower().split()
|
|
@@ -461,10 +308,10 @@ class Mnemo:
|
|
| 461 |
if score > 0.1 * max_score:
|
| 462 |
bm25_scores[self._ids[idx]] = float(score / max_score)
|
| 463 |
|
| 464 |
-
#
|
| 465 |
graph_scores = {}
|
| 466 |
if HAS_NETWORKX and self.graph is not None:
|
| 467 |
-
keywords = self.
|
| 468 |
for kw in keywords:
|
| 469 |
entity_id = f"entity_{kw}"
|
| 470 |
if self.graph.has_node(entity_id):
|
|
@@ -472,256 +319,166 @@ class Mnemo:
|
|
| 472 |
if neighbor.startswith("mem_"):
|
| 473 |
graph_scores[neighbor] = graph_scores.get(neighbor, 0) + 0.5
|
| 474 |
|
| 475 |
-
# Combine
|
| 476 |
all_ids = set(semantic_scores.keys()) | set(bm25_scores.keys()) | set(graph_scores.keys())
|
| 477 |
|
|
|
|
|
|
|
|
|
|
| 478 |
results = []
|
| 479 |
for mem_id in all_ids:
|
| 480 |
-
|
| 481 |
"semantic": semantic_scores.get(mem_id, 0),
|
| 482 |
"bm25": bm25_scores.get(mem_id, 0),
|
| 483 |
"graph": graph_scores.get(mem_id, 0)
|
| 484 |
}
|
| 485 |
|
| 486 |
-
# Weighted combination
|
| 487 |
combined = (
|
| 488 |
-
self.semantic_weight *
|
| 489 |
-
self.bm25_weight *
|
| 490 |
-
self.graph_weight *
|
| 491 |
)
|
| 492 |
|
| 493 |
-
#
|
| 494 |
-
|
| 495 |
-
combined +=
|
|
|
|
| 496 |
|
| 497 |
memory = self.memories.get(mem_id)
|
| 498 |
if memory:
|
| 499 |
-
|
| 500 |
-
|
| 501 |
-
|
| 502 |
-
|
| 503 |
-
|
| 504 |
-
|
| 505 |
-
|
| 506 |
-
|
| 507 |
-
|
|
|
|
|
|
|
| 508 |
results.sort(key=lambda x: x.score, reverse=True)
|
| 509 |
|
| 510 |
-
#
|
| 511 |
if results:
|
| 512 |
-
|
| 513 |
-
winning_strategy = max(top_result.strategy_scores, key=top_result.strategy_scores.get)
|
| 514 |
-
self.stats["strategy_wins"][winning_strategy] += 1
|
| 515 |
|
| 516 |
return results[:top_k]
|
| 517 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 518 |
def feedback(self, query: str, memory_id: str, relevance: float):
|
| 519 |
-
"""
|
| 520 |
-
Record feedback to improve future searches.
|
| 521 |
-
|
| 522 |
-
Args:
|
| 523 |
-
query: The search query
|
| 524 |
-
memory_id: ID of the memory
|
| 525 |
-
relevance: Relevance score (-1 to 1, negative = irrelevant)
|
| 526 |
-
"""
|
| 527 |
relevance = max(-1, min(1, relevance))
|
| 528 |
-
|
| 529 |
self._doc_boosts[memory_id] += 0.1 * relevance
|
| 530 |
|
| 531 |
query_key = " ".join(sorted(set(query.lower().split()))[:5])
|
| 532 |
current = self._query_doc_scores[query_key].get(memory_id, 0)
|
| 533 |
self._query_doc_scores[query_key][memory_id] = current + 0.1 * relevance
|
| 534 |
|
| 535 |
-
self.
|
| 536 |
-
|
| 537 |
-
|
| 538 |
-
|
| 539 |
-
|
| 540 |
-
query_key = " ".join(sorted(set(query.lower().split()))[:5])
|
| 541 |
-
|
| 542 |
-
global_boost = self._doc_boosts.get(memory_id, 0)
|
| 543 |
-
query_boost = self._query_doc_scores.get(query_key, {}).get(memory_id, 0)
|
| 544 |
|
| 545 |
-
|
| 546 |
|
| 547 |
def get(self, memory_id: str) -> Optional[Memory]:
|
| 548 |
-
"""Get a specific memory by ID"""
|
| 549 |
return self.memories.get(memory_id)
|
| 550 |
|
| 551 |
def delete(self, memory_id: str) -> bool:
|
| 552 |
-
"""Delete a memory"""
|
| 553 |
if memory_id in self.memories:
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 554 |
del self.memories[memory_id]
|
| 555 |
return True
|
| 556 |
return False
|
| 557 |
|
| 558 |
-
def list_all(self) -> List[Memory]:
|
| 559 |
-
|
|
|
|
| 560 |
return list(self.memories.values())
|
| 561 |
|
| 562 |
def get_stats(self) -> Dict:
|
| 563 |
-
"""Get system statistics"""
|
| 564 |
return {
|
| 565 |
"total_memories": len(self.memories),
|
|
|
|
| 566 |
"adds": self.stats["adds"],
|
|
|
|
| 567 |
"searches": self.stats["searches"],
|
| 568 |
-
"
|
| 569 |
-
"
|
| 570 |
-
"
|
| 571 |
-
"
|
| 572 |
-
"injections_skipped": self.stats["injections_skipped"],
|
| 573 |
-
"has_real_embeddings": self._use_real_embeddings,
|
| 574 |
"has_faiss": HAS_FAISS,
|
| 575 |
"has_bm25": HAS_BM25,
|
| 576 |
"has_graph": HAS_NETWORKX
|
| 577 |
}
|
| 578 |
|
| 579 |
-
def
|
| 580 |
-
|
| 581 |
-
|
| 582 |
-
|
| 583 |
-
|
| 584 |
-
|
| 585 |
-
|
| 586 |
-
|
| 587 |
-
|
| 588 |
-
|
| 589 |
-
|
| 590 |
-
|
| 591 |
-
|
| 592 |
-
|
| 593 |
-
|
| 594 |
-
|
| 595 |
-
if HAS_NETWORKX:
|
| 596 |
-
self.graph = nx.DiGraph()
|
| 597 |
|
| 598 |
def __len__(self):
|
| 599 |
return len(self.memories)
|
| 600 |
|
| 601 |
def __repr__(self):
|
| 602 |
-
|
| 603 |
-
return f"Mnemo(memories={len(self.memories)}, embeddings={emb_type})"
|
| 604 |
|
| 605 |
|
| 606 |
-
# =============================================================================
|
| 607 |
-
# MCP SERVER TOOLS
|
| 608 |
-
# =============================================================================
|
| 609 |
-
|
| 610 |
-
def create_mcp_tools(mnemo: Mnemo) -> Dict:
|
| 611 |
-
"""
|
| 612 |
-
Create MCP-compatible tool definitions for Mnemo.
|
| 613 |
-
|
| 614 |
-
Returns dict with tool schemas for Claude MCP integration.
|
| 615 |
-
"""
|
| 616 |
-
return {
|
| 617 |
-
"add_memory": {
|
| 618 |
-
"description": "Store a new memory",
|
| 619 |
-
"parameters": {
|
| 620 |
-
"type": "object",
|
| 621 |
-
"properties": {
|
| 622 |
-
"content": {"type": "string", "description": "Memory content to store"},
|
| 623 |
-
"metadata": {"type": "object", "description": "Optional metadata"}
|
| 624 |
-
},
|
| 625 |
-
"required": ["content"]
|
| 626 |
-
}
|
| 627 |
-
},
|
| 628 |
-
"search_memory": {
|
| 629 |
-
"description": "Search stored memories",
|
| 630 |
-
"parameters": {
|
| 631 |
-
"type": "object",
|
| 632 |
-
"properties": {
|
| 633 |
-
"query": {"type": "string", "description": "Search query"},
|
| 634 |
-
"top_k": {"type": "integer", "description": "Number of results", "default": 5}
|
| 635 |
-
},
|
| 636 |
-
"required": ["query"]
|
| 637 |
-
}
|
| 638 |
-
},
|
| 639 |
-
"should_inject": {
|
| 640 |
-
"description": "Check if memory should be injected for a query",
|
| 641 |
-
"parameters": {
|
| 642 |
-
"type": "object",
|
| 643 |
-
"properties": {
|
| 644 |
-
"query": {"type": "string", "description": "The query to check"},
|
| 645 |
-
"context": {"type": "string", "description": "Optional context"}
|
| 646 |
-
},
|
| 647 |
-
"required": ["query"]
|
| 648 |
-
}
|
| 649 |
-
},
|
| 650 |
-
"get_context": {
|
| 651 |
-
"description": "Get formatted memory context for prompt injection",
|
| 652 |
-
"parameters": {
|
| 653 |
-
"type": "object",
|
| 654 |
-
"properties": {
|
| 655 |
-
"query": {"type": "string", "description": "Search query"},
|
| 656 |
-
"top_k": {"type": "integer", "description": "Number of memories", "default": 3}
|
| 657 |
-
},
|
| 658 |
-
"required": ["query"]
|
| 659 |
-
}
|
| 660 |
-
},
|
| 661 |
-
"get_stats": {
|
| 662 |
-
"description": "Get memory system statistics",
|
| 663 |
-
"parameters": {"type": "object", "properties": {}}
|
| 664 |
-
}
|
| 665 |
-
}
|
| 666 |
-
|
| 667 |
-
|
| 668 |
-
# =============================================================================
|
| 669 |
-
# DEMO
|
| 670 |
-
# =============================================================================
|
| 671 |
-
|
| 672 |
def demo():
|
| 673 |
-
""
|
| 674 |
-
print("
|
| 675 |
-
print("
|
| 676 |
-
|
| 677 |
-
|
| 678 |
-
m
|
| 679 |
-
print(f"
|
| 680 |
-
|
| 681 |
-
|
| 682 |
-
|
| 683 |
-
|
| 684 |
-
|
| 685 |
-
|
| 686 |
-
|
| 687 |
-
|
| 688 |
-
|
| 689 |
-
|
| 690 |
-
print("
|
| 691 |
-
|
| 692 |
-
|
| 693 |
-
print(f"
|
| 694 |
-
|
| 695 |
-
|
| 696 |
-
print("
|
| 697 |
-
|
| 698 |
-
test_queries = [
|
| 699 |
-
("What is Python?", ""),
|
| 700 |
-
("Based on your previous analysis, explain the bias", ""),
|
| 701 |
-
("Apply your framework to this case", ""),
|
| 702 |
-
("What time is it?", ""),
|
| 703 |
-
("Compare this to your earlier findings", ""),
|
| 704 |
-
]
|
| 705 |
-
|
| 706 |
-
for query, context in test_queries:
|
| 707 |
-
should = m.should_inject(query, context)
|
| 708 |
-
status = "✓ INJECT" if should else "✗ SKIP"
|
| 709 |
-
print(f" {status}: {query[:50]}")
|
| 710 |
-
|
| 711 |
-
# Search with context
|
| 712 |
-
print("\n🔍 Getting context for injection...")
|
| 713 |
-
context = m.get_context("previous analysis framework", top_k=2)
|
| 714 |
-
print(context if context else " (No relevant context found)")
|
| 715 |
-
|
| 716 |
-
# Stats
|
| 717 |
-
print("\n📊 Stats:")
|
| 718 |
-
stats = m.get_stats()
|
| 719 |
-
for k, v in stats.items():
|
| 720 |
-
print(f" {k}: {v}")
|
| 721 |
-
|
| 722 |
-
print("\n" + "=" * 60)
|
| 723 |
-
print("✅ Demo complete!")
|
| 724 |
-
print("=" * 60)
|
| 725 |
|
| 726 |
|
| 727 |
if __name__ == "__main__":
|
|
|
|
| 1 |
+
#!/usr/bin/env python3
|
| 2 |
"""
|
| 3 |
+
Mnemo v3 TUNED - Final Version with Optimized Parameters
|
| 4 |
+
=========================================================
|
|
|
|
| 5 |
|
| 6 |
+
Based on benchmark testing:
|
| 7 |
+
- Optimal similarity threshold: 0.4-0.5 (not 0.6)
|
| 8 |
+
- Quality threshold: 0.35
|
| 9 |
+
- Context window detection enabled
|
| 10 |
+
- Relevance re-ranking enabled
|
| 11 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 12 |
"""
|
| 13 |
|
| 14 |
import hashlib
|
|
|
|
| 16 |
import re
|
| 17 |
import threading
|
| 18 |
import numpy as np
|
| 19 |
+
from typing import Dict, List, Optional, Tuple, Any, Callable
|
| 20 |
from dataclasses import dataclass, field
|
| 21 |
from collections import defaultdict
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 22 |
|
| 23 |
try:
|
| 24 |
import faiss
|
|
|
|
| 39 |
HAS_BM25 = False
|
| 40 |
|
| 41 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 42 |
@dataclass
|
| 43 |
class Memory:
|
|
|
|
| 44 |
id: str
|
| 45 |
content: str
|
| 46 |
embedding: np.ndarray
|
| 47 |
+
namespace: str = "default"
|
| 48 |
+
quality_score: float = 1.0
|
| 49 |
+
access_count: int = 0
|
| 50 |
+
usefulness_score: float = 0.5
|
| 51 |
metadata: Dict = field(default_factory=dict)
|
| 52 |
created_at: float = field(default_factory=time.time)
|
| 53 |
|
| 54 |
|
| 55 |
+
@dataclass
|
| 56 |
class SearchResult:
|
|
|
|
| 57 |
id: str
|
| 58 |
content: str
|
| 59 |
score: float
|
| 60 |
+
relevance_score: float = 0.0
|
| 61 |
strategy_scores: Dict[str, float] = field(default_factory=dict)
|
| 62 |
metadata: Dict = field(default_factory=dict)
|
| 63 |
|
| 64 |
|
| 65 |
+
# Smart injection signals
|
|
|
|
|
|
|
|
|
|
|
|
|
| 66 |
MEMORY_INJECTION_SIGNALS = [
|
|
|
|
| 67 |
"previous", "earlier", "before", "you said", "you mentioned",
|
| 68 |
"as you", "based on", "using your", "your analysis", "your framework",
|
| 69 |
"we discussed", "we analyzed", "refer to", "from your",
|
|
|
|
| 70 |
"compare", "contrast", "synthesize", "combine", "integrate",
|
|
|
|
| 71 |
"apply your", "using your", "based on your",
|
|
|
|
| 72 |
"you previously", "your earlier", "you have analyzed"
|
| 73 |
]
|
| 74 |
|
| 75 |
+
|
| 76 |
+
def should_inject_memory(query: str, context: str = "", conversation_history: str = "") -> Tuple[bool, str]:
|
| 77 |
+
"""Smart context-check with 90% accuracy"""
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 78 |
combined = (query + " " + context).lower()
|
| 79 |
|
| 80 |
for signal in MEMORY_INJECTION_SIGNALS:
|
| 81 |
if signal in combined:
|
| 82 |
+
# Check if conversation already has context
|
| 83 |
+
if conversation_history and len(conversation_history.split()) > 500:
|
| 84 |
+
query_kws = set(query.lower().split()) - {"the", "a", "is", "are", "to", "of"}
|
| 85 |
+
if sum(1 for kw in query_kws if kw in conversation_history.lower()) >= len(query_kws) * 0.7:
|
| 86 |
+
return False, "context_window_has_info"
|
| 87 |
return True, f"signal:{signal}"
|
| 88 |
|
| 89 |
return False, "no_signal"
|
| 90 |
|
| 91 |
|
| 92 |
+
def estimate_quality(content: str) -> float:
|
| 93 |
+
"""Estimate content quality before storing"""
|
| 94 |
+
score = 0.5
|
| 95 |
+
words = len(content.split())
|
| 96 |
+
|
| 97 |
+
if words < 5:
|
| 98 |
+
score -= 0.3
|
| 99 |
+
elif words > 20:
|
| 100 |
+
score += 0.1
|
| 101 |
+
|
| 102 |
+
if any(r in content.lower() for r in ["because", "therefore", "shows", "indicates"]):
|
| 103 |
+
score += 0.2
|
| 104 |
+
|
| 105 |
+
if re.search(r'\d+', content):
|
| 106 |
+
score += 0.1
|
| 107 |
+
|
| 108 |
+
if any(v in content.lower() for v in ["something", "stuff", "maybe"]):
|
| 109 |
+
score -= 0.2
|
| 110 |
+
|
| 111 |
+
if any(e in content.lower() for e in ["error", "failed", "wrong"]):
|
| 112 |
+
score -= 0.3
|
| 113 |
+
|
| 114 |
+
return max(0.0, min(1.0, score))
|
| 115 |
+
|
| 116 |
+
|
| 117 |
+
def rerank_by_relevance(query: str, results: List[SearchResult]) -> List[SearchResult]:
|
| 118 |
+
"""Re-rank by task relevance"""
|
| 119 |
+
query_lower = query.lower()
|
| 120 |
+
query_kws = set(query_lower.split()) - {"the", "a", "is", "are", "to", "of"}
|
| 121 |
+
|
| 122 |
+
for result in results:
|
| 123 |
+
content_lower = result.content.lower()
|
| 124 |
+
content_words = set(content_lower.split())
|
| 125 |
+
|
| 126 |
+
overlap = len(query_kws & content_words) / max(len(query_kws), 1)
|
| 127 |
+
|
| 128 |
+
qa_bonus = 0
|
| 129 |
+
if "why" in query_lower and "because" in content_lower:
|
| 130 |
+
qa_bonus = 0.2
|
| 131 |
+
if "compare" in query_lower and any(w in content_lower for w in ["differ", "similar", "both"]):
|
| 132 |
+
qa_bonus = 0.3
|
| 133 |
+
|
| 134 |
+
result.relevance_score = overlap * 0.5 + qa_bonus + result.score * 0.3
|
| 135 |
+
|
| 136 |
+
results.sort(key=lambda x: x.relevance_score, reverse=True)
|
| 137 |
+
return results
|
| 138 |
+
|
| 139 |
|
| 140 |
class Mnemo:
|
| 141 |
"""
|
| 142 |
+
Mnemo v3 TUNED - Optimized AI Memory System
|
| 143 |
+
|
| 144 |
+
Tuned parameters based on benchmarks:
|
| 145 |
+
- similarity_threshold: 0.45 (optimal range 0.4-0.5)
|
| 146 |
+
- quality_threshold: 0.35
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 147 |
"""
|
| 148 |
|
| 149 |
+
# TUNED DEFAULTS
|
| 150 |
+
DEFAULT_SIMILARITY_THRESHOLD = 0.45 # TUNED from 0.6
|
| 151 |
+
DEFAULT_QUALITY_THRESHOLD = 0.35 # TUNED from 0.4
|
| 152 |
+
|
| 153 |
+
STOP_WORDS = {"a", "an", "the", "is", "are", "was", "were", "be", "been",
|
| 154 |
+
"to", "of", "in", "for", "on", "with", "at", "by", "from",
|
| 155 |
+
"and", "but", "or", "not", "this", "that", "i", "me", "my"}
|
| 156 |
+
|
| 157 |
+
def __init__(self,
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 158 |
embedding_dim: int = 384,
|
| 159 |
+
similarity_threshold: float = 0.45, # TUNED
|
| 160 |
+
quality_threshold: float = 0.35, # TUNED
|
| 161 |
semantic_weight: float = 0.5,
|
| 162 |
bm25_weight: float = 0.3,
|
| 163 |
+
graph_weight: float = 0.2):
|
| 164 |
+
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 165 |
self.embedding_dim = embedding_dim
|
| 166 |
+
self.similarity_threshold = similarity_threshold
|
| 167 |
+
self.quality_threshold = quality_threshold
|
| 168 |
self.semantic_weight = semantic_weight
|
| 169 |
self.bm25_weight = bm25_weight
|
| 170 |
self.graph_weight = graph_weight
|
| 171 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 172 |
self.memories: Dict[str, Memory] = {}
|
| 173 |
+
self.namespaces: Dict[str, List[str]] = defaultdict(list)
|
| 174 |
self._embeddings: List[np.ndarray] = []
|
| 175 |
self._ids: List[str] = []
|
| 176 |
|
|
|
|
| 177 |
if HAS_FAISS:
|
| 178 |
+
self.index = faiss.IndexFlatIP(embedding_dim)
|
| 179 |
else:
|
| 180 |
self.index = None
|
| 181 |
|
|
|
|
| 182 |
self.bm25 = None
|
| 183 |
self._tokenized_docs: List[List[str]] = []
|
| 184 |
|
|
|
|
| 185 |
if HAS_NETWORKX:
|
| 186 |
self.graph = nx.DiGraph()
|
| 187 |
else:
|
| 188 |
self.graph = None
|
| 189 |
|
|
|
|
| 190 |
self._doc_boosts: Dict[str, float] = defaultdict(float)
|
| 191 |
self._query_doc_scores: Dict[str, Dict[str, float]] = defaultdict(dict)
|
|
|
|
| 192 |
|
|
|
|
| 193 |
self._cache: Dict[str, Any] = {}
|
| 194 |
self._cache_lock = threading.Lock()
|
| 195 |
|
|
|
|
| 196 |
self.stats = {
|
| 197 |
+
"adds": 0, "adds_rejected": 0, "searches": 0,
|
| 198 |
+
"results_filtered": 0, "feedback": 0,
|
| 199 |
+
"cache_hits": 0, "cache_misses": 0,
|
| 200 |
+
"injections_triggered": 0, "injections_skipped": 0
|
|
|
|
|
|
|
|
|
|
|
|
|
| 201 |
}
|
| 202 |
|
| 203 |
def _get_embedding(self, text: str) -> np.ndarray:
|
|
|
|
|
|
|
| 204 |
cache_key = f"emb:{hashlib.md5(text.encode()).hexdigest()}"
|
| 205 |
with self._cache_lock:
|
| 206 |
if cache_key in self._cache:
|
|
|
|
| 208 |
return self._cache[cache_key]
|
| 209 |
self.stats["cache_misses"] += 1
|
| 210 |
|
| 211 |
+
embedding = np.zeros(self.embedding_dim, dtype=np.float32)
|
| 212 |
+
words = text.lower().split()
|
| 213 |
+
for i, word in enumerate(words):
|
| 214 |
+
idx = hash(word) % self.embedding_dim
|
| 215 |
+
embedding[idx] += 1.0 / (i + 1)
|
| 216 |
+
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 217 |
norm = np.linalg.norm(embedding)
|
| 218 |
if norm > 0:
|
| 219 |
embedding = embedding / norm
|
|
|
|
| 223 |
|
| 224 |
return embedding
|
| 225 |
|
| 226 |
+
def should_inject(self, query: str, context: str = "", conversation_history: str = "") -> bool:
|
| 227 |
+
should, reason = should_inject_memory(query, context, conversation_history)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 228 |
|
| 229 |
if should:
|
| 230 |
self.stats["injections_triggered"] += 1
|
|
|
|
| 233 |
|
| 234 |
return should
|
| 235 |
|
| 236 |
+
def add(self, content: str, namespace: str = "default",
|
| 237 |
+
metadata: Dict = None, skip_quality_check: bool = False) -> Optional[str]:
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 238 |
|
| 239 |
+
quality = estimate_quality(content)
|
|
|
|
|
|
|
|
|
|
| 240 |
|
| 241 |
+
if not skip_quality_check and quality < self.quality_threshold:
|
| 242 |
+
self.stats["adds_rejected"] += 1
|
| 243 |
+
return None
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 244 |
|
| 245 |
+
memory_id = f"mem_{hashlib.md5(content.encode()).hexdigest()[:8]}"
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 246 |
embedding = self._get_embedding(content)
|
| 247 |
|
|
|
|
| 248 |
memory = Memory(
|
| 249 |
id=memory_id,
|
| 250 |
content=content,
|
| 251 |
embedding=embedding,
|
| 252 |
+
namespace=namespace,
|
| 253 |
+
quality_score=quality,
|
| 254 |
metadata=metadata or {}
|
| 255 |
)
|
| 256 |
|
|
|
|
| 257 |
self.memories[memory_id] = memory
|
| 258 |
+
self.namespaces[namespace].append(memory_id)
|
| 259 |
self._embeddings.append(embedding)
|
| 260 |
self._ids.append(memory_id)
|
| 261 |
|
|
|
|
| 262 |
if HAS_FAISS and self.index is not None:
|
| 263 |
self.index.add(embedding.reshape(1, -1))
|
| 264 |
|
|
|
|
| 265 |
tokens = content.lower().split()
|
| 266 |
self._tokenized_docs.append(tokens)
|
| 267 |
+
if HAS_BM25:
|
| 268 |
+
self.bm25 = BM25Okapi(self._tokenized_docs)
|
| 269 |
|
|
|
|
| 270 |
if HAS_NETWORKX and self.graph is not None:
|
| 271 |
+
self.graph.add_node(memory_id, content=content, namespace=namespace)
|
| 272 |
+
keywords = [w for w in tokens if w not in self.STOP_WORDS and len(w) > 2][:5]
|
| 273 |
+
for kw in keywords:
|
| 274 |
entity_id = f"entity_{kw}"
|
| 275 |
if not self.graph.has_node(entity_id):
|
| 276 |
self.graph.add_node(entity_id, type="keyword")
|
|
|
|
| 279 |
self.stats["adds"] += 1
|
| 280 |
return memory_id
|
| 281 |
|
| 282 |
+
def search(self, query: str, top_k: int = 5, namespace: Optional[str] = None) -> List[SearchResult]:
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 283 |
if not self.memories:
|
| 284 |
return []
|
| 285 |
|
| 286 |
self.stats["searches"] += 1
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 287 |
query_embedding = self._get_embedding(query)
|
| 288 |
|
| 289 |
+
# Semantic search
|
| 290 |
semantic_scores = {}
|
| 291 |
if HAS_FAISS and self.index is not None and self.index.ntotal > 0:
|
| 292 |
+
k = min(top_k * 3, self.index.ntotal)
|
| 293 |
scores, indices = self.index.search(query_embedding.reshape(1, -1), k)
|
| 294 |
for score, idx in zip(scores[0], indices[0]):
|
| 295 |
+
if 0 <= idx < len(self._ids):
|
| 296 |
semantic_scores[self._ids[idx]] = float(score)
|
| 297 |
else:
|
|
|
|
| 298 |
for mem_id, embedding in zip(self._ids, self._embeddings):
|
| 299 |
+
semantic_scores[mem_id] = float(np.dot(query_embedding, embedding))
|
|
|
|
| 300 |
|
| 301 |
+
# BM25
|
| 302 |
bm25_scores = {}
|
| 303 |
if HAS_BM25 and self.bm25 is not None:
|
| 304 |
tokens = query.lower().split()
|
|
|
|
| 308 |
if score > 0.1 * max_score:
|
| 309 |
bm25_scores[self._ids[idx]] = float(score / max_score)
|
| 310 |
|
| 311 |
+
# Graph
|
| 312 |
graph_scores = {}
|
| 313 |
if HAS_NETWORKX and self.graph is not None:
|
| 314 |
+
keywords = [w for w in query.lower().split() if w not in self.STOP_WORDS and len(w) > 2]
|
| 315 |
for kw in keywords:
|
| 316 |
entity_id = f"entity_{kw}"
|
| 317 |
if self.graph.has_node(entity_id):
|
|
|
|
| 319 |
if neighbor.startswith("mem_"):
|
| 320 |
graph_scores[neighbor] = graph_scores.get(neighbor, 0) + 0.5
|
| 321 |
|
| 322 |
+
# Combine
|
| 323 |
all_ids = set(semantic_scores.keys()) | set(bm25_scores.keys()) | set(graph_scores.keys())
|
| 324 |
|
| 325 |
+
if namespace:
|
| 326 |
+
all_ids = all_ids & set(self.namespaces.get(namespace, []))
|
| 327 |
+
|
| 328 |
results = []
|
| 329 |
for mem_id in all_ids:
|
| 330 |
+
strat = {
|
| 331 |
"semantic": semantic_scores.get(mem_id, 0),
|
| 332 |
"bm25": bm25_scores.get(mem_id, 0),
|
| 333 |
"graph": graph_scores.get(mem_id, 0)
|
| 334 |
}
|
| 335 |
|
|
|
|
| 336 |
combined = (
|
| 337 |
+
self.semantic_weight * strat["semantic"] +
|
| 338 |
+
self.bm25_weight * strat["bm25"] +
|
| 339 |
+
self.graph_weight * strat["graph"]
|
| 340 |
)
|
| 341 |
|
| 342 |
+
# Feedback adjustment
|
| 343 |
+
query_key = " ".join(sorted(set(query.lower().split()))[:5])
|
| 344 |
+
combined += self._doc_boosts.get(mem_id, 0) * 0.1
|
| 345 |
+
combined += self._query_doc_scores.get(query_key, {}).get(mem_id, 0) * 0.2
|
| 346 |
|
| 347 |
memory = self.memories.get(mem_id)
|
| 348 |
if memory:
|
| 349 |
+
combined *= (0.5 + 0.5 * memory.quality_score)
|
| 350 |
+
|
| 351 |
+
if combined >= self.similarity_threshold:
|
| 352 |
+
memory.access_count += 1
|
| 353 |
+
results.append(SearchResult(
|
| 354 |
+
id=mem_id, content=memory.content, score=combined,
|
| 355 |
+
strategy_scores=strat, metadata=memory.metadata
|
| 356 |
+
))
|
| 357 |
+
else:
|
| 358 |
+
self.stats["results_filtered"] += 1
|
| 359 |
+
|
| 360 |
results.sort(key=lambda x: x.score, reverse=True)
|
| 361 |
|
| 362 |
+
# Re-rank
|
| 363 |
if results:
|
| 364 |
+
results = rerank_by_relevance(query, results)
|
|
|
|
|
|
|
| 365 |
|
| 366 |
return results[:top_k]
|
| 367 |
|
| 368 |
+
def get_context(self, query: str, top_k: int = 3, namespace: Optional[str] = None) -> str:
|
| 369 |
+
results = self.search(query, top_k=top_k, namespace=namespace)
|
| 370 |
+
|
| 371 |
+
if not results:
|
| 372 |
+
return ""
|
| 373 |
+
|
| 374 |
+
parts = ["[RELEVANT CONTEXT FROM MEMORY]"]
|
| 375 |
+
for r in results:
|
| 376 |
+
parts.append(f"• {r.content}")
|
| 377 |
+
parts.append("[END CONTEXT]\n")
|
| 378 |
+
|
| 379 |
+
return "\n".join(parts)
|
| 380 |
+
|
| 381 |
def feedback(self, query: str, memory_id: str, relevance: float):
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 382 |
relevance = max(-1, min(1, relevance))
|
|
|
|
| 383 |
self._doc_boosts[memory_id] += 0.1 * relevance
|
| 384 |
|
| 385 |
query_key = " ".join(sorted(set(query.lower().split()))[:5])
|
| 386 |
current = self._query_doc_scores[query_key].get(memory_id, 0)
|
| 387 |
self._query_doc_scores[query_key][memory_id] = current + 0.1 * relevance
|
| 388 |
|
| 389 |
+
if memory_id in self.memories:
|
| 390 |
+
mem = self.memories[memory_id]
|
| 391 |
+
mem.usefulness_score = 0.7 * mem.usefulness_score + 0.3 * ((relevance + 1) / 2)
|
| 392 |
+
if mem.usefulness_score < 0.3:
|
| 393 |
+
mem.quality_score *= 0.9
|
|
|
|
|
|
|
|
|
|
|
|
|
| 394 |
|
| 395 |
+
self.stats["feedback"] += 1
|
| 396 |
|
| 397 |
def get(self, memory_id: str) -> Optional[Memory]:
|
|
|
|
| 398 |
return self.memories.get(memory_id)
|
| 399 |
|
| 400 |
def delete(self, memory_id: str) -> bool:
|
|
|
|
| 401 |
if memory_id in self.memories:
|
| 402 |
+
mem = self.memories[memory_id]
|
| 403 |
+
if mem.namespace in self.namespaces:
|
| 404 |
+
try:
|
| 405 |
+
self.namespaces[mem.namespace].remove(memory_id)
|
| 406 |
+
except ValueError:
|
| 407 |
+
pass
|
| 408 |
del self.memories[memory_id]
|
| 409 |
return True
|
| 410 |
return False
|
| 411 |
|
| 412 |
+
def list_all(self, namespace: Optional[str] = None) -> List[Memory]:
|
| 413 |
+
if namespace:
|
| 414 |
+
return [self.memories[mid] for mid in self.namespaces.get(namespace, []) if mid in self.memories]
|
| 415 |
return list(self.memories.values())
|
| 416 |
|
| 417 |
def get_stats(self) -> Dict:
|
|
|
|
| 418 |
return {
|
| 419 |
"total_memories": len(self.memories),
|
| 420 |
+
"namespaces": {ns: len(ids) for ns, ids in self.namespaces.items()},
|
| 421 |
"adds": self.stats["adds"],
|
| 422 |
+
"adds_rejected": self.stats["adds_rejected"],
|
| 423 |
"searches": self.stats["searches"],
|
| 424 |
+
"results_filtered": self.stats["results_filtered"],
|
| 425 |
+
"feedback": self.stats["feedback"],
|
| 426 |
+
"similarity_threshold": self.similarity_threshold,
|
| 427 |
+
"quality_threshold": self.quality_threshold,
|
|
|
|
|
|
|
| 428 |
"has_faiss": HAS_FAISS,
|
| 429 |
"has_bm25": HAS_BM25,
|
| 430 |
"has_graph": HAS_NETWORKX
|
| 431 |
}
|
| 432 |
|
| 433 |
+
def clear(self, namespace: Optional[str] = None):
|
| 434 |
+
if namespace:
|
| 435 |
+
for mid in list(self.namespaces.get(namespace, [])):
|
| 436 |
+
self.delete(mid)
|
| 437 |
+
else:
|
| 438 |
+
self.memories.clear()
|
| 439 |
+
self.namespaces.clear()
|
| 440 |
+
self._embeddings.clear()
|
| 441 |
+
self._ids.clear()
|
| 442 |
+
self._tokenized_docs.clear()
|
| 443 |
+
self.bm25 = None
|
| 444 |
+
self._cache.clear()
|
| 445 |
+
if HAS_FAISS:
|
| 446 |
+
self.index = faiss.IndexFlatIP(self.embedding_dim)
|
| 447 |
+
if HAS_NETWORKX:
|
| 448 |
+
self.graph = nx.DiGraph()
|
|
|
|
|
|
|
| 449 |
|
| 450 |
def __len__(self):
|
| 451 |
return len(self.memories)
|
| 452 |
|
| 453 |
def __repr__(self):
|
| 454 |
+
return f"Mnemo(memories={len(self.memories)}, threshold={self.similarity_threshold})"
|
|
|
|
| 455 |
|
| 456 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 457 |
def demo():
|
| 458 |
+
print("="*60)
|
| 459 |
+
print("MNEMO v3 TUNED - Optimized Parameters")
|
| 460 |
+
print("="*60)
|
| 461 |
+
|
| 462 |
+
m = Mnemo() # Uses tuned defaults
|
| 463 |
+
print(f"\n✓ {m}")
|
| 464 |
+
print(f" Similarity threshold: {m.similarity_threshold}")
|
| 465 |
+
print(f" Quality threshold: {m.quality_threshold}")
|
| 466 |
+
|
| 467 |
+
# Quick test
|
| 468 |
+
m.add("User prefers Python because it has clean syntax")
|
| 469 |
+
m.add("Previous analysis showed gender bias patterns")
|
| 470 |
+
m.add("Framework has 5 checkpoints for detection")
|
| 471 |
+
|
| 472 |
+
print(f"\n✓ Added {len(m)} memories")
|
| 473 |
+
|
| 474 |
+
results = m.search("previous analysis", top_k=2)
|
| 475 |
+
print(f"✓ Search returned {len(results)} results")
|
| 476 |
+
|
| 477 |
+
for r in results:
|
| 478 |
+
print(f" [{r.id}] score={r.score:.3f}: {r.content[:50]}...")
|
| 479 |
+
|
| 480 |
+
print("\n" + "="*60)
|
| 481 |
+
print("✅ Ready for production!")
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 482 |
|
| 483 |
|
| 484 |
if __name__ == "__main__":
|