"How to use Google Search effectively" matching MCP servers:

An MCP server that edits files through a real Neovim instance, giving agents access to LSP diagnostics, formatting, code actions, and plugin commands.

Enables Claude to use Google Gemini as a secondary AI through MCP for large-scale codebase analysis and complex reasoning tasks. Supports both Gemini Flash and Pro models with specialized functions for general queries and comprehensive code analysis.

A runtime-free MCP server that converts source code into AST🌲, regardless of language.

Enables semantic code search across indexed code folders using vector embeddings, with support for multiple embedding providers and automatic file watching. Provides an admin UI and integrates with MCP clients for natural language code queries.

Semantic + lexical code search as an MCP server. Agents query in natural language and get back ranked file:line ranges to read precisely.

Turns GitHub repository history into a cited maintainer skill for coding agents, providing tools to collect evidence, query the knowledge graph, and inspect bundles.

Enables blazingly fast file and content searching in large codebases using ripgrep, with intelligent filtering, fuzzy finding, and directory tree visualization while respecting .gitignore and avoiding common bloat directories.

Enables AI agents to perform semantic code search across entire codebases using natural language queries. Provides fast indexing and ranked search results with line numbers and file paths through the Seroost search engine.

Clones a Git repo into a temp directory so MCP clients can search and read files from another repo for context.

Enables AI coding assistants to semantically search codebases by meaning rather than exact text, with zero external daemons and fully local embeddings. Works out-of-the-box with Claude Code, Gemini CLI, Antigravity, and Cursor.

High-performance code understanding toolkit that enables batch reading of multiple files with dependency context, structural outline extraction with Java annotation awareness, and precise location of classes/methods across large codebases.

Enables AI coding agents to perform fast regex/text and structural AST searches across codebases, find symbols, list files, and safely preview or apply refactors. It unifies ripgrep and ast-grep with pagination, gitignore-aware defaults, and fallback engines for zero-setup code search.

Provides semantic code search over codebases using local embeddings with natural language queries. Supports hybrid search, file watching, and respects .gitignore.

Semantic code search for Claude Code, enabling natural language codebase indexing and search using AI embeddings.

Enables intelligent code analysis and search across repositories using the CodeRank algorithm (inspired by PageRank) to identify critical modules, trace dependencies, find code hotspots, and perform context-aware keyword searches with importance-ranked results.

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.

Enables AI coding agents to perform semantic code search locally, finding code by meaning rather than exact keywords.

Enables token-bounded, read-only hybrid code search across local repositories by fusing literal matches with AST symbol relations to return high-signal snippets, line ranges, and call metadata.

Enables cross-repository code search over a local mirror of a self-hosted Gitea or Forgejo instance, covering file contents, file paths, and commit messages across all repositories and branches. It also lets users read a single file from the mirror and list mirrored repositories, all without network access during search or read.

Enables LLMs to perform high-performance code search and analysis across multiple languages using symbol indexing, regex text search, and structural AST pattern matching. It also provides tools for technology stack detection and dependency analysis with persistent caching for optimized performance.