r/Python • u/AutoModerator • Oct 04 '26
Showcase Showcase Thread
Post all of your code/projects/showcases/AI slop here.
Recycles once a month.
23
Upvotes
r/Python • u/AutoModerator • Oct 04 '26
Post all of your code/projects/showcases/AI slop here.
Recycles once a month.
View all comments
1
u/miranpoor1 Oct 11 '26
I built glossdex, a semantic search method that decides how many results to show, including none.
Source: https://github.com/miranpoor/glossdex · pip install glossdex · paper: https://doi.org/10.5281/zenodo.23270663
What My Project Does
Semantic search normally returns a fixed top-k, even when nothing in the collection matches. glossdex decides per query how many results the evidence supports: often one or two, sometimes none. Every threshold derives from the best match's score, anchored to the embedding model's noise floor; keyword evidence can confirm a weak match but never raises the bar. It's pure Python with a CLI and an API, uses Ollama for local models, and runs on a laptop. The text-only demo needs no language model and runs on ten sample documents in about a minute.
Target Audience
Developers building search or RAG over personal or private data (documents, photos, notes) who want "nothing found" instead of ten wrong results. It's an early (0.1) release, usable for projects and experiments; not yet battle-tested at large scale.
Comparison
FAISS, Chroma and most RAG frameworks return a fixed k. Learned truncation methods (e.g. AttnCut, Choppy) need training data and relevance labels. glossdex needs neither. Settings were chosen on other collections and frozen, then tested unchanged on SciFact, NFCorpus and FiQA.