Spaces:
Running
Running
File size: 64,821 Bytes
3d50167 798bcc6 3d50167 798bcc6 3d50167 798bcc6 3d50167 798bcc6 3d50167 798bcc6 3d50167 8c89f37 3d50167 798bcc6 3d50167 798bcc6 3d50167 a40f14d 3d50167 798bcc6 3d50167 5168622 3d50167 a40f14d 3d50167 5168622 3d50167 798bcc6 5168622 3d50167 798bcc6 3d50167 798bcc6 3d50167 798bcc6 3d50167 798bcc6 3d50167 798bcc6 3d50167 798bcc6 3d50167 798bcc6 3d50167 798bcc6 56ab489 3d50167 798bcc6 3d50167 798bcc6 3d50167 798bcc6 3d50167 798bcc6 3d50167 798bcc6 3d50167 798bcc6 3d50167 798bcc6 3d50167 5168622 3d50167 5168622 3d50167 798bcc6 |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 |
// ===== KIMI INTELLIGENT MEMORY SYSTEM =====
class KimiMemorySystem {
constructor(database) {
this.db = database;
this.memoryEnabled = true;
this.maxMemoryEntries = 100;
this.memoryCategories = {
personal: "Personal Information",
preferences: "Likes & Dislikes",
relationships: "Relationships & People",
activities: "Activities & Hobbies",
goals: "Goals & Aspirations",
experiences: "Shared Experiences",
important: "Important Events"
};
// Patterns for automatic memory extraction (multilingual)
this.extractionPatterns = {
personal: [
// English patterns
/(?:my name is|i'm called|call me|i am) (\w+)/i,
/(?:i am|i'm) (\d+) years? old/i,
/(?:i live in|i'm from|from) ([^,.!?]+)/i,
/(?:i work as|my job is|i'm a) ([^,.!?]+)/i,
// French patterns
/(?:je m'appelle|mon nom est|je suis|je me prénomme|je me nomme) ([^,.!?]+)/i,
/(?:j'ai) (\d+) ans?/i,
/(?:j'habite à|je vis à|je viens de) ([^,.!?]+)/i,
/(?:je travaille comme|mon travail est|je suis) ([^,.!?]+)/i,
// Spanish patterns
/(?:me llamo|mi nombre es|soy) ([^,.!?]+)/i,
/(?:tengo) (\d+) años?/i,
/(?:vivo en|soy de) ([^,.!?]+)/i,
/(?:trabajo como|mi trabajo es|soy) ([^,.!?]+)/i,
// Italian patterns
/(?:mi chiamo|il mio nome è|sono) ([^,.!?]+)/i,
/(?:ho) (\d+) anni?/i,
/(?:abito a|vivo a|sono di) ([^,.!?]+)/i,
/(?:lavoro come|il mio lavoro è|sono) ([^,.!?]+)/i,
// German patterns
/(?:ich heiße|mein name ist|ich bin) ([^,.!?]+)/i,
/(?:ich bin) (\d+) jahre? alt/i,
/(?:ich wohne in|ich lebe in|ich komme aus) ([^,.!?]+)/i,
/(?:ich arbeite als|mein beruf ist|ich bin) ([^,.!?]+)/i,
// Japanese patterns
/私の名前は([^。!?!?、,.]+)[ですだ]?/i,
/私は([^。!?!?、,.]+)です/i,
/([^、。!?!?,.]+)と申します/i,
/([^、。!?!?,.]+)といいます/i,
// Chinese patterns
/我叫([^,。!?!?,.]+)/i,
/我的名字是([^,。!?!?,.]+)/i,
/叫我([^,。!?!?,.]+)/i
],
preferences: [
// English patterns
/(?:i love|i like|i enjoy|i prefer) ([^,.!?]+)/i,
/(?:i hate|i dislike|i don't like) ([^,.!?]+)/i,
/(?:my favorite|i really like) ([^,.!?]+)/i,
// French patterns
/(?:j'aime|j'adore|je préfère) ([^,.!?]+)/i,
/(?:je déteste|je n'aime pas) ([^,.!?]+)/i,
/(?:mon préféré|ma préférée) (?:est|sont) ([^,.!?]+)/i,
// Explicit memory requests
/(?:ajoute? (?:au|à la) (?:système? )?(?:de )?mémoire|retiens?|mémorise?) (?:que )?(.+)/i,
/(?:add to memory|remember|memorize) (?:that )?(.+)/i
],
relationships: [
// English patterns
/(?:my (?:wife|husband|girlfriend|boyfriend|partner)) (?:is|named?) ([^,.!?]+)/i,
/(?:my (?:mother|father|sister|brother|friend)) ([^,.!?]+)/i,
// French patterns
/(?:ma (?:femme|copine|partenaire)|mon (?:mari|copain|partenaire)) (?:s'appelle|est) ([^,.!?]+)/i,
/(?:ma (?:mère|sœur)|mon (?:père|frère|ami)) (?:s'appelle|est) ([^,.!?]+)/i,
// Spanish patterns
/(?:mi (?:esposa|esposo|novia|novio|pareja)) (?:es|se llama) ([^,.!?]+)/i,
/(?:mi (?:madre|padre|hermana|hermano|amigo|amiga)) (?:es|se llama) ([^,.!?]+)/i,
// Italian patterns
/(?:la mia (?:moglie|fidanzata|compagna)|il mio (?:marito|fidanzato|compagno)) (?:è|si chiama) ([^,.!?]+)/i,
/(?:mia (?:madre|sorella)|mio (?:padre|fratello|amico)) (?:è|si chiama) ([^,.!?]+)/i,
// German patterns
/(?:meine (?:frau|freundin|partnerin)|mein (?:mann|freund|partner)) (?:ist|heißt) ([^,.!?]+)/i,
/(?:meine (?:mutter|schwester)|mein (?:vater|bruder|freund)) (?:ist|heißt) ([^,.!?]+)/i,
// Japanese patterns
/(?:私の(?:妻|夫|彼女|彼氏|パートナー))は([^。!?!?、,.]+)(?:です|といいます)/i,
/(?:私の(?:母|父|姉|妹|兄|弟|友達))は([^。!?!?、,.]+)(?:です|といいます)/i,
// Chinese patterns
/(?:我的(?:妻子|丈夫|女朋友|男朋友|伴侣))叫([^,。!?!?,.]+)/i,
/(?:我的(?:妈妈|父亲|姐姐|妹妹|哥哥|弟弟|朋友))叫([^,。!?!?,.]+)/i
],
activities: [
// English patterns
/(?:i play|i do|i practice) ([^,.!?]+)/i,
/(?:my hobby is|i hobby) ([^,.!?]+)/i,
// French patterns
/(?:je joue|je fais|je pratique) ([^,.!?]+)/i,
/(?:mon passe-temps|mon hobby) (?:est|c'est) ([^,.!?]+)/i,
// Spanish patterns
/(?:juego|hago|practico) ([^,.!?]+)/i,
/(?:mi pasatiempo|mi hobby) (?:es) ([^,.!?]+)/i,
// Italian patterns
/(?:gioco|faccio|pratico) ([^,.!?]+)/i,
/(?:il mio passatempo|il mio hobby) (?:è) ([^,.!?]+)/i,
// German patterns
/(?:ich spiele|ich mache|ich übe) ([^,.!?]+)/i,
/(?:mein hobby ist) ([^,.!?]+)/i,
// Japanese patterns
/(?:私は)?(?:[^、。!?!?,.]+)が趣味です/i,
/趣味は([^。!?!?、,.]+)です/i,
// Chinese patterns
/(?:我玩|我做|我练习)([^,。!?!?,.]+)/i,
/(?:我的爱好是)([^,。!?!?,.]+)/i
],
goals: [
// English patterns
/(?:i want to|i plan to|my goal is) ([^,.!?]+)/i,
/(?:i'm learning|i study) ([^,.!?]+)/i,
// French patterns
/(?:je veux|je vais|mon objectif est) ([^,.!?]+)/i,
/(?:j'apprends|j'étudie) ([^,.!?]+)/i,
// Spanish patterns
/(?:quiero|voy a|mi objetivo es) ([^,.!?]+)/i,
/(?:estoy aprendiendo|estudio) ([^,.!?]+)/i,
// Italian patterns
/(?:voglio|andrò a|il mio obiettivo è) ([^,.!?]+)/i,
/(?:sto imparando|studio) ([^,.!?]+)/i,
// German patterns
/(?:ich möchte|ich will|mein ziel ist) ([^,.!?]+)/i,
/(?:ich lerne|ich studiere) ([^,.!?]+)/i,
// Japanese patterns
/(?:私は)?(?:[^、。!?!?,.]+)したい/i,
/(?:学んでいる|勉強している) ([^。!?!?、,.]+)/i,
// Chinese patterns
/(?:我想|我要|我的目标是)([^,。!?!?,.]+)/i,
/(?:我在学习|我学习)([^,。!?!?,.]+)/i
],
experiences: [
// English patterns
/we went to ([^,.!?]+)/i,
/we met (?:at|on|in) ([^,.!?]+)/i,
/our (?:first date|first kiss|trip|vacation) (?:was|was at|was on|was in|was to) ([^,.!?]+)/i,
/our anniversary (?:is|falls on|will be) ([^,.!?]+)/i,
/we moved in (?:together )?(?:on|in)?\s*([^,.!?]+)/i,
// French patterns
/on s'est rencontr[ée]s? (?:à|au|en|le) ([^,.!?]+)/i,
/on est all[ée]s? à ([^,.!?]+)/i,
/notre (?:premier rendez-vous|première sortie) (?:était|c'était) ([^,.!?]+)/i,
/notre anniversaire (?:est|c'est) ([^,.!?]+)/i,
/on a emménagé (?:ensemble\s*)?(?:le|en|à)\s*([^,.!?]+)/i,
// Spanish patterns
/nos conocimos (?:en|el|la) ([^,.!?]+)/i,
/fuimos a ([^,.!?]+)/i,
/nuestra (?:primera cita|primera salida) (?:fue|era) ([^,.!?]+)/i,
/nuestro aniversario (?:es|cae en|será) ([^,.!?]+)/i,
/nos mudamos (?:juntos\s*)?(?:el|en|a)\s*([^,.!?]+)/i,
// Italian patterns
/ci siamo conosciuti (?:a|al|in|il) ([^,.!?]+)/i,
/siamo andati a ([^,.!?]+)/i,
/il nostro (?:primo appuntamento|primo bacio|viaggio) (?:era|è stato) ([^,.!?]+)/i,
/il nostro anniversario (?:è|cade il|sarà) ([^,.!?]+)/i,
/ci siamo trasferiti (?:insieme\s*)?(?:il|in|a)\s*([^,.!?]+)/i,
// German patterns
/wir haben uns (?:in|am) ([^,.!?]+) kennengelernt/i,
/wir sind (?:nach|zu) ([^,.!?]+) (?:gegangen|gefahren)/i,
/unser (?:erstes date|erster kuss|urlaub) (?:war|fand statt) ([^,.!?]+)/i,
/unser jahrestag (?:ist|fällt auf|wird sein) ([^,.!?]+)/i,
/wir sind (?:zusammen )?eingezogen (?:am|im|in)\s*([^,.!?]+)/i,
// Japanese patterns
/私たちは([^、。!?!?,.]+)で出会った/i,
/一緒に([^、。!?!?,.]+)へ行った/i,
/私たちの記念日(?:は)?([^、。!?!?,.]+)/i,
/一緒に引っ越した(?:のは)?([^、。!?!?,.]+)/i,
// Chinese patterns
/我们在([^,。!?!?,.]+)认识/i,
/我们去了([^,。!?!?,.]+)/i,
/我们的纪念日是([^,。!?!?,.]+)/i,
/我们一起搬家(?:是在)?([^,。!?!?,.]+)/i
],
important: [
// English patterns
/it's important (?:to remember|that) (.+)/i,
/please remember (.+)/i,
// French patterns
/c'est important (?:de se souvenir|que) (.+)/i,
/merci de te souvenir (.+)/i,
// Spanish patterns
/es importante (?:recordar|que) (.+)/i,
/por favor recuerda (.+)/i,
// Italian patterns
/è importante (?:ricordare|che) (.+)/i,
/per favore ricorda (.+)/i,
// German patterns
/es ist wichtig (?:zu erinnern|dass) (.+)/i,
/bitte erinnere dich an (.+)/i,
// Japanese patterns
/重要なのは(.+)です/i,
/覚えておいてほしいのは(.+)です/i,
// Chinese patterns
/重要的是(.+)/i,
/请记住(.+)/i
]
};
}
async init() {
if (!this.db) {
console.warn("Database not available for memory system");
return;
}
try {
this.memoryEnabled = await this.db.getPreference(
"memorySystemEnabled",
window.KIMI_CONFIG?.DEFAULTS?.MEMORY_SYSTEM_ENABLED ?? true
);
this.selectedCharacter = await this.db.getSelectedCharacter();
await this.createMemoryTables();
// Migrer les IDs incompatibles si nécessaire
await this.migrateIncompatibleIDs();
} catch (error) {
console.error("Memory system initialization error:", error);
}
}
async createMemoryTables() {
// Ensure memory tables exist in database
if (!this.db.db.memories) {
console.warn("Memory table not found in database schema");
return;
}
}
// MEMORY EXTRACTION from conversation
async extractMemoryFromText(userText, kimiResponse = null) {
if (!this.memoryEnabled || !userText) return [];
const extractedMemories = [];
const text = userText.toLowerCase();
console.log("🔍 Memory extraction - Processing text:", userText);
// Enhanced extraction with context awareness
const existingMemories = await this.getAllMemories();
// First, check for explicit memory requests
const explicitRequests = this.detectExplicitMemoryRequests(userText);
if (explicitRequests.length > 0) {
console.log("🎯 Explicit memory requests detected:", explicitRequests);
extractedMemories.push(...explicitRequests);
}
// Extract using patterns
for (const [category, patterns] of Object.entries(this.extractionPatterns)) {
for (const pattern of patterns) {
const match = text.match(pattern);
if (match && match[1]) {
const content = match[1].trim();
// Skip very short or generic content
if (content.length < 2 || this.isGenericContent(content)) {
continue;
}
// Check if this is a meaningful update to existing memory
const isUpdate = await this.isMemoryUpdate(category, content, existingMemories);
const memory = {
category: category,
type: "auto_extracted",
content: content,
sourceText: userText,
confidence: this.calculateExtractionConfidence(match, userText),
timestamp: new Date(),
character: this.selectedCharacter,
isUpdate: isUpdate
};
console.log(`💡 Pattern match for ${category}:`, content);
extractedMemories.push(memory);
}
}
}
// Enhanced pattern detection for more natural expressions
const enhancedMemories = await this.detectNaturalExpressions(userText, existingMemories);
extractedMemories.push(...enhancedMemories);
// Save extracted memories with intelligent deduplication
const savedMemories = [];
for (const memory of extractedMemories) {
console.log("💾 Saving memory:", memory.content);
const saved = await this.addMemory(memory);
if (saved) savedMemories.push(saved);
}
if (savedMemories.length > 0) {
console.log(`✅ Successfully extracted and saved ${savedMemories.length} memories`);
} else {
console.log("📝 No memories extracted from this text");
}
return savedMemories;
}
// Detect explicit memory requests like "ajoute en mémoire que..."
detectExplicitMemoryRequests(text) {
const memories = [];
const lowerText = text.toLowerCase();
// French patterns for explicit memory requests
const frenchPatterns = [
/(?:ajoute?s?(?:r)?|retiens?|mémorise?s?|enregistre?s?|sauvegarde?s?)\s+(?:au|à|en|dans)\s+(?:la\s+|le\s+)?(?:système?\s+(?:de\s+)?)?mémoire\s+(?:que\s+)?(.+)/i,
/(?:peux-tu|pourrais-tu|veux-tu)?\s*(?:ajouter|retenir|mémoriser|enregistrer|sauvegarder)\s+(?:que\s+)?(.+)\s+(?:en|dans)\s+(?:la\s+|le\s+)?mémoire/i,
/(?:je\s+veux\s+que\s+tu\s+)?(?:retienne?s|mémorise?s|ajoute?s)\s+(?:que\s+)?(.+)/i
];
// English patterns for explicit memory requests
const englishPatterns = [
/(?:add\s+to\s+memory|remember|memorize|save\s+(?:to\s+)?memory)\s+(?:that\s+)?(.+)/i,
/(?:can\s+you|could\s+you)?\s*(?:add|remember|memorize|save)\s+(?:that\s+)?(.+)\s+(?:to\s+|in\s+)?memory/i,
/(?:i\s+want\s+you\s+to\s+)?(?:remember|memorize|add)\s+(?:that\s+)?(.+)/i
];
// Spanish explicit memory requests
const spanishPatterns = [
/(?:añade|agrega|recuerda|memoriza|guarda)\s+(?:en|a)\s+(?:la\s+)?memoria\s+(?:que\s+)?(.+)/i,
/(?:puedes|podrías)?\s*(?:añadir|agregar|recordar|memorizar|guardar)\s+(?:que\s+)?(.+)\s+(?:en|a)\s+(?:la\s+)?memoria/i,
/(?:quiero\s+que\s+)?(?:recuerdes|memorices|añadas)\s+(?:que\s+)?(.+)/i
];
// Italian explicit memory requests
const italianPatterns = [
/(?:aggiungi|ricorda|memorizza|salva)\s+(?:nella|in)\s+memoria\s+(?:che\s+)?(.+)/i,
/(?:puoi|potresti)?\s*(?:aggiungere|ricordare|memorizzare|salvare)\s+(?:che\s+)?(.+)\s+(?:nella|in)\s+memoria/i,
/(?:voglio\s+che\s+)?(?:ricordi|memorizzi|aggiunga)\s+(?:che\s+)?(.+)/i
];
// German explicit memory requests
const germanPatterns = [
/(?:füge|merke|speichere)\s+(?:es\s+)?(?:in|zur)\s+?gedächtnis|speicher\s+(?:dass\s+)?(.+)/i,
/(?:kannst\s+du|könntest\s+du)?\s*(?:hinzufügen|merken|speichern)\s+(?:dass\s+)?(.+)\s+(?:in|zum)\s+(?:gedächtnis|speicher)/i,
/(?:ich\s+möchte\s+dass\s+du)\s*(?:merkst|speicherst|hinzufügst)\s+(?:dass\s+)?(.+)/i
];
// Japanese explicit memory requests
const japanesePatterns = [
/記憶に(?:追加|保存|覚えて)(?:して)?(?:ほしい|ください)?(?:、)?(.+)/i,
/(?:覚えて|記憶して)(?:ほしい|ください)?(?:、)?(.+)/i
];
// Chinese explicit memory requests
const chinesePatterns = [
/把(.+)记在(?:记忆|内存|记忆库)里/i,
/(?:请)?记住(?:这件事|这个|以下)?(.+)/i,
/保存到记忆(?:里|中)(?:的是)?(.+)/i
];
const allPatterns = [
...frenchPatterns,
...englishPatterns,
...spanishPatterns,
...italianPatterns,
...germanPatterns,
...japanesePatterns,
...chinesePatterns
];
for (const pattern of allPatterns) {
const match = lowerText.match(pattern);
if (match && match[1]) {
const content = match[1].trim();
// Determine category based on content
const category = this.categorizeExplicitMemory(content);
memories.push({
category: category,
type: "explicit_request",
content: content,
sourceText: text,
confidence: 1.0, // High confidence for explicit requests
timestamp: new Date(),
character: this.selectedCharacter,
isUpdate: false
});
break; // Only take the first match to avoid duplicates
}
}
return memories;
}
// Categorize explicit memory based on content analysis
categorizeExplicitMemory(content) {
const lowerContent = content.toLowerCase();
// Preference indicators
if (
lowerContent.includes("j'aime") ||
lowerContent.includes("i like") ||
lowerContent.includes("j'adore") ||
lowerContent.includes("i love") ||
lowerContent.includes("je préfère") ||
lowerContent.includes("i prefer") ||
lowerContent.includes("je déteste") ||
lowerContent.includes("i hate")
) {
return "preferences";
}
// Personal information indicators
if (
lowerContent.includes("je m'appelle") ||
lowerContent.includes("my name is") ||
(lowerContent.includes("j'ai") && lowerContent.includes("ans")) ||
lowerContent.includes("years old") ||
lowerContent.includes("j'habite") ||
lowerContent.includes("i live")
) {
return "personal";
}
// Relationship indicators
if (
lowerContent.includes("ma femme") ||
lowerContent.includes("my wife") ||
lowerContent.includes("mon mari") ||
lowerContent.includes("my husband") ||
lowerContent.includes("mon ami") ||
lowerContent.includes("my friend") ||
lowerContent.includes("ma famille") ||
lowerContent.includes("my family")
) {
return "relationships";
}
// Activity indicators
if (
lowerContent.includes("je joue") ||
lowerContent.includes("i play") ||
lowerContent.includes("je pratique") ||
lowerContent.includes("i practice") ||
lowerContent.includes("mon hobby") ||
lowerContent.includes("my hobby")
) {
return "activities";
}
// Goal indicators
if (
lowerContent.includes("je veux") ||
lowerContent.includes("i want") ||
lowerContent.includes("mon objectif") ||
lowerContent.includes("my goal") ||
lowerContent.includes("j'apprends") ||
lowerContent.includes("i'm learning")
) {
return "goals";
}
// Default to preferences for most explicit requests
return "preferences";
}
// Check if content is too generic to be useful
isGenericContent(content) {
const genericWords = ["yes", "no", "ok", "okay", "sure", "thanks", "hello", "hi", "bye"];
return genericWords.includes(content.toLowerCase()) || content.length < 2;
}
// Calculate confidence based on context and pattern strength
calculateExtractionConfidence(match, fullText) {
let confidence = 0.6; // Base confidence
// Boost confidence for explicit statements
const lower = fullText.toLowerCase();
if (
lower.includes("my name is") ||
lower.includes("i am called") ||
lower.includes("je m'appelle") ||
lower.includes("mon nom est") ||
lower.includes("je me prénomme") ||
lower.includes("je me nomme") ||
lower.includes("me llamo") ||
lower.includes("mi nombre es") ||
lower.includes("mi chiamo") ||
lower.includes("il mio nome è") ||
lower.includes("ich heiße") ||
lower.includes("mein name ist") ||
lower.includes("と申します") ||
lower.includes("私の名前は") ||
lower.includes("我叫") ||
lower.includes("我的名字是")
) {
confidence += 0.3;
}
// Boost for longer, more specific content
if (match[1] && match[1].trim().length > 10) {
confidence += 0.1;
}
// Reduce confidence for uncertain language
if (fullText.includes("maybe") || fullText.includes("perhaps") || fullText.includes("might")) {
confidence -= 0.2;
}
return Math.min(1.0, Math.max(0.1, confidence));
}
// Generate a short title (2-5 words max) from content for auto-extracted memories
generateTitleFromContent(content) {
if (!content || typeof content !== "string") return "";
// Remove surrounding punctuation and collapse whitespace
const cleaned = content
.replace(/[\n\r]+/g, " ")
.replace(/["'“”‘’–—:;()\[\]{}]+/g, "")
.trim();
const words = cleaned.split(/\s+/).filter(Boolean);
if (words.length === 0) return "";
// Prefer 3 words when available, minimum 2 when possible, maximum 5
let take;
if (words.length >= 3) take = 3;
else take = words.length; // 1 or 2
take = Math.min(5, Math.max(1, take));
const slice = words.slice(0, take);
// Capitalize first word for nicer title
slice[0] = slice[0].charAt(0).toUpperCase() + slice[0].slice(1);
return slice.join(" ");
}
// Check if this is an update to existing memory rather than new info
async isMemoryUpdate(category, content, existingMemories) {
const categoryMemories = existingMemories.filter(m => m.category === category);
for (const memory of categoryMemories) {
const similarity = this.calculateSimilarity(memory.content, content);
if (similarity > 0.3) {
// Lower threshold for updates
return true;
}
}
return false;
}
// Detect natural expressions that patterns might miss
async detectNaturalExpressions(text, existingMemories) {
const naturalMemories = [];
const lowerText = text.toLowerCase();
// Detect name mentions in natural context (multilingual)
const namePatterns = [
// English
/call me (\w+)/i,
/(\w+) here[,.]?/i,
/this is (\w+)/i,
/(\w+) speaking/i,
// French
/appelle-?moi (\w+)/i,
/on m'appelle (\w+)/i,
/c'est (\w+)/i,
// Spanish
/llámame (\w+)/i,
/me llaman (\w+)/i,
/soy (\w+)/i,
// Italian
/chiamami (\w+)/i,
/mi chiamano (\w+)/i,
/sono (\w+)/i,
// German
/nenn mich (\w+)/i,
/man nennt mich (\w+)/i,
/ich bin (\w+)/i,
// Japanese
/(?:私は)?(\w+)です/i,
// Chinese
/我是(\w+)/i,
/叫我(\w+)/i
];
for (const pattern of namePatterns) {
const match = lowerText.match(pattern);
if (match && match[1] && match[1].length > 1) {
const name = match[1].trim();
// Skip if too generic
if (!this.isGenericContent(name) && !this.isCommonWord(name)) {
naturalMemories.push({
category: "personal",
type: "auto_extracted",
content: name,
sourceText: text,
confidence: 0.7,
timestamp: new Date(),
character: this.selectedCharacter
});
}
}
}
return naturalMemories;
}
// Check if word is too common to be a name
isCommonWord(word, language = "en") {
// Use existing constants if available
if (window.KIMI_COMMON_WORDS && window.KIMI_COMMON_WORDS[language]) {
return window.KIMI_COMMON_WORDS[language].includes(word.toLowerCase());
}
// Fallback to original English list
const commonWords = [
"the",
"and",
"for",
"are",
"but",
"not",
"you",
"all",
"can",
"had",
"her",
"was",
"one",
"our",
"out",
"day",
"get",
"has",
"him",
"his",
"how",
"man",
"new",
"now",
"old",
"see",
"two",
"way",
"who",
"boy",
"did",
"its",
"let",
"put",
"say",
"she",
"too",
"use"
];
return commonWords.includes(word.toLowerCase());
}
// MANUAL MEMORY MANAGEMENT
async addMemory(memoryData) {
if (!this.db || !this.memoryEnabled) return;
try {
// Check for duplicates with intelligent merging
const existing = await this.findSimilarMemory(memoryData);
if (existing) {
// Intelligent merge strategy
return await this.mergeMemories(existing, memoryData);
}
// Add memory with metadata (let DB auto-generate ID)
const now = new Date();
const memory = {
category: memoryData.category || "personal",
type: memoryData.type || "manual",
content: memoryData.content,
// Title: use provided title or generate for auto_extracted
title:
memoryData.title && typeof memoryData.title === "string"
? memoryData.title
: memoryData.type === "auto_extracted"
? this.generateTitleFromContent(memoryData.content)
: "",
sourceText: memoryData.sourceText || "",
confidence: memoryData.confidence || 1.0,
timestamp: memoryData.timestamp || now,
character: memoryData.character || this.selectedCharacter,
isActive: true,
tags: [...new Set([...(memoryData.tags || []), ...this.deriveMemoryTags(memoryData)])],
lastModified: now,
createdAt: now,
lastAccess: now,
accessCount: 0,
importance: this.calculateImportance(memoryData)
};
if (this.db.db.memories) {
const id = await this.db.db.memories.add(memory);
memory.id = id; // Store the auto-generated ID
console.log(`Memory added with ID: ${id}`);
}
// Cleanup old memories if we exceed limit
await this.cleanupOldMemories();
// Notify LLM system to refresh context
this.notifyLLMContextUpdate();
return memory;
} catch (error) {
console.error("Error adding memory:", error);
}
}
// Intelligent memory merging
async mergeMemories(existingMemory, newMemoryData) {
try {
// Determine merge strategy based on content and confidence
const strategy = this.determineMergeStrategy(existingMemory, newMemoryData);
let mergedContent = existingMemory.content;
let mergedConfidence = existingMemory.confidence;
let mergedTags = [...(existingMemory.tags || [])];
switch (strategy) {
case "update_content":
// New information is more confident/recent
mergedContent = newMemoryData.content;
mergedConfidence = Math.max(existingMemory.confidence, newMemoryData.confidence || 0.8);
break;
case "merge_content":
// Combine information intelligently
if (
existingMemory.category === "personal" &&
this.areRelatedNames(existingMemory.content, newMemoryData.content)
) {
// Handle name variants
mergedContent = this.mergeNames(existingMemory.content, newMemoryData.content);
} else {
// General merge - keep most specific
mergedContent =
newMemoryData.content.length > existingMemory.content.length
? newMemoryData.content
: existingMemory.content;
}
mergedConfidence = (existingMemory.confidence + (newMemoryData.confidence || 0.8)) / 2;
break;
case "add_variant":
// Store as variant/alias
mergedTags.push(`alias:${newMemoryData.content}`);
break;
case "boost_confidence":
// Same content, boost confidence
mergedConfidence = Math.min(1.0, existingMemory.confidence + 0.1);
break;
}
// Update existing memory
const updatedMemory = {
...existingMemory,
content: mergedContent,
confidence: mergedConfidence,
tags: [...new Set([...mergedTags, ...this.deriveMemoryTags(newMemoryData)])], // Remove duplicates
lastModified: new Date(),
accessCount: (existingMemory.accessCount || 0) + 1,
importance: Math.max(existingMemory.importance || 0.5, this.calculateImportance(newMemoryData))
};
await this.updateMemory(existingMemory.id, updatedMemory);
return updatedMemory;
} catch (error) {
console.error("Error merging memories:", error);
return existingMemory;
}
}
// Determine how to merge two related memories
determineMergeStrategy(existing, newData) {
const similarity = this.calculateSimilarity(existing.content, newData.content);
const newConfidence = newData.confidence || 0.8;
// If very similar content but new has higher confidence
if (similarity > 0.9 && newConfidence > existing.confidence) {
return "boost_confidence";
}
// If moderately similar, decide based on specificity and recency
if (similarity > 0.7) {
if (newData.content.length > existing.content.length * 1.5) {
return "update_content"; // New is more detailed
} else {
return "merge_content";
}
}
// For names, handle as variants
if (existing.category === "personal" && this.areRelatedNames(existing.content, newData.content)) {
return "add_variant";
}
// Default to merging
return "merge_content";
}
// Merge name variants intelligently
mergeNames(name1, name2) {
// Keep the longest/most formal version as primary
if (name1.length > name2.length) {
return name1;
} else if (name2.length > name1.length) {
return name2;
}
// If same length, keep the first one
return name1;
}
// Calculate importance of memory for prioritization
calculateImportance(memoryData) {
let importance = 0.5; // Base importance
// Category base weights
const categoryWeights = {
important: 1.0,
personal: 0.9,
relationships: 0.85,
goals: 0.75,
experiences: 0.65,
preferences: 0.6,
activities: 0.5
};
importance = categoryWeights[memoryData.category] || 0.5;
const content = (memoryData.content || "").toLowerCase();
const tags = new Set([...(memoryData.tags || []), ...this.deriveMemoryTags(memoryData)]);
// Heuristic boosts for meaningful relationship milestones and commitments
const milestoneTags = [
"relationship:first_meet",
"relationship:first_date",
"relationship:first_kiss",
"relationship:anniversary",
"relationship:moved_in",
"relationship:engaged",
"relationship:married",
"relationship:breakup"
];
if ([...tags].some(t => milestoneTags.includes(t))) importance += 0.15;
// Boundaries and consent are high priority to remember
if ([...tags].some(t => t.startsWith("boundary:"))) importance += 0.15;
// Preferences tied to strong like/dislike
if (
content.includes("i love") ||
content.includes("j'adore") ||
content.includes("i hate") ||
content.includes("je déteste")
) {
importance += 0.05;
}
// Temporal cues: future commitments or dates
if (/(\bnext\b|\btomorrow\b|\bce soir\b|\bdemain\b|\bmañana\b|\bdomani\b|\bmorgen\b)/i.test(content)) {
importance += 0.05;
}
// Longer details and high confidence
if (memoryData.content && memoryData.content.length > 24) importance += 0.05;
if (memoryData.confidence && memoryData.confidence > 0.9) importance += 0.05;
// Round to two decimals to avoid floating point artifacts
return Math.min(1.0, Math.round(importance * 100) / 100);
}
// Derive semantic tags from memory content to assist prioritization and merging
deriveMemoryTags(memoryData) {
const tags = [];
const text = (memoryData.content || "").toLowerCase();
const category = memoryData.category || "";
// Relationship status and milestones
if (/(single|célibataire|soltero|single|ledig)/i.test(text)) tags.push("relationship:status_single");
if (/(in a relationship|en couple|together|ensemble|pareja|coppia|beziehung)/i.test(text))
tags.push("relationship:status_in_relationship");
if (/(engaged|fiancé|fiancée|promis|promised|verlobt)/i.test(text)) tags.push("relationship:status_engaged");
if (/(married|marié|mariée|casado|sposato|verheiratet)/i.test(text)) tags.push("relationship:status_married");
if (/(broke up|rupture|separated|separado|separati|getrennt)/i.test(text)) tags.push("relationship:breakup");
if (/(first date|premier rendez-vous|primera cita|primo appuntamento)/i.test(text)) tags.push("relationship:first_date");
if (/(first kiss|premier baiser|primer beso|primo bacio)/i.test(text)) tags.push("relationship:first_kiss");
if (/(anniversary|anniversaire|aniversario|anniversario|jahrestag)/i.test(text)) tags.push("relationship:anniversary");
if (/(moved in together|emménagé ensemble|mudamos juntos|trasferiti insieme|zusammen eingezogen)/i.test(text))
tags.push("relationship:moved_in");
if (/(met at|rencontré à|conocimos en|conosciuti a|kennengelernt)/i.test(text)) tags.push("relationship:first_meet");
// Boundaries and consent (keep generic and non-graphic)
if (/(i don't like|je n'aime pas|no me gusta|non mi piace|ich mag nicht)\s+[^,.!?]+/i.test(text))
tags.push("boundary:dislike");
if (/(i prefer|je préfère|prefiero|preferisco|ich bevorzuge)\s+[^,.!?]+/i.test(text)) tags.push("boundary:preference");
if (/(no|pas)\s+(?:kissing|baiser|beso|bacio|küssen)/i.test(text)) tags.push("boundary:limit");
if (/(consent|consentement|consentimiento|consenso|einwilligung)/i.test(text)) tags.push("boundary:consent");
// Time-related tags
if (/(today|ce jour|hoy|oggi|heute|今日)/i.test(text)) tags.push("time:today");
if (/(tomorrow|demain|mañana|domani|morgen|明日)/i.test(text)) tags.push("time:tomorrow");
if (/(next week|semaine prochaine|la próxima semana|la prossima settimana|nächste woche)/i.test(text))
tags.push("time:next_week");
// Category-specific hints
if (category === "preferences") tags.push("type:preference");
if (category === "personal") tags.push("type:personal");
if (category === "relationships") tags.push("type:relationship");
if (category === "experiences") tags.push("type:experience");
if (category === "goals") tags.push("type:goal");
if (category === "important") tags.push("type:important");
return tags;
}
async updateMemory(memoryId, updateData) {
if (!this.db) return false;
try {
// Ensure memoryId is the correct type
const numericId = typeof memoryId === "string" ? parseInt(memoryId) : memoryId;
// Vérifier d'abord que la mémoire existe
const existingMemory = await this.db.db.memories.get(numericId);
if (!existingMemory) {
console.error(`❌ Memory with ID ${numericId} not found in database`);
return false;
}
console.log(`🔄 Updating memory ${numericId}:`, { existing: existingMemory, update: updateData });
const update = {
...updateData,
lastModified: new Date()
};
if (this.db.db.memories) {
const result = await this.db.db.memories.update(numericId, update);
console.log(`Memory update result for ID ${numericId}:`, result);
if (result > 0) {
console.log("✅ Memory updated successfully");
// Notify LLM system to refresh context
this.notifyLLMContextUpdate();
return true;
} else {
console.error("❌ Memory update failed - no rows affected");
return false;
}
}
} catch (error) {
console.error("Error updating memory:", error, { memoryId, updateData });
return false;
}
}
async deleteMemory(memoryId) {
if (!this.db) return false;
try {
// Ensure memoryId is the correct type
const numericId = typeof memoryId === "string" ? parseInt(memoryId) : memoryId;
if (this.db.db.memories) {
const result = await this.db.db.memories.delete(numericId);
console.log(`Memory delete result for ID ${numericId}:`, result);
// Notify LLM system to refresh context
if (result) {
this.notifyLLMContextUpdate();
}
return result;
}
} catch (error) {
console.error("Error deleting memory:", error, { memoryId });
return false;
}
}
notifyLLMContextUpdate() {
// Debounce context updates to avoid excessive calls
if (this.contextUpdateTimeout) {
clearTimeout(this.contextUpdateTimeout);
}
this.contextUpdateTimeout = setTimeout(() => {
if (window.kimiLLM && typeof window.kimiLLM.refreshMemoryContext === "function") {
window.kimiLLM.refreshMemoryContext();
}
}, 500);
}
async getMemoriesByCategory(category, character = null) {
if (!this.db) return [];
try {
character = character || this.selectedCharacter;
if (this.db.db.memories) {
return await this.db.db.memories
.where("[character+category]")
.equals([character, category])
.and(m => m.isActive)
.reverse()
.sortBy("timestamp");
}
} catch (error) {
console.error("Error getting memories by category:", error);
return [];
}
}
async getAllMemories(character = null) {
if (!this.db) return [];
try {
character = character || this.selectedCharacter;
if (this.db.db.memories) {
const memories = await this.db.db.memories
.where("character")
.equals(character)
.and(m => m.isActive)
.reverse()
.sortBy("timestamp");
console.log(`Retrieved ${memories.length} memories for character: ${character}`);
return memories;
}
} catch (error) {
console.error("Error getting all memories:", error);
return [];
}
}
async findSimilarMemory(memoryData) {
if (!this.db) return null;
try {
const memories = await this.getMemoriesByCategory(memoryData.category);
// Enhanced similarity check with multiple criteria
for (const memory of memories) {
const contentSimilarity = this.calculateSimilarity(memory.content, memoryData.content);
// Different thresholds based on category
let threshold = 0.8;
if (memoryData.category === "personal") {
threshold = 0.6; // Names and personal info can vary more
} else if (memoryData.category === "preferences") {
threshold = 0.7; // Preferences can be expressed differently
}
if (contentSimilarity > threshold) {
return memory;
}
// Special handling for names (check if one is contained in the other)
if (memoryData.category === "personal" && this.areRelatedNames(memory.content, memoryData.content)) {
return memory;
}
}
} catch (error) {
console.error("Error finding similar memory:", error);
}
return null;
}
// Check if two names are related (nicknames, variants, etc.)
areRelatedNames(name1, name2) {
const n1 = name1.toLowerCase().trim();
const n2 = name2.toLowerCase().trim();
// Exact match
if (n1 === n2) return true;
// One contains the other (Jean-Pierre vs Jean)
if (n1.includes(n2) || n2.includes(n1)) return true;
// Common nickname patterns
const nicknames = {
jean: ["jp", "jeannot"],
pierre: ["pete", "pietro"],
marie: ["mary", "maria"],
michael: ["mike", "mick"],
william: ["bill", "will", "willy"],
robert: ["bob", "rob", "bobby"],
richard: ["rick", "dick", "richie"],
thomas: ["tom", "tommy"],
christopher: ["chris", "kit"],
anthony: ["tony", "ant"]
};
for (const [full, nicks] of Object.entries(nicknames)) {
if ((n1 === full && nicks.includes(n2)) || (n2 === full && nicks.includes(n1))) {
return true;
}
}
return false;
}
calculateSimilarity(text1, text2) {
// Enhanced similarity calculation
const words1 = text1
.toLowerCase()
.split(/\s+/)
.filter(w => w.length > 2);
const words2 = text2
.toLowerCase()
.split(/\s+/)
.filter(w => w.length > 2);
if (words1.length === 0 || words2.length === 0) {
return text1.toLowerCase() === text2.toLowerCase() ? 1 : 0;
}
const intersection = words1.filter(word => words2.includes(word));
const union = [...new Set([...words1, ...words2])];
let similarity = intersection.length / union.length;
// Boost similarity for exact substring matches
if (text1.toLowerCase().includes(text2.toLowerCase()) || text2.toLowerCase().includes(text1.toLowerCase())) {
similarity += 0.2;
}
return Math.min(1.0, similarity);
}
async cleanupOldMemories() {
if (!this.db) return;
try {
// Retrieve all active memories for the current character
const memories = await this.getAllMemories();
// If the number of memories exceeds the limit (this.maxMemoryEntries),
// delete the least important/oldest ones to keep only the most relevant.
if (memories.length > this.maxMemoryEntries) {
// Sort by importance (confidence) and recency (timestamp)
memories.sort((a, b) => {
// Score = confidence * age (the higher the score, the less priority the memory has)
const scoreA = a.confidence * (Date.now() - new Date(a.timestamp).getTime());
const scoreB = b.confidence * (Date.now() - new Date(b.timestamp).getTime());
return scoreB - scoreA;
});
// Delete all memories beyond the limit
const toDelete = memories.slice(this.maxMemoryEntries);
for (const memory of toDelete) {
await this.deleteMemory(memory.id);
}
}
} catch (error) {
console.error("Error cleaning up old memories:", error);
}
}
// MEMORY RETRIEVAL FOR LLM
async getRelevantMemories(context = "", limit = 10) {
if (!this.memoryEnabled) return [];
try {
const allMemories = await this.getAllMemories();
if (allMemories.length === 0) return [];
if (!context) {
// Return most important and recent memories
return this.selectMostImportantMemories(allMemories, limit);
}
// Score memories based on relevance to context
const scoredMemories = allMemories.map(memory => ({
...memory,
relevanceScore: this.calculateRelevance(memory, context)
}));
// Sort by relevance and return top results
scoredMemories.sort((a, b) => b.relevanceScore - a.relevanceScore);
// Filter out very low relevance memories
const relevantMemories = scoredMemories.filter(m => m.relevanceScore > 0.1);
return relevantMemories.slice(0, limit);
} catch (error) {
console.error("Error getting relevant memories:", error);
return [];
}
}
// Select most important memories when no context is provided
selectMostImportantMemories(memories, limit) {
// Score by importance, recency, and access count
const scoredMemories = memories.map(memory => {
let score = memory.importance || 0.5;
// Boost recent memories
const daysSinceCreation = (Date.now() - new Date(memory.timestamp)) / (1000 * 60 * 60 * 24);
score += Math.max(0, (7 - daysSinceCreation) / 7) * 0.2; // Recent boost
// Boost frequently accessed memories
const accessCount = memory.accessCount || 0;
score += Math.min(accessCount / 10, 0.2); // Access boost
// Boost high confidence memories
score += (memory.confidence || 0.5) * 0.1;
return { ...memory, importanceScore: score };
});
scoredMemories.sort((a, b) => b.importanceScore - a.importanceScore);
return scoredMemories.slice(0, limit);
}
calculateRelevance(memory, context) {
const contextWords = context
.toLowerCase()
.split(/\s+/)
.filter(w => w.length > 2);
const memoryWords = memory.content
.toLowerCase()
.split(/\s+/)
.filter(w => w.length > 2);
let score = 0;
// Enhanced content similarity with keyword matching
score += this.calculateSimilarity(memory.content, context) * 0.4;
// Keyword matching bonus
let keywordMatches = 0;
for (const word of contextWords) {
if (memoryWords.includes(word)) {
keywordMatches++;
}
}
if (contextWords.length > 0) {
score += (keywordMatches / contextWords.length) * 0.3;
}
// Category relevance bonus based on context
score += this.getCategoryRelevance(memory.category, context) * 0.1;
// Recent memories get bonus for current conversation
const daysSinceCreation = (Date.now() - new Date(memory.timestamp)) / (1000 * 60 * 60 * 24);
score += Math.max(0, (30 - daysSinceCreation) / 30) * 0.1;
// Confidence and importance boost
score += (memory.confidence || 0.5) * 0.05;
score += (memory.importance || 0.5) * 0.05;
return Math.min(1.0, score);
}
// Determine if memory category is relevant to current context
getCategoryRelevance(category, context) {
const contextLower = context.toLowerCase();
const categoryKeywords = {
personal: [
"name",
"age",
"live",
"work",
"job",
"who",
"am",
"myself",
"appelle",
"nombre",
"chiamo",
"heiße",
"名前",
"名字",
"我叫"
],
preferences: [
"like",
"love",
"hate",
"prefer",
"enjoy",
"favorite",
"dislike",
"j'aime",
"j'adore",
"je préfère",
"je déteste",
"me gusta",
"prefiero",
"odio",
"mi piace",
"preferisco",
"ich mag",
"ich bevorzuge",
"hasse"
],
relationships: [
"family",
"friend",
"wife",
"husband",
"partner",
"mother",
"father",
"girlfriend",
"boyfriend",
"anniversary",
"date",
"kiss",
"move in",
"famille",
"ami",
"copine",
"copain",
"anniversaire",
"rendez-vous",
"baiser",
"emménagé",
"pareja",
"cita",
"beso",
"aniversario",
"mudarnos",
"fidanzata",
"fidanzato",
"anniversario",
"bacio",
"trasferiti",
"freundin",
"freund",
"jahrestag",
"kuss",
"eingezogen"
],
activities: [
"play",
"hobby",
"sport",
"activity",
"practice",
"do",
"joue",
"passe-temps",
"hobby",
"juego",
"pasatiempo",
"gioco",
"passatempo",
"spiele",
"hobby"
],
goals: [
"want",
"plan",
"goal",
"dream",
"hope",
"wish",
"future",
"veux",
"objectif",
"apprends",
"aprendo",
"voglio",
"obiettivo",
"lerne",
"ziel"
],
experiences: [
"remember",
"happened",
"story",
"experience",
"time",
"we met",
"first date",
"first kiss",
"anniversary",
"rencontré",
"premier rendez-vous",
"premier baiser",
"anniversaire",
"conocimos",
"primera cita",
"primer beso",
"aniversario",
"conosciuti",
"primo appuntamento",
"primo bacio",
"anniversario",
"kennengelernt",
"erstes date",
"erster kuss",
"jahrestag"
],
important: [
"important",
"remember",
"special",
"never forget",
"important",
"souvenir",
"spécial",
"importante",
"recuerda",
"importante",
"ricorda",
"wichtig",
"erinnere"
]
};
const keywords = categoryKeywords[category] || [];
let relevance = 0;
for (const keyword of keywords) {
if (contextLower.includes(keyword)) {
relevance += 0.2;
}
}
return Math.min(1.0, relevance);
}
// Update access count when memory is used
async recordMemoryAccess(memoryId) {
try {
const memory = await this.db.db.memories.get(memoryId);
if (memory) {
memory.accessCount = (memory.accessCount || 0) + 1;
memory.lastAccess = new Date();
await this.db.db.memories.put(memory);
}
} catch (error) {
console.error("Error recording memory access:", error);
}
}
// ===== MEMORY SCORING & RANKING =====
scoreMemory(memory) {
// Factors: importance (0-1), recency, frequency, confidence
const now = Date.now();
const created = memory.createdAt
? new Date(memory.createdAt).getTime()
: memory.timestamp
? new Date(memory.timestamp).getTime()
: now;
const lastAccess = memory.lastAccess ? new Date(memory.lastAccess).getTime() : created;
const ageMs = Math.max(1, now - created);
const sinceLastAccessMs = Math.max(1, now - lastAccess);
// Recency: exponential decay
const recency = Math.exp(-sinceLastAccessMs / (1000 * 60 * 60 * 24 * 14)); // 14-day half-life approx
const freshness = Math.exp(-ageMs / (1000 * 60 * 60 * 24 * 60)); // 60-day aging
const freq = Math.log10((memory.accessCount || 0) + 1) / Math.log10(50); // normalized frequency (cap ~50)
const importance = typeof memory.importance === "number" ? memory.importance : 0.5;
const confidence = typeof memory.confidence === "number" ? memory.confidence : 0.5;
// Weighted sum
const score = importance * 0.35 + recency * 0.2 + freq * 0.15 + confidence * 0.2 + freshness * 0.1;
return Number(score.toFixed(6));
}
async getRankedMemories(contextText = "", limit = 7) {
const all = await this.getAllMemories();
if (!all.length) return [];
// Optional basic context relevance boost
const ctxLower = (contextText || "").toLowerCase();
return all
.map(m => {
let baseScore = this.scoreMemory(m);
if (ctxLower && m.content && ctxLower.includes(m.content.toLowerCase().split(" ")[0])) {
baseScore += 0.05; // tiny relevance boost
}
return { memory: m, score: baseScore };
})
.sort((a, b) => b.score - a.score)
.slice(0, limit)
.map(r => r.memory);
}
// MEMORY STATISTICS
async getMemoryStats() {
try {
const memories = await this.getAllMemories();
const stats = {
total: memories.length,
byCategory: {},
averageConfidence: 0,
oldestMemory: null,
newestMemory: null
};
if (memories.length > 0) {
// Category breakdown
for (const memory of memories) {
stats.byCategory[memory.category] = (stats.byCategory[memory.category] || 0) + 1;
}
// Average confidence
stats.averageConfidence = memories.reduce((sum, m) => sum + m.confidence, 0) / memories.length;
// Oldest and newest
const sortedByDate = [...memories].sort((a, b) => new Date(a.timestamp) - new Date(b.timestamp));
stats.oldestMemory = sortedByDate[0];
stats.newestMemory = sortedByDate[sortedByDate.length - 1];
}
return stats;
} catch (error) {
console.error("Error getting memory stats:", error);
return { total: 0, byCategory: {}, averageConfidence: 0 };
}
}
// MEMORY TOGGLE
async toggleMemorySystem(enabled) {
this.memoryEnabled = enabled;
if (this.db) {
await this.db.setPreference("memorySystemEnabled", enabled);
}
}
// EXPORT/IMPORT MEMORIES
async exportMemories() {
try {
const memories = await this.getAllMemories();
return {
exportDate: new Date().toISOString(),
character: this.selectedCharacter,
memories: memories,
version: "1.0"
};
} catch (error) {
console.error("Error exporting memories:", error);
return null;
}
}
async importMemories(importData) {
if (!importData || !importData.memories) return false;
try {
for (const memory of importData.memories) {
await this.addMemory({
...memory,
type: "imported",
character: this.selectedCharacter
});
}
return true;
} catch (error) {
console.error("Error importing memories:", error);
return false;
}
}
// MIGRATION UTILITIES
async migrateIncompatibleIDs() {
if (!this.db) return false;
try {
console.log("🔧 Début de la migration des IDs incompatibles...");
// Récupérer toutes les mémoires
const allMemories = await this.db.db.memories.toArray();
console.log(`📊 ${allMemories.length} mémoires trouvées`);
const incompatibleMemories = allMemories.filter(memory => {
// Les IDs auto-increment sont des entiers séquentiels (1, 2, 3...)
// Les anciens IDs manuels sont des nombres très grands (timestamps)
return memory.id > 10000; // Seuil arbitraire pour détecter les anciens IDs
});
if (incompatibleMemories.length === 0) {
console.log("✅ Aucune migration nécessaire");
return true;
}
console.log(`🔄 Migration de ${incompatibleMemories.length} mémoires avec IDs incompatibles`);
// Sauvegarder les données avant suppression
const dataToMigrate = incompatibleMemories.map(memory => {
const { id, ...memoryData } = memory; // Enlever l'ancien ID
return memoryData;
});
// Supprimer les anciennes entrées
await this.db.db.memories.bulkDelete(incompatibleMemories.map(m => m.id));
// Réinsérer avec de nouveaux IDs auto-générés
const newIds = await this.db.db.memories.bulkAdd(dataToMigrate);
console.log(`✅ Migration terminée. Nouveaux IDs:`, newIds);
return true;
} catch (error) {
console.error("❌ Erreur lors de la migration:", error);
return false;
}
}
}
window.KimiMemorySystem = KimiMemorySystem;
export default KimiMemorySystem;
window.KimiMemorySystem = KimiMemorySystem;
|