quickwit-oss/tantivy

Create a term proximity scorer

Open

#247 opened on Feb 17, 2018

View on GitHub
 (7 comments) (2 reactions) (0 assignees)Rust (8,354 stars) (499 forks)batch import
enhancementgood first issuehelp wanted

Description

Michael Jackson should get a better score if the two terms appear close to each other in the same document.

It would be nice to have a query that computes something equivalent to

"Michael Jackson"^3 OR (Michael AND jackson)

Conceptually it would just look like the phrasequery, except that the part that checks whether the phrase is present would only affect the score of the document.

Contributor guide

Tech stack
rust
Domain
backend
Issue type
feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
3
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
half day
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
stale
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
mostly clear
Prerequisites
RustTantivy query APISearch scoring concepts
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
20
Research direction
Examine the existing PhraseQuery implementation to understand scoring. Look at 'src/query/phrase query.rs' and related files. Then design a new query type that computes a proximity score. Review the issue comments for additional context and potential design constraints.