VeritasGraph
Related Servers
Alternatives to VeritasGraph
No user-submitted related servers found.
Related Servers
- FlicenseAqualityBmaintenanceLocal-first MCP graph intelligence server providing RRF hybrid search, multi-hop traversal, source snippets, and rationale nodes for AI agents, without Docker or web UI.5-
- FlicenseNot gradedqualityCmaintenanceA local-first, LLM-agnostic MCP server that lets you ask hard questions about your documents, media, and code, and get traceable answers entirely offline.-
- FlicenseNot gradedqualityDmaintenanceA local-first MCP server that transforms crypto whitepapers into a knowledge graph and vector corpus, enabling entity-filtered RAG question answering with optional knowledge graph enrichment.-
- AlicenseNot gradedqualityDmaintenanceAn open-source MCP server for RAG over personal documents. Supports three parallel strategies — Traditional, Contextual, and Graph RAG — with all data stored locally for privacy.MIT
- FlicenseNot gradedqualityBmaintenanceMCP server for building knowledge graphs from documents. It ingests PDF/PPTX/DOCX files, transcribes to Markdown, and uses LLM to bootstrap entity patterns and build a JSONL knowledge graph with RAG chunks.-
- AlicenseNot gradedqualityAmaintenanceMCP server for local RAG over personal notes, PDFs, and documents, enabling plain-English querying and hybrid search with multi-hop context expansion.MIT
TDQS
Scored across 5 tools
Each tool has a clearly distinct purpose: clearing the graph, retrieving the full graph, ingesting documents, querying with reasoning, and searching entities. No ambiguity or overlap.
All tools use the 'veritasgraph_' prefix and mostly follow a verb_noun pattern (e.g., clear_graph, get_graph, ingest_document, search_entities). 'query' deviates slightly as a single verb, but it's still clear and consistent in style.
With 5 tools, the set is well-scoped for a knowledge graph server, covering ingestion, retrieval, searching, and clearing without being excessive or insufficient.
The tool set covers core operations: create (ingest), read (get_graph, search_entities, query), and delete (clear_graph). Minor gaps include the lack of update or individual entity deletion, but these are reasonable omissions for the intended use case.