#1 AI CodingUnknown
acheron-mcp-server — alternative #1 to fable
📇 🏠 - Cross-surface persistent memory for Claude. Bridges context between Claude Chat, Code, and Cowork via local SQLite with full-text sear...
GitHub source
Recorded alternatives
Alternatives to fable
Every candidate below sits in AI Coding. 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.
#2 AI CodingUnknown
terminal-history-mcp — alternative #2 to fable
📇 🏠 🍎 🐧 - Full-text search over your shell history (zsh / bash / fish) via SQLite FTS5. Local-only. 11-pattern secret redaction runs BEFORE...
GitHub source
#3 AI CodingUnknown
longhand — alternative #3 to fable
🐍 🏠 🍎 🪟 🐧 - Persistent local memory for Claude Code. Indexes every session JSONL verbatim into SQLite + ChromaDB for semantic recall (~126ms...
GitHub source
#4 AI CodingUnknown
backscroll — alternative #4 to fable
🏎️ 🏠 🍎 🐧 - Answers "what did that command print?" from your real terminal history: a per-command PTY session recorder (OSC 133) stores every...
GitHub source
#5 AI CodingUnknown
cupertino — alternative #5 to fable
🏠 🍎 - Apple Documentation MCP Server. Search Apple developer docs, Swift Evolution proposals, and 600+ sample code projects with full-text s...
GitHub source
#6 AI CodingFree
obsidian-mcp — alternative #6 to fable
🐍 🏠 🍎 🪟 🐧 - Self-hosted MCP server for Obsidian with semantic + full-text search over PostgreSQL/pgvector, wikilink graph traversal, atomic...
GitHub source
#7 AI CodingUnknown
resume-mcp-server — alternative #7 to fable
🐍 🏠 🪟 🐧 - MCP server for searching and retrieving structured information from local resume and job application documents (.docx, .pdf, .md,...
GitHub source
#8 AI CodingFree
patents-mcp — alternative #8 to fable
🏎️ ☁️ 🍎 🪟 🐧 - MCP server for patent search and prior art discovery powered by Google Patents public dataset on BigQuery. Tools: search paten...
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 fable directly — Oryxen records pricing classes, not live quotes.