Skip to main content
Glama
84,099 servers. Updated

Matching MCP tools:

Matching MCP Connectors:

"A semantic search router for dynamically discovering and routing MCP tool definitions" matching MCP servers:

GET /v1/servers – MCP directory API reference
  • F
    license
    D
    quality
    D
    maintenance
    Enables AI agents to perform semantic search over codebases by converting natural language queries into efficient search patterns like grep and ripgrep. It utilizes LLMs to verify relevance and find code snippets that traditional keyword-based searches might miss.
    1
    -
  • A
    license
    Not graded
    quality
    B
    maintenance
    Enables cost-aware LLM routing over MCP with verification-based cascading, offering tools for routing queries, resuming escalated approvals, estimating costs, comparing policies, and explaining routing decisions, plus read-only resources and a policy-selection prompt.
    MIT
  • A
    license
    Not graded
    quality
    D
    maintenance
    A semantic router that enables discovery, management, and execution of tools across multiple MCP servers using natural language.
    MIT
  • A
    license
    Not graded
    quality
    D
    maintenance
    An unofficial MCP server that provides semantic search capabilities for Hugging Face models and datasets, enabling Claude and other MCP-compatible clients to search, discover, and explore the Hugging Face ecosystem using natural language queries.
    20
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    Enables MCP clients to serve and query semantic models, providing tools for entity descriptions, metric lookups, context resolution, and operation validation for AI agents.
    MIT
  • F
    license
    Not graded
    quality
    D
    maintenance
    Provides a Google search tool via the Serper API, returning structured results and a summary answer for LLMs like Claude.
    1
    -
  • A
    license
    A
    quality
    A
    maintenance
    A read-only PostgreSQL MCP server for AI coding agents that exposes database schema and sample data as tools, with LLM-powered semantic search enriched by a user-authored semantic layer.
    4
    MIT
  • A
    license
    A
    quality
    A
    maintenance
    Routes your AI tasks to the best available model across 20+ providers — automatically selecting based on task type, budget, and subscription pressure. Supports text, image, video, and audio with built-in cost optimization and fallback chains.
    60
    77
    MIT
  • A
    license
    Not graded
    quality
    F
    maintenance
    LLM routing proxy that cuts API costs 60-90% by auto-selecting the cheapest capable model across OpenAI, Anthropic, and Google. Provides stats, config, and model comparison tools via MCP.
    21
    1
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    Enables MCP clients to connect to a privacy-first, self-hostable workout planning and training log, allowing coaching agents to preview and apply program changes while accessing training data through OAuth-protected endpoints.
    AGPL 3.0
  • A
    license
    Not graded
    quality
    A
    maintenance
    MCP server for the OrionBelt Semantic Layer. Enables LLMs to explore governed semantic models, compile YAML metric definitions into optimized SQL across 8 engines (BigQuery, ClickHouse, Databricks, Dremio, DuckDB, MySQL, PostgreSQL, Snowflake), and execute analytics queries via natural language. Works with Claude, Cursor, Windsurf, and Copilot.
    3
    Apache 2.0
  • A
    license
    Not graded
    quality
    D
    maintenance
    MCP server for connecting to Microsoft Fabric and Power BI semantic models, enabling workspace browsing, dataset management, TMSL retrieval, DAX queries, model creation/editing, and includes a Best Practice Analyzer with 71 rules.
    2
    MIT
  • A
    license
    Not graded
    quality
    F
    maintenance
    Provides worktree-aware semantic code indexing and search via MCP, enabling agents to query indexed code and monitor indexing status while keeping lifecycle operations separate.
    MIT