quickwit-oss/tantivy

Create a term proximity scorer

Open

#247 建立於 2018年2月17日

在 GitHub 查看
 (7 留言) (2 反應) (0 負責人)Rust (8,354 star) (499 fork)batch import
enhancementgood first issuehelp wanted

描述

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.

貢獻者指南

技術棧
rust
領域
backend
議題類型
feature
難度面向新貢獻者的預計實作難度，1 表示很小改動，5 表示專家級工作。
3
預計時間有經驗貢獻者完成調查、實作、測試並準備 pull request 的粗略時間範圍。
half day
活動狀態議題目前的可參與程度：新鮮、活躍、陳舊、阻塞或等待維護者輸入。
stale
清晰度議題是否清楚說明預期改動、驗收標準和下一步。
mostly clear
前置要求
RustTantivy query APISearch scoring concepts
新手友善度1-100 的估計分數，表示該議題對首次貢獻者的友善程度。
20
研究方向
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.