Semantic Memory Retrieval With Recency And Relevance Weighting

via “semantic search and retrieval with query-time reranking”

<p align="center"> <img height="100" width="100" alt="LlamaIndex logo" src="https://ts.llamaindex.ai/square.svg" /> </p> <h1 align="center">LlamaIndex.TS</h1> <h3 align="center"> Data framework for your LLM application. </h3>

Unique: Abstracts retrieval strategies behind a pluggable Retriever interface, allowing developers to compose vector search, BM25, and LLM-reranking without changing application code, and supporting query-time metadata filtering across heterogeneous vector stores

vs others: More composable than LangChain's retriever chain because it separates retrieval strategy from reranking logic, enabling A/B testing of different reranking models without modifying the retrieval pipeline

via “semantic similarity retrieval with configurable search strategies”

LangChain reference RAG implementation from scratch.

Unique: Implements multiple retrieval strategies (similarity_search, similarity_search_with_score, max_marginal_relevance_search) allowing developers to choose between pure semantic similarity, scored results for confidence estimation, and diversity-aware retrieval that reduces redundancy in results.

vs others: More flexible than single-strategy retrievers because it supports semantic, keyword, and hybrid search without reimplementation; more practical than custom retrieval because it leverages vector store native search capabilities with proven relevance ranking.

via “semantic-search-with-relevance-ranking”

AI-powered internal knowledge base dashboard template.

Unique: Leverages Vercel AI SDK's streaming capabilities to return search results progressively while re-ranking happens in parallel, improving perceived latency. Supports multi-model search (query with GPT-4, rank with Claude) without manual orchestration.

vs others: More accurate than Elasticsearch keyword search for conceptual queries; faster to implement than building custom re-ranking logic because the template includes LLM-based relevance scoring out of the box.

via “dual-memory-system-with-semantic-search”

End-to-end, code-first tutorials for building production-grade GenAI agents. From prototype to enterprise deployment.

Unique: Explicitly separates short-term (Redis) and long-term (vector DB) memory with configurable retrieval strategies, using RedisConfig and VectorStore abstractions — most frameworks conflate these into a single context window, losing the ability to scale memory independently

vs others: Outperforms naive RAG approaches (e.g., LangChain's memory classes) by decoupling recency from relevance; agents can access week-old memories if semantically similar while keeping recent context in fast Redis, reducing both latency and token waste

via “semantic memory search with vector and graph-based retrieval”

Universal memory layer for AI Agents

Unique: Supports both vector-based semantic search (24+ vector store providers) and graph-based entity/relationship search (multiple graph store providers) with a unified API, allowing developers to choose or combine retrieval strategies. Includes configurable similarity thresholds and reranking to optimize result quality without requiring manual prompt engineering.

vs others: More flexible than pure vector search (Pinecone, Weaviate) because it adds graph-based relationship traversal, and more practical than pure graph search because it combines semantic similarity scoring with structural queries, enabling both fuzzy and precise memory retrieval.

via “fusion-retrieval-with-multi-strategy-ranking”

This repository showcases various advanced techniques for Retrieval-Augmented Generation (RAG) systems. Each technique has a detailed notebook tutorial.

Unique: Implements Reciprocal Rank Fusion and weighted scoring to combine dense semantic retrieval with sparse keyword retrieval, allowing developers to balance semantic understanding with exact-match precision without choosing one strategy — a hybrid approach that's more robust than single-strategy retrieval

vs others: More comprehensive than pure semantic search because it captures both meaning and keywords, and more practical than pure BM25 because it includes semantic understanding; fusion is more maintainable than building a custom unified ranking function

via “semantic-relevance-ranking”

Search the web and codebases to get precise, up-to-date context for programming and research. Find examples, API usage, and documentation from real repositories and sites to ship faster with fewer mistakes. Extend investigations with deep search, crawling, and business or profile lookups when needed

Unique: Uses transformer-based embeddings to understand query intent and document semantics, enabling matching on conceptual similarity rather than keyword overlap. Ranks results by relevance to the developer's underlying problem, not just surface-level keyword matches.

vs others: More effective than keyword-based ranking for technical searches because it understands that 'retry with backoff' and 'exponential delay on failure' are semantically equivalent, surfacing relevant results even when terminology differs.

via “semantic search and retrieval with ranking”

A data framework for building LLM applications over external data.

Unique: Implements a pluggable Retriever abstraction supporting multiple retrieval strategies (similarity, MMR, fusion, custom) that can be composed and chained. Built-in support for re-ranking via LLM or cross-encoder, and hybrid search combining dense and sparse retrieval without custom integration code.

vs others: More flexible retrieval composition than LangChain's retrievers; built-in re-ranking and fusion strategies reduce boilerplate for advanced retrieval pipelines.

via “embedding-based semantic memory retrieval”

Most RAG setups fail because they treat memory like a static filing cabinet. When every transient bug fix or abandoned rule is stored forever, the context window eventually chokes on noise, spiking token costs and degrading the agent&#x27;s reasoning.This implementation experiments with a biological

Unique: Integrates semantic embedding-based retrieval with decay probability scoring, ranking memories by both semantic relevance and temporal confidence. Decay filtering is applied post-retrieval, not pre-computed, allowing dynamic threshold adjustment.

vs others: More flexible than keyword-based search (handles paraphrasing and semantic drift) but more expensive and slower than simple BM25; enables natural language queries without requiring structured memory schemas.

via “memory quality assessment and relevance ranking”

Hello HN! I built collabmem, a simple memory system for long-term collaboration between humans and AI assistants. And it&#x27;s easy to install, just ask Claude Code: Install the long-term collaboration memory system by cloning https:&#x2F;&#x2F;github.com&#x2F;visionscaper&#x2F;collabmem to a te

Unique: Implements multi-factor relevance ranking for collaborative memories combining recency, frequency, semantic similarity, and user feedback, rather than simple keyword or embedding-based retrieval

vs others: Learns from user feedback to improve memory ranking over time, whereas static semantic search provides no mechanism for quality improvement

via “semantic reranking with relevance scoring”

Python AI package: cohere

Unique: Provides a dedicated reranking model separate from the embedding model, enabling two-stage retrieval (fast approximate search + precise semantic reranking) without embedding the entire corpus

vs others: Specialized reranking endpoint with relevance scores, whereas alternatives like Pinecone or Weaviate require using the same model for both search and ranking

via “semantic-memory-retrieval-with-ranking”

Core memory palace engine for AgentRecall

Unique: Combines three independent ranking signals (semantic similarity, temporal decay, access frequency) into a unified score rather than relying solely on embedding similarity like standard RAG. Uses spatial memory palace structure to pre-filter candidates before ranking, reducing computation vs. flat vector search.

vs others: More sophisticated than simple vector similarity search because it weights recency and usage patterns, preventing old but semantically similar memories from drowning out recent relevant ones. Spatial pre-filtering reduces ranking computation vs. exhaustive similarity search.

via “contextual memory retrieval”

Remember user details and preferences across conversations. Organize facts into connected profiles for richer, long-term context. Search, update, and automatically extract locations to keep memories accurate and actionable.

Unique: Implements a context-aware search algorithm that dynamically ranks memories based on the conversation's current state, improving relevance.

vs others: More effective than static memory retrieval systems, as it adapts to the flow of conversation and user needs.

via “semantic-memory-retrieval-with-similarity-search”

** a lightweight, local RAG memory store to record, retrieve, update, delete, and visualize persistent "memories" across sessions—perfect for developers working with multiple AI coders (like Windsurf, Cursor, or Copilot) or anyone who wants their AI to actually remember them.

Unique: Implements category-aware filtering and recent-memory shortcuts alongside semantic search, allowing agents to choose between expensive semantic queries and fast recency-based lookups depending on context needs

vs others: More lightweight than LangChain's memory modules by focusing purely on vector similarity without additional re-ranking or fusion strategies, trading some ranking sophistication for lower latency and simpler integration

via “relevance-scored memory retrieval”

Store and search user-specific memories to maintain context and enable informed decision-making based on past interactions. Seamlessly integrate memory capabilities into your AI tools with a simple and intuitive API. Enhance your agents with relevance-scored memory retrieval for improved contextual

Unique: Incorporates advanced machine learning techniques for relevance scoring, providing a more dynamic and context-aware memory retrieval process than static keyword matching systems.

vs others: Delivers superior relevance in memory retrieval compared to traditional systems that rely solely on keyword matching.

via “cross-encoder semantic reranking for retrieval refinement”

OpenAI intelligence adapter for Engram — embeddings, summarization, entity extraction, cross-encoder reranking

Unique: Reranking is transparently applied within Engram's retrieval abstraction, allowing agents to request 'top-k memories' without explicitly managing the two-stage retrieval pipeline

vs others: More accurate than embedding-only retrieval because cross-encoders jointly model query-document pairs, but more expensive than single-stage embedding search

via “contextual memory retrieval”

Store and retrieve user-specific memories to maintain reliable long-term context. Search past memories to surface the most relevant details instantly. Organize preferences and facts per user for consistent, personalized interactions across sessions.

Unique: Incorporates both keyword indexing and semantic search to enhance the relevance of retrieved memories, unlike simpler keyword-only systems.

vs others: Provides faster and more relevant memory retrieval than systems relying solely on keyword matching.

via “semantic-document-retrieval-with-ranking”

** - Production-ready RAG out of the box to search and retrieve data from your own documents.

Unique: unknown — insufficient architectural detail on similarity metric choice, ranking algorithm, or result filtering strategies

vs others: Integrates retrieval directly into MCP protocol, allowing Claude and other MCP clients to invoke document search as a native tool without custom API wrappers

via “semantic search for long-term memories”

Save, search, and manage long-term memories across users and apps. Quickly recall facts, preferences, and past conversations with semantic search and structured filters. Update or delete specific entries, or bulk-clear a scope to keep context accurate and tidy.

Unique: Integrates a custom-built vector embedding model tailored for user memory contexts, enhancing retrieval accuracy over generic models.

vs others: More efficient than traditional keyword-based searches as it understands context, reducing irrelevant results.

via “semantic search with temporal awareness”

Enhance your LLM applications with a scalable knowledge graph memory system. Utilize semantic search and temporal awareness to manage and retrieve information effectively, ensuring your agents have persistent and contextual memory capabilities.

Unique: Memento's semantic search integrates temporal awareness directly into the knowledge graph, enabling contextually relevant results based on the timing of information.

vs others: More effective than traditional keyword-based search engines by incorporating temporal context into the retrieval process.