Search Oryxen

Search tools, jump to categories, and open key destinations

Recorded alternatives

Alternatives to akb

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

gingugu — alternative #1 to akb

🐍 🏠 🍎 🪟 🐧 - Persistent memory for AI coding assistants. Local SQLite, no cloud. 16 MCP tools: store, recall, search, relate, consolidate, ex...

GitHub source
#2 AIUnknown

enquire-mcp — alternative #2 to akb

📇 🏠 🍎 🪟 🐧 - Long-term memory for AI agents (Claude Code/Desktop, Cursor, ChatGPT, Codex, OpenClaw) backed by a local Obsidian markdown vault...

GitHub source
#3 AIUnknown

LynxMCP — alternative #3 to akb

🐍 🏠 🍎 🪟 🐧 - 100% local semantic code search for AI agents: AST-aware chunking (tree-sitter), hybrid BM25+dense retrieval, and a code knowled...

GitHub source
#4 AIUnknown

mdshare — alternative #4 to akb

📇 ☁️ - Markdown collaboration for AI workflows. Share markdown instantly via public links with four permission levels (admin, edit, comment,...

GitHub source
#5 AIUnknown

alcove — alternative #5 to akb

🦀 🏠 🍎 🪟 🐧 - MCP server that gives AI coding agents on-demand access to private project docs via BM25 ranked search. One setup for Claude Cod...

GitHub source
#6 AIUnknown

knowledge-rag — alternative #6 to akb

🐍 🏠 🍎 🪟 🐧 - Local RAG system for Claude Code with hybrid search (BM25 + semantic), cross-encoder reranking, markdown-aware chunking, query e...

GitHub source
#7 AIUnknown

knowmind — alternative #7 to akb

📇 ☁️ - AI agent memory and knowledge graph, hosted in Germany (GDPR-compliant). Hybrid recall (BM25 + vector + Neo4j graph hops with cross-e...

GitHub source
#8 AIUnknown

octocode — alternative #8 to akb

[octocode] - Semantic code indexer with GraphRAG knowledge graph and MCP server. Tree-sitter AST parsing, ast-grep structural search, LanceD...

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 akb directly — Oryxen records pricing classes, not live quotes.