MetonaTeam/metona-ollama-desktop
2
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases 1 Wiki Activity

fix: 去重移除 type 限制 — 内容相同就是重复，不管类型

Browse Source 
问题: AI 第一轮传 type=rule，第三轮漏传 type 默认 fact，相同内容因类型
不同而被放行，导致 MEMORY.md 出现两条一模一样的内容。

修复: 去重不再检查 e.type，纯内容比对。跨类型的相同内容视为重复。
This commit is contained in:
紫影233
2026-06-24 16:17:24 +08:00
parent 7f8f1bf9ef
commit 5cbeecf6f2
1 changed files with 2 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/renderer/services/memory-service.ts
+2 -4
View File
@@ -440,10 +440,9 @@ export async function addEntry(
entries = autoCleanEntries(entries); entries = autoCleanEntries(entries);
} }
// 去重检查（规范化后比较：全角→半角、统一空白、小写） // 去重检查（规范化后比较，不限类型：内容相同就是重复）
const normalizedNew = normalizeForDedup(content); const normalizedNew = normalizeForDedup(content);
const existing = entries.find(e => { const existing = entries.find(e => {
if (e.type !== type) return false;
const normalizedExisting = normalizeForDedup(e.content); const normalizedExisting = normalizeForDedup(e.content);
// 1) 规范化前缀匹配（30 字符） // 1) 规范化前缀匹配（30 字符）
const prefixLen = Math.min(30, normalizedNew.length, normalizedExisting.length); const prefixLen = Math.min(30, normalizedNew.length, normalizedExisting.length);
@@ -451,7 +450,7 @@ export async function addEntry(
// 2) 如果短文本，检查子串包含 // 2) 如果短文本，检查子串包含
if (normalizedNew.length < 40 && normalizedExisting.includes(normalizedNew)) return true; if (normalizedNew.length < 40 && normalizedExisting.includes(normalizedNew)) return true;
if (normalizedExisting.length < 40 && normalizedNew.includes(normalizedExisting)) return true; if (normalizedExisting.length < 40 && normalizedNew.includes(normalizedExisting)) return true;
// 3) 词级相似度 — 阈值 0.65：宁愿少记也不重复 // 3) 词级相似度 — 阈值 0.65
return simpleSimilarity(normalizedExisting, normalizedNew) > 0.65; return simpleSimilarity(normalizedExisting, normalizedNew) > 0.65;
}); });
if (existing) { if (existing) {
@@ -774,7 +773,6 @@ ${conversationText.slice(0, 5000)}
// ── 过滤 5: 去重（规范化后比较）── // ── 过滤 5: 去重（规范化后比较）──
const normalizedNew = normalizeForDedup(entry.content); const normalizedNew = normalizeForDedup(entry.content);
const isDuplicate = existingEntries.some(e => { const isDuplicate = existingEntries.some(e => {
if (e.type !== entry.type) return false;
const normalizedExisting = normalizeForDedup(e.content); const normalizedExisting = normalizeForDedup(e.content);
const prefixLen = Math.min(30, normalizedNew.length, normalizedExisting.length); const prefixLen = Math.min(30, normalizedNew.length, normalizedExisting.length);
if (prefixLen > 10 && normalizedNew.slice(0, prefixLen) === normalizedExisting.slice(0, prefixLen)) return true; if (prefixLen > 10 && normalizedNew.slice(0, prefixLen) === normalizedExisting.slice(0, prefixLen)) return true;