Alternatives
Products that do what Search engine where users can adjust ranking boost factors does
Hi HN, I’m working on an Israeli search engine with a focus on deeper search across Israeli, academic, and scientific content. One feature I recently added is that users can adjust their own search boost factors. For example, they can give more or less weight to title, domain, URL, language, document type, or page content. Search remains anonymous and ad-free. I’m interested in feedback from people who care about search, indexing, crawling, privacy, and ranking transparency: Would you find this kind of user-adjustable search ranking useful? https://websearch.co.il
- 1AS
Hey all, Last time when we were on HackerNews [1], we received a lot of feedback, and we incorporated most of it. - We have changed our name from grep.help to usegrasp.com - A privacy policy page - Bulk import - Pricing page We are happy to introduce a new feature: a personalized answer search engine that provides direct citations to the content on the page. Demo: https://usegrasp.com/search?q=is+starship+fully+reusable%3F 1 - https://news.ycombinator.com/item?id=35510949
2023 · usegrasp.com
- 2WM
Hey, HN! You probably know that the ordering of products on Amazon, posts in FB, and search results in Google is personalized for each visitor, as it directly affects conversion, click rate and engagement. But not everyone can afford to hire an army of PhDs to squeeze every penny out of the ranking, and not everyone agrees on the current (im)balance between privacy and profits. So we built Metarank, an open-source and privacy-focused personalization engine. It can rerank in real-time any type of content, using only the data you allow, and optimize metrics you define. We made a lot of…
2022 · github.com
- 3IM
2021 · github.com
- 4

- 5IM
I love HN but always felt the search with algolia is okay but does have some limitations. Since I work at Vectara I decided to try and create a better search for HN. It's based on data from roughly the last 6 months of HN stories and comments. Would love to hear feedback and how useful this is relative to the existing search.
2024 · hackernews.demo.vectara.com
- 6

- 7

- 8
- 9HS
Hi HN! I'm Jonathan and I built Hacker Search (https://hackersearch.net), a semantic search engine for Hacker News. Type a keyword or a description of what you're interested in, and you'll get top links from HN surfaced to you along with brief summaries. Unlike HN's otherwise very valuable search feature, Hacker Search doesn't require you to get your keywords exactly right. That's achieved by leveraging OpenAI's latest embedding models alongside more traditional indexes extracted from the scraped and cleaned up contents of the links. I think there are many more interesting things…
2024 · hackersearch.net
- 10FS
Hi HN! This started late last year as an afternoon project to play around with ElasticSearch, and then I kept thinking of new features I wanted to add. I still have a lot of things I want to build, but now seemed like a good time to put it out there: even if the results aren’t nearly the quality I’d like, I’ve still found it useful and I want to show it off! I’ve been working on it since September 2021, but only in fits and starts. The entire thing runs on a computer in my living room (there’s a picture on the About page); I haven’t done any load testing so we’ll see how it holds up.
2022 · search.feep.dev
- 11AD
We (Nick, Dens, Denzell, Fede, Drew, Aaryan, and Daniel) have been building HN Discovery, a discovery-focused search engine for Hacker News, in our spare time for the past 6 months and are excited to show it! It adds the following features relative to the existing keyword search interface and preserves the existing ones: - no-JS version (hnnojs.trieve.ai) - site:{required_site} and site:{negated-site} filters - public analytics - LLM generated query suggestions based on random stories - recommendations - dense vector semantic search - SPLADE fulltext search - RAG AI chat - order by…
2024 · hn.trieve.ai
- 12OS
2016 · deusu.org
- 13IS
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
- 14

- 15CP
Hi HN! AI Product Rank lets you to search for topics and products, and see how OpenAI, Anthropic, and Perplexity rank them. You can also see the citations for each ranking. We’re interested in seeing how AI decides to recommend products, especially now that they are actively searching the web. Now that we can retrieve citations by API, we can learn a bit more about what sources the various models use. This is increasingly becoming important - Guillermo Rauch said that ChatGPT now refers ~5% of Vercel signups, which is up 5x over the last six months. [1] It’s been fascinating to see the…
2025 · productrank.ai
- 16IM
Hi HN, I am Jiayuan, and I'm here to introduce a tool we've been building over the past few months: Devv (https://devv.ai). In simple terms, it is an AI-powered search engine specifically designed for developers. Now, you might ask, with so many AI search engines already available—Perplexity, You.com, Phind, and several open-source projects—why do we need another one? We all know that Generative Search Engines are built on RAG (Retrieval-Augmented Generation)[1] combined with Large Language Models (LLMs). Most of the products mentioned above use indexes from general search engines…
2024 · devv.ai
- 17

- 18

- 19AS
2013 · insightdatascience.com
- 20HH
TLDR: Build a quick HN profile to see how little context LLMs need to personalise your feed. Rate 30 posts once, get a permanent ranked homepage you can return to. Our goal was to build a tool that allowed us to test a range of "personal contexts" on a very focused everyday use case for us, reading HN! We are exploring use of personal context with LLMs, specifically what kind of data, how much, and with how much additional effort on the user’s part was needed to get decent results. The test tool was a bit of fun on its own so we re-skinned it and decided to post it here. First time posting…
2025 · hackernews.coffee
- 21

- 22WS
We built a search engine interface on top of OpenAI GPT 3.5 and Microsoft Bing that summarizes and cites top search results in response to natural language questions. By using search results, the AI is able to reference recent news and provide citations for specific facts. Our interface offers concise answers, without having to click through links, scroll past irrelevant content, or read ads. No login is required; no personal data is collected. We believe in the power of combining the intuitive UI of web search with the intelligence of large language models. The search engine does indexing…
2022 · perplexity.ai
- 23IM
AI search results are quickly becoming more important than SEO, but as businesses, we have no visibility over it! That's why I'm building "Ahrefs for AI search results". Track keyword performance on AI tools like ChatGPT, Claude, Perplexity & more
2025 · linrush.com
- 24AP
Hi HN, I've been a daily user here for almost 15 years. Over that time, my interests have shifted. I find I'm now more interested in deep-dive technical posts and personal blogs than the big tech announcements that often dominate the front page. The "top" feed was starting to feel stale, and I was spending more time digging through "new". So, I decided to build what I wanted: a personalized "For You" feed. Link: https://hn.shaped.ai It's a simple concept: you log in with your normal HN credentials, and as you favorite stories, it learns what you're interested in and re-ranks the…
Sep 2025 · hn.shaped.ai
Ranked by how close each launch is in meaning, then by votes. Refine with a description →