Dev tools · alternatives · 2026
24 alternatives to Ranked Search for Semi-Structured Data
We’ve been working on a search problem that requires querying both text and numbers simultaneously. For example, in a dataset of clothing items with descriptions and prices, a search for “slim pants for $20” should prioritize skinny jeans for $25 over slim pants for $50 because they are semantically similar and the price is closer. I’ve found that standard embedding models struggle with numerical ordering, while text-to-SQL methods rely on exact matches and often filter out too many results. To solve this, we built a system designed specifically for structured datasets like CSVs or tables.…
Ranked Search for Semi-Structured Data is a search tool designed for querying datasets like CSVs and tables that contain both text and numerical values. It addresses limitations in standard embedding models and… Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes.
- 1IM
As a grad student (and an ADHDer), I had trouble doing literature review systematically. To combat this, I made a website that finds similar papers using the meaning of the thing I am looking for. I used MixedBread's [^1] embedding model to generate vectors from the abstracts. I store and search similar vectors using Milvus [^2] and finally use Gradio [^3] to serve the frontend. I update the vector database weekly by pulling the metadata dataset from Kaggle [^4]. To speed up the search process on my free oracle instance, I binarise the embeddings and use Hamming distance as a metric. I would…
2024 · papermatch.mitanshu.tech · its alternatives →
- 2
End-to-end deep dive of the project, spanning a large GPU cluster, distributed RocksDB, and terabytes of sharded HNSW.
2025 · blog.wilsonl.in · its alternatives →
- 3
Last summer we faced a conundrum at my company, Tiger Data, a Postgres cloud vendor whose main business is in timeseries data. We were trying to grow our business towards emerging AI-centric workloads and wanted to provide a state-of-the-art hybrid search stack in Postgres. We'd already built pgvectorscale in house with the goal of scaling semantic search beyond pgvector's main memory limitations. We just needed a scalable ranked keyword search solution too. The problem: core Postgres doesn't provide this; the leading Postgres BM25 extension, ParadeDB, is guarded behind AGPL; developing our…
Mar 2026 · github.com · its alternatives →
- 4
Hey there HN! We’re Antonio, Luca, and Yuhang, and we’re excited to introduce Fast GraphRAG, an open-source RAG approach that leverages knowledge graphs and the 25 years old PageRank for better information retrieval and reasoning. Building a good RAG pipeline these days takes a lot of manual optimizations. Most engineers intuitively start from naive RAG: throw everything in a vector database and hope that semantic search is powerful enough. This can work for use cases where accuracy isn’t too important and hallucinations are tolerable, but it doesn’t work for more difficult queries that…
2024 · github.com · its alternatives →
- 5WS
We’ve trained a generative AI model to browse the web and answer questions/retrieve code snippets directly. Unlike ChatGPT, it has access to primary sources and is able to cite them when you hover over an answer (click on the text to go to the source being cited). We also show regular Bing results side-by-side with our AI answer. The model is an 11-billion parameter T5-derivative that has been fine-tuned on feedback given on hundreds of thousands of searches done (anonymously) on our platform. Giving the model web access lessens its burden to need to store a snapshot of human knowledge…
2022 · beta.sayhello.so · its alternatives →
- 6
Hello HN, I'm Ghita, co-founder of ZeroEntropy (YC W25). We build high accuracy search infrastructure for RAG and AI Agents. We just released two new state-of-the-art rerankers zerank-1, and zerank-1-small. One of them is fully open-source under Apache 2.0. We trained those models using a novel Elo score inspired pipeline which we describe in detail in the blog attached. In a nutshell, here is an outline of the training steps: * Collect soft preferences between pairs of documents using an ensemble of LLMs. * Fit an ELO-style rating system (Bradley-Terry) to turn pairwise comparisons into…
2025 · zeroentropy.dev · its alternatives →
- 7
Not all improvements come from adding complexity — sometimes it's about removing it. PageIndex takes a different approach to RAG. Instead of relying on vector databases or artificial chunking, it builds a hierarchical tree structure from documents and uses reasoning-based tree search to locate the most relevant sections. This mirrors how humans approach reading: navigating through sections and context rather than matching embeddings. As a result, the retrieval feels transparent, structured, and explainable. It moves RAG away from approximate "semantic vibes" and toward explicit reasoning…
2025 · github.com · its alternatives →
- 8
- 9
I've been playing with embeddings and wanted to try out what results the embedding layer will produce based on just word-by-word input and addition / subtraction, beyond what many videos / papers mention (like the obvious king-man+woman=queen). So I built something that doesn't just give the first answer, but ranks the matches based on distance / cosine symmetry. I polished it a bit so that others can try it out, too. For now, I only have nouns (and some proper nouns) in the dataset, and pick the most common interpretation among the homographs. Also, it's case sensitive.
2025 · calc.datova.ai · its alternatives →
- 10SA
Hi HN, I’m Tullie, founder of Shaped. Previously, I was a researcher at Meta AI, worked on ranking for Instagram Reels, and was a contributor to PyTorch Lightning. We built ShapedQL because we noticed that while retrieval (finding 1,000 items) has been commoditized by vector DBs, ranking (finding the best 10 items) is still an infrastructure problem. To build a decent for you feed or a RAG system with long-term memory, you usually have to put together a vector DB (Pinecone/Milvus), a feature store (Redis), an inference service, and thousands of lines of Python to handle business logic…
Jan 2026 · playground.shaped.ai · its alternatives →
- 11SP
Step into the future with Searchbase Cloud's AI-enhanced search capabilities. Effortless to integrate, intuitive to use, and built for insightful discoveries. Transform your data into action with the smartest search on the market. Join the revolution.
2024 · searchbase.dev · its alternatives →
- 12
TLDR: I’ve made a transformer model and a wrapper library that segments text into meaningful semantic chunks. The current text splitting approaches rely on heuristics (although one can use neural embedder to group semantically related sentences). I propose a fully neural approach to semantic chunking. I took the base distilbert model and trained it on a bookcorpus to split concatenated text paragraphs into original paragraphs. Basically it’s a token classification task. Model fine-tuning took day and a half on a 2x1080ti. The library could be used as a text splitter module in a RAG system or…
2025 · github.com · its alternatives →
- 13AL
Hi HN! I am Maria, solo founder of DataQA (https://dataqa.ai/), a tool to search and label documents for various NLP tasks (e.g. entity extraction, entity linking, etc). I have worked as a data scientist and ML engineer for the better part of a decade, and over that time have specialised mainly in applications involving natural language processing (NLP). One of the key questions I have always had at the back of my mind is whether my time was well spent. Whenever I spent more time on feature engineering or trying different models, I always wondered whether I would get better…
2021 · its alternatives →
- 14
I've built an advanced RAG (Retrieval-Augmented Generation) pipeline from scratch to demystify the complex mechanics of modern LLM-powered Question Answering systems. This repository features: -- An implementation of a sub-question query engine from scratch to answer complex user questions. -- Illustrative explanations that unveil the inner workings of the system. -- An analysis of the challenges I faced while working with the system, like prompt engineering and cost estimation. -- Qualitative comparison with similar frameworks like LlamaIndex, offering a broader perspective. Key Takeaway:…
2023 · github.com · its alternatives →
- 15
We’ve recently open-sourced Model2vec, a method to distill sentence transformers into static embeddings that outperform all previous approaches by a large margin on MTEB. Our new models set a new state-of-the-art for static embeddings. Main features: - Our best model (potion-base-8M) has only 8M parameters, which is ~30mb on disk - Inference is ~500x faster than the distilled base model (bge-base), on a CPU - New models can be distilled in 30 seconds on a CPU without requiring a dataset - just a vocabulary - Numpy-only inference: The packaged can be install the package with minimal…
2024 · github.com · its alternatives →
- 16
Two weeks ago I was on my babymoon in Corfu, Greece. While in transit, I was overseeing a GSoC intern submit an important feature to my array database library, Xarray-SQL. He added `to_dataset()`, which completed the roundtrip between thinking of array data in a tabular model simultaneously as gridded rasters (the premise of the project is that every Nd array can be mapped to 2d, where orthogonal dims of the Nd array are just primary keys of a tabular representation). We discussed in chat, now that this feature existed, what demos could we make that would prove this data model works? With…
Jul 2026 · github.com · its alternatives →
- 17
Hi HN, I'm Daniel from Superlinked! We have built an open-source framework that improves vector search relevance and usefulness by combining structured metadata with unstructured data in your embeddings. We included self-hostable API server that sits between your data sources and vector database. Docs: https://docs.superlinked.com/ We're launching our cloud offering soon where you can use Superlinked to orchestrate high-performance retrieval for RAG, Search & Recommendation apps in your own cloud. Looking for feedback and happy to answer questions!
2024 · github.com · its alternatives →
- 18
- 19
Hey HN! We're Phil and Ming, co-founders of Retake (https://github.com/getretake/retake). Retake is an open source tool that adds keyword and semantic (i.e hybrid) search to databases. We’ve started by extending the capabilities of Postgres with an SDK for lightning-fast queries. We built Retake to fix two issues: keeping vectors in sync with Postgres in real time is difficult, and most vector databases aren’t built for hybrid search. A quick refresher: “keyword search” refers to a technique where results are scored based on the appearance of exact words or terms.…
2023 · github.com · its alternatives →
- 20
This is a personal experiment that uses LLMs to rank unstructured job posting data based on user-defined criteria. Traditional job search platforms rely on rigid filtering systems, but many users lack such concrete criteria. One of the superpowers of LLMs is understanding unstructured data, like the job postings in the monthly "Ask HN: who's hiring" threads. So I built a little tool that lets you define your preferences in a more natural way and then rates each job postings based on the relevance. You can define what you're looking for in simple terms and get a custom list ranked by…
2023 · github.com · its alternatives →
- 21AV
Hi HN! It’s always bothered me that there’s no real equivalent of SQL WHERE for vector content. Filtering is one of the cornerstones of a modern database — but vector DBs only support either top-k sort, which is only useful for fuzzy search, or metadata filtering, which isn’t semantic. I’ve found myself wanting all the results matching my semantic query, not just k! Aside from data analysis, it's relevant if you’re trying to do any LLM reasoning: you don’t make good decisions or reach good conclusions by considering a small subset of information. So, we’ve designed a filtering primitive on…
2023 · reviews.emberml.com · its alternatives →
- 22PV
Search a 100,000-article ParqDB index directly in the browser with MiniLM, HTTP Range, Parquet, and WebAssembly.
Aug 2026 · search.parqdb.io · its alternatives →
- 23
When building workflows that rely on LLMs, we commonly use structured output for programmatic use cases like converting an invoice into rows or meeting transcripts into tickets or even complex PDFs into database entries. The model may return the schema you want, but with hallucinated values like `invoice_date` being off by 2 months or the transcript array ordered wrongly. The JSON is valid, but the values are not. Structured output today is a big part of using LLMs, especially when building deterministic workflows. Current structured output benchmarks (e.g., JSONSchemaBench) only validate…
Apr 2026 · interfaze.ai · its alternatives →
- 24
We built PageIndex, a document indexing system that turns documents into hierarchical search trees to support reasoning-based RAG. Traditional vector-based RAG often struggles with retrieval accuracy because it optimizes for similarity, not relevance. But what we really need in retrieval is relevance — which requires reasoning. When working with professional documents that demand domain expertise and multi-step reasoning, vector-based RAG and similarity search often fall short. So we started exploring a more reasoning-driven approach to RAG. Reasoning-based RAG enables LLMs to think and…
2025 · github.com · its alternatives →
Also compare
- I made a website to semantically search ArXiv papers alternatives
- Building a web search engine from scratch with 3B neural embeddings alternatives
- Postgres extension for BM25 relevance-ranked full-text search alternatives
- FastGraphRAG – Better RAG using good old PageRank alternatives
- Web search using a ChatGPT-like model that can cite its sources alternatives
- Improving search ranking with chess Elo scores alternatives
Ranked by how close each launch is in meaning, then by votes. Prices were read from each product’s own site when checked and can change. Refine with your own description →