Search Oryxen

Search tools, jump to categories, and open key destinations

Recorded alternatives

Alternatives to webcrawl-mcp

Every candidate below sits in AI. What ends up on this page is decided entirely by a recorded score — not by bidding, not by editor taste. Review both records, check current vendor terms, then decide.

#1 AIUnknown

ai-first-scraper-mcp — alternative #1 to webcrawl-mcp

🐍 🏠 ☁️ 🍎 🪟 🐧 - Three MCP tools for ad-free Markdown web scraping and search. fetch_page (URL → clean Markdown), fetch_pages_batch (up to 25...

GitHub source
#2 AIUnknown

keenable-mcp — alternative #2 to webcrawl-mcp

🎖️ 📇 ☁️ - Live web search and clean-markdown page fetch over the Keenable web index. Two tools: search_web_pages, fetch_page_content. Keyles...

GitHub source
#3 AIFree

mcp — alternative #3 to webcrawl-mcp

us/crw 🎖️ 🦀 🏠 ☁️ 🍎 🪟 🐧 - fastCRW — open-source (AGPL-3.0), self-hostable Rust web crawler & search API for AI agents. Tools: scrape, crawl,...

Catalogue source
#4 AIUnknown

reddit-research-mcp — alternative #4 to webcrawl-mcp

🐍 ☁️ - AI-powered Reddit intelligence for market research and competitive analysis. Discover subreddits via semantic search across 20k+ inde...

GitHub source
#5 AIFree

TinySearch — alternative #5 to webcrawl-mcp

🐍 🏠 - Self-hosted web research for MCP agents: search (SearXNG, with DuckDuckGo fallback), crawl, dense+BM25 rerank, and dedupe into a sourc...

GitHub source
#6 AIFree

wigolo — alternative #6 to webcrawl-mcp

📇 🏠 - Local-first, keyless web intelligence in one server: search, fetch, crawl, extract, cache, find-similar, and research. Multi-engine se...

GitHub source
#7 AIUnknown

local-faiss-mcp — alternative #7 to webcrawl-mcp

🐍 🏠 🍎 🐧 - Local FAISS vector database for RAG with document ingestion (PDF/TXT/MD/DOCX), semantic search, re-ranking, and CLI tools for inde...

GitHub source
#8 AIFree

URL-to-PNG — alternative #8 to webcrawl-mcp

URL to PNG utility featuring parallel rendering using Playwright for screenshots and with storage caching via Local, S3, or CouchDB. MIT Nod...

GitHub source

Questions about this page

How were these alternatives selected?

Each candidate is a live catalogue record in the same primary category, picked by a deterministic score that Oryxen records in its catalogue: how many meaningful words the two listings share, whether their pricing classes oppose (a paid product against a free one), whether both are open source, and whether either record is featured. The same catalogue state always produces the same list — no randomness, no manual ranking.

Are these alternatives ranked by payment?

No. Rows are ordered only by the recorded score, highest first, with alphabetical ties — payment never influences the order, nothing here is paid placement, and Oryxen charges no listing or placement fee.

Always verify current terms with webcrawl-mcp directly — Oryxen records pricing classes, not live quotes.