Search Results for "live-graph"

...It builds a semantic index of a project using vector embeddings, enabling natural language queries like “authentication logic” to return contextually relevant functions and modules even when naming differs dramatically, making code exploration far more intuitive. In addition to semantic search, grepai offers call graph tracing so developers can understand which functions call or are called by others, aiding impact analysis and confident refactoring. Because it runs 100 % locally, your codebase never leaves your machine, preserving privacy and security while supporting AI agents and custom integrations.

Vedana is an open-source multi-agent RAG system built around a typed knowledge graph. It is designed for questions that require structure, completeness, and traceability instead of simple text similarity. The system lets agents navigate data step by step through Cypher queries, vector search, document lookup, and source verification. Its architecture combines a knowledge graph, pgvector-based embeddings, incremental ETL, and a backoffice interface for chat, metrics, prompt tuning, and data loading. ...

...Instead of relying on traditional rule-based extraction techniques, KG-Gen uses language models to identify entities and their relationships, producing higher-quality graph structures from raw text. The framework addresses common problems in automatic knowledge graph construction, particularly sparsity and duplication of entities, by applying a clustering and entity-resolution process that merges semantically similar nodes. This allows the generated graphs to be denser, more coherent, and easier to use for downstream tasks such as retrieval-augmented generation, semantic search, and reasoning systems.

...LEANN introduces a storage-efficient approximate nearest neighbor index combined with on-the-fly embedding recomputation to avoid storing large embedding vectors. By recomputing embeddings during queries and using compact graph-based indexing structures, LEANN can maintain high search accuracy while minimizing disk usage. It aims to act as a unified personal knowledge layer that connects different types of data such as documents, code, images, and other local files into a searchable context for language models.

...You can add an index to use approximate nearest neighbor search, which trades some recall for speed. Unlike typical indexes, you will see different results for queries after adding an approximate index. An HNSW index creates a multilayer graph. It has better query performance than IVFFlat (in terms of speed-recall tradeoff), but has slower build times and uses more memory. Also, an index can be created without any data in the table since there isn’t a training step like IVFFlat.

Controllable-RAG-Agent is an advanced Retrieval-Augmented Generation (RAG) system designed specifically for complex, multi-step question answering over your own documents. Instead of relying solely on simple semantic search, it builds a deterministic control graph that acts as the “brain” of the agent, orchestrating planning, retrieval, reasoning, and verification across many steps. The pipeline ingests PDFs, splits them into chapters, cleans and preprocesses text, then constructs vector stores for fine-grained chunks, chapter summaries, and book quotes to support nuanced queries. At query time, it anonymizes entities, creates a high-level plan, de-anonymizes and expands that plan into concrete retrieval or reasoning tasks, and executes them in sequence while continuously revising the plan. ...