Skip to main content
Glama
82,818 servers. Updated

Matching MCP tools:

Matching MCP Connectors:

"Using Perplexity for Internet Data Retrieval" matching MCP servers:

GET /v1/servers — MCP directory API reference
  • A
    license
    Not graded
    quality
    D
    maintenance
    Enables local LLMs to search the web, scrape pages, and extract structured data (tables, metadata) from sources like Wikipedia and IMDb, with caching and rate limiting.
    MIT
  • F
    license
    Not graded
    quality
    D
    maintenance
    Enables AI applications to access and contextualize organizational knowledge sources including GitHub repositories and internal documentation through standardized MCP protocol integration. Features OAuth 2.1 authentication, vector-based semantic search, and optimized context chunking for enterprise development workflows.
    -
  • A
    license
    A
    quality
    D
    maintenance
    Enables AI assistants to perform web searches and retrieve real-time information using Perplexity AI's Sonar models, with support for multiple search modes and easy integration with MCP clients.
    5
    1
    MIT
  • A
    license
    A
    quality
    D
    maintenance
    Enables AI assistants to perform web searches and deep research via Perplexity, without API costs, using session-based authentication and multi-account pooling.
    2
    13
    MIT
  • A
    license
    A
    quality
    F
    maintenance
    Enables AI-powered web research using your existing Perplexity Pro subscription, providing tools for search, follow-up conversations, and thread management through the Model Context Protocol.
    4
    20
    MIT
  • A
    license
    B
    quality
    C
    maintenance
    The MCP Internet Speed Test is a specialized Model Context Protocol (MCP) server that enables AI models and agents to perform internet speed measurements.
    6
    14
    Python
    MIT
  • A
    license
    B
    quality
    D
    maintenance
    Enables web search using Perplexity AI's API, allowing users to search the web with optional recency filters and integration with Claude, Cursor, and other MCP clients.
    1
    MIT
  • A
    license
    B
    quality
    D
    maintenance
    Enables retrieval-augmented generation by embedding queries with a chosen provider (e.g., OpenAI) and searching supported vector stores (Pinecone, pgvector) to return relevant content.
    1
    Apache 2.0
  • A
    license
    Not graded
    quality
    B
    maintenance
    A Type 3 DAuth MCP server for Perplexity AI API that provides web search, chat, embeddings, and content moderation using Perplexity's search-focused AI models.
    MIT
  • A
    license
    Not graded
    quality
    D
    maintenance
    Provides a Python-based interface to the Perplexity API for querying responses, maintaining chat history, and managing conversations. It enables models to ask questions, continue conversations, and list chats through Perplexity AI.
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    An evaluation harness that probes MCP-based retrieval servers for calibration, relevance, coverage, citation integrity, and more, also exposing the probes as MCP tools for assistants and CI agents.
    MIT
  • A
    license
    Not graded
    quality
    D
    maintenance
    Exposes Perplexity AI's search capabilities to Claude, enabling real-time web search and information retrieval within the assistant. The project is currently in active development with plans to support Perplexity Spaces and multi-source data synthesis.
    Apache 2.0
  • A
    license
    A
    quality
    C
    maintenance
    An advanced integration package that leverages OpenRouter and Perplexity APIs to provide enhanced web search capabilities, offering both simple and complex query processing with file attachment support.
    1
    49
    MIT
  • A
    license
    A
    quality
    D
    maintenance
    Advanced MCP server that uses OpenRouter and Perplexity APIs for enhanced query processing with multi-vendor support, query type optimization, file attachments, and robust retry logic.
    1
    MIT