Skip to main content
Glama
91,387 servers. Updated

Matching MCP tools:

Matching MCP Connectors:

"A tool or algorithm to convert code into a tree structure" matching MCP servers:

GET /v1/servers – MCP directory API reference
  • F
    license
    Not graded
    quality
    B
    maintenance
    Enables any MCP-compatible AI assistant to search, filter, and retrieve information from a local document collection using a hybrid search pipeline with vector, BM25, reranking, and LLM enrichment.
    4
    -
  • A
    license
    Not graded
    quality
    D
    maintenance
    A Python-based MCP server that enables document-based question answering by processing PDF, TXT, and Markdown files through OpenAI's API. It provides hallucination-free responses based strictly on document content using semantic search and includes a web interface for management.
    MIT
  • A
    license
    Not graded
    quality
    D
    maintenance
    Enables document-based question answering using OpenAI's GPT-4 with semantic search and embeddings. Upload PDF, TXT, or Markdown files and get answers strictly based on document content with source attribution and confidence scores.
    MIT
  • F
    license
    Not graded
    quality
    B
    maintenance
    A universal MCP tool gateway that manages multiple remote tool processes, enabling LLMs to dynamically invoke web scraping, summarization, and knowledge retrieval through standardized Function Calling.
    -
  • A
    license
    A
    quality
    C
    maintenance
    Converts AI Skills (following Claude Skills format) into MCP server resources, enabling LLM applications to discover, access, and utilize self-contained skill directories through the Model Context Protocol. Provides tools to list available skills, retrieve skill details and content, and read supporting files with security protections.
    3
    28
    Apache 2.0
  • F
    license
    A
    quality
    D
    maintenance
    A local MCP server that provides semantic code search for Python codebases using tree-sitter for chunking and LanceDB for vector storage. It enables natural language queries to find relevant code snippets based on meaning rather than just text matching.
    3
    3
    -
  • A
    license
    A
    quality
    D
    maintenance
    Enables semantic search over codebases using natural language queries, returning relevant code snippets with source locations. Integrates with Claude Code for automatic codebase exploration.
    1
    1
    MIT
  • A
    license
    A
    quality
    C
    maintenance
    An MCP server that provides dynamic codebase context to Claude Code through tools like hybrid search, recent changes, and symbol definitions, enhancing AI-assisted coding with local RAG.
    8
    MIT
  • A
    license
    A
    quality
    B
    maintenance
    An MCP server that indexes a repository locally and provides keyword, semantic, hybrid, and SQL search tools, enabling coding agents to answer questions about the codebase efficiently without reading files one by one.
    3
    221 npm
    31
    Apache 2.0
  • F
    license
    A
    quality
    B
    maintenance
    Enables agents to run semantic search across one or more local project directories by automatically maintaining a LAN-local Qdrant index with Ollama embeddings. Indexing, staleness checks, and incremental updates happen transparently, so users can query code by meaning without managing collections, chunks, or hashes.
    6
    -
  • A
    license
    A
    quality
    A
    maintenance
    Graph-based tool retrieval for LLM agents. Builds a tool graph from OpenAPI/MCP specs and retrieves multi-step workflows via hybrid search (BM25 + graph traversal + embedding), recovering accuracy from 12% to 82% with 79% fewer tokens. Also works as an MCP Proxy to aggregate multiple servers behind 3 meta-tools.
    6
    91 PyPI
    17
    MIT
  • A
    license
    A
    quality
    B
    maintenance
    A self-hosted semantic code retrieval MCP server that enables natural language queries to find relevant code snippets using Tree-sitter AST parsing, embedding, and hybrid search with reranking.
    1
    2
    MIT