account-research
Research a company or person and get actionable sales intel. Works standalone with web search, supercharged when you connect enrichment tools or your CRM.…
\"Implement BM25 ranking function for e-commerce product search relevance scoring. Use this skill when the user needs to build a text-based product search engine, improve search result relevance, or replace basic TF-IDF with a more robust ranking function — even if they say
$ npx -y skills add charlieviettq/awesome-agent-skill --skill algo-ecom-bm25 --agent claude-codeHow it fires
How this skill gets triggered: by you, by Claude, or both.
/algo-ecom-bm25Context preview
The summary Claude sees to decide when to auto-load this skill.
\"Implement BM25 ranking function for e-commerce product search relevance scoring. Use this skill when the user needs to build a text-based product search engine, improve search result relevance, or replace basic TF-IDF with a more robust ranking function — even if they say
name: "\"algo-ecom-bm25\"" description: "\"Implement BM25 ranking function for e-commerce product search relevance scoring. Use this skill when the user needs to build a text-based product search engine, improve search result relevance, or replace basic TF-IDF with a more robust ranking function — even if they say 'product search ranking', 'search relevance', or 'BM25 implementation'.\"." allowed-tools: Bash, Read, Write, Edit, Glob, Grep
BM25 (Best Matching 25) is an improved TF-IDF ranking function that adds term frequency saturation and document length normalization. Score = Σ IDF(t) × (TF(t,d) × (k₁+1)) / (TF(t,d) + k₁ × (1 - b + b × |d|/avgdl)). Standard parameters: k₁=1.2, b=0.75. The backbone of most text search engines (Elasticsearch, Solr).
**Trigger conditions:**
**When NOT to use:**
IRON LAW: BM25 Has Two Critical Parameters — k₁ and b k₁ controls term frequency saturation: higher k₁ = more weight to repeated terms. k₁=0 ignores TF entirely (boolean). b controls document length normalization: b=1 fully normalizes by length, b=0 ignores length. Default k₁=1.2, b=0.75 works for most cases but MUST be tuned for your specific corpus.
Tokenize each document to lowercase word tokens. **Remove stop words** before counting — the bundled script drops a standard English stop list (`the, a, an, and, or, but, of, in, on, at, to, for, with, by, from, as, is, are, was, were, be, been, being`). Then build an inverted index: term → list of (document, term frequency). Compute: document lengths (post stop-word removal), average document length, document frequency per term.
> ⚠️ **Stop-word removal affects `|d|` and `avgdl`**: because stop words are > dropped before length is measured, hand-computing BM25 without removing them > will give the wrong length normalization and scores will be off by 3–5%. > If you're reproducing BM25 by hand to compare against the script, apply the > same stop list first — or just run the script.
**Gate:** Index built, statistics computed, corpus non-empty.
For query Q with terms t₁...tₙ against document d: 1. For each query term tᵢ: compute IDF(tᵢ) = log((N - DF(tᵢ) + 0.5) / (DF(tᵢ) + 0.5) + 1) 2. Compute TF component: (TF(tᵢ,d) × (k₁+1)) / (TF(tᵢ,d) + k₁ × (1 - b + b × |d|/avgdl)) 3. Score(d, Q) = Σᵢ IDF(tᵢ) × TF_component(tᵢ, d) 4. Rank documents by score descending
> ⚠️ **IDF variant lock-in**: BM25 has several IDF formulations in the wild > (Robertson-Sparck Jones, classic Okapi, Lucene's smoothed `+1`, BM25+, BM25L). > This skill — and the bundled script — uses the **Lucene-style smoothed variant** > shown above (`log((N - df + 0.5) / (df + 0.5) + 1)`), which never returns negative > IDF for very common terms. If you compare scores against another engine > (Elasticsearch, Solr, Whoosh), they may differ by ~3–5% even on identical inputs. > Do not "correct" the script unless you intend to change the variant globally.
Spot-check: query "red shoes" should rank documents containing both "red" and "shoes" higher than documents with only one term. Shorter product titles with both terms should rank above long descriptions with sparse mentions. **Gate:** Relevance spot-check passes on 10+ test queries.
Return ranked results with scores.
{
"results": [{"doc_id": "SKU-123", "score": 12.5, "title": "Red Running Shoes"}],
"metadata": {"query": "red shoes", "hits": 85, "k1": 1.2, "b": 0.75, "avg_doc_length": 45}
}**Input:** Query "wireless earbuds", corpus of 1000 product listings **Expected:** Products with "wireless earbuds" in title rank highest; "wireless headphones" ranks lower (no "earbuds" term).
| Input | Expected | Why | |-------|----------|-----| | Single-word query | IDF-dominated ranking | Only one term's IDF differentiates | | Very common term ("the") | Near-zero IDF, low impact | IDF suppresses common terms | | Document with 100 repetitions | Saturated TF, not 100x score | k₁ caps the benefit of repetition |
| Script | Description | Usage | |--------|-------------|-------| | `scripts/bm25.py` | Score documents against a query using BM25 ranking function | `python scripts/bm25.py --help` |
Run `python scripts/bm25.py --verify` to execute built-in sanity tests.
Curated skill pack for LLM agents in engineer and science workflow (Cursor & Claude ready).
Research a company or person and get actionable sales intel. Works standalone with web search, supercharged when you connect enrichment tools or your CRM.…
Evaluate LLM agents and tool-using workflows—task success, tool accuracy, latency/cost, safety, and regression suites. Use when shipping agent features,…
Design agent tools and CLI surfaces—schemas, naming, errors, idempotency, and discoverability for LLM callers. Use when defining tools for agents, SDKs, or…
\"Implement and select ad bidding strategies from manual CPC to automated target-CPA and target-ROAS. Use this skill when the user needs to choose a bidding…
\"Optimize advertising budget allocation across campaigns using marginal returns analysis. Use this skill when the user needs to distribute budget across…
\"Build CTR prediction models for estimating ad click-through rates from features. Use this skill when the user needs to predict click probability, build an ad…