Skip to main content
Glama
87,560 servers. Updated

Matching MCP tools:

Matching MCP Connectors:

"Search results for proofcut" matching MCP servers:

GET /v1/servers – MCP directory API reference
  • F
    license
    A
    quality
    B
    maintenance
    An MCP server that retrieves resume/experience evidence relevant to a job description via vector RAG, and tracks fit-analysis results in a configurable tracking store (Notion or SQLite), with tools like match_job, push_to_tracker, and list_applications.
    3
    -
  • A
    license
    Not graded
    quality
    C
    maintenance
    Semantic, on-demand skill retrieval for Claude Code that saves tokens and improves skill discovery by replacing the native skill listing with vector embedding search.
    8
    MIT
  • A
    license
    Not graded
    quality
    C
    maintenance
    Local offline semantic search over documents (txt, md, pdf, docx, pptx, csv). Indexes folders into a LanceDB vector database with multilingual embeddings and supports hybrid vector + keyword search via Reciprocal Rank Fusion. No API keys, no cloud, no Docker required.
    28
    AGPL 3.0
  • A
    license
    Not graded
    quality
    C
    maintenance
    An MCP server that enables hybrid semantic and keyword retrieval over your documents, using PostgreSQL and pgvector as the backend. It fuses rankings from both methods to provide high-quality search results to the language model.
    MIT
  • A
    license
    Not graded
    quality
    C
    maintenance
    MCP server that searches documents in Qdrant using embeddings from LMStudio. Takes a text query, converts it to a vector via LMStudio's OpenAI-compatible API, and performs semantic search in Qdrant.
    15 npm
    ISC
  • 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
  • F
    license
    Not graded
    quality
    B
    maintenance
    Enables stateless similarity search over pre-computed vector corpora using NMI and cosine fusion with entropy-calibrated weighting. Provides tools for ranking, scoring, outlier detection, and alpha calibration for AI agents.
    -
  • F
    license
    Not graded
    quality
    D
    maintenance
    Enables Claude Desktop to search private documents using Azure AI Search and perform web searches with Bing, providing AI-enhanced results with source citations through Azure AI Agent Service or direct Azure AI Search integration.
    -
  • A
    license
    A
    quality
    A
    maintenance
    Local RAG system for Claude Code with hybrid search (semantic + BM25), cross-encoder reranking, markdown-aware chunking, and 12 MCP tools. Zero external servers, pure ONNX in-process.
    13
    415 PyPI
    278
    MIT
  • A
    license
    A
    quality
    C
    maintenance
    Enables AI agents to interact with an embedded graph database (GrafeoDB) via the Model Context Protocol, providing tools for graph CRUD, GQL queries, full-text and vector search, and graph algorithms.
    23
    4
    Apache 2.0
  • F
    license
    A
    quality
    C
    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
    C
    maintenance
    Enables semantic search and analysis of customer support tickets. Provides tools to search tickets, analyze the dataset, and retrieve individual tickets using natural language.
    3
    MIT
  • A
    license
    A
    quality
    A
    maintenance
    Privacy-first local document search using semantic search. Runs entirely on your machine with no cloud services, supporting PDF, DOCX, TXT, and Markdown files.
    22
    9
    3,151 npm
    390
    MIT