You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: docs/reference/reranking/index.asciidoc
+7-7Lines changed: 7 additions & 7 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -1,12 +1,12 @@
1
1
[[re-ranking-overview]]
2
2
= Re-ranking
3
3
4
-
Many search systems are built on two-stage retrieval pipelines.
4
+
Many search systems are built on multi-stage retrieval pipelines.
5
5
6
-
The first stage uses cheap, fast algorithms to find a broad set of possible matches.
6
+
Earlier stages use cheap, fast algorithms to find a broad set of possible matches.
7
7
8
-
The second stage uses a more powerful model, often machine learning-based, to reorder the documents.
9
-
This second step is called re-ranking.
8
+
Later stages use more powerful models, often machine learning-based, to reorder the documents.
9
+
This step is called re-ranking.
10
10
Because the resource-intensive model is only applied to the smaller set of pre-filtered results, this approach returns more relevant results while still optimizing for search performance and computational costs.
11
11
12
12
{es} supports various ranking and re-ranking techniques to optimize search relevance and performance.
@@ -18,7 +18,7 @@ Because the resource-intensive model is only applied to the smaller set of pre-f
18
18
19
19
[float]
20
20
[[re-ranking-first-stage-pipeline]]
21
-
=== First stage: initial retrieval
21
+
=== Initial retrieval
22
22
23
23
[float]
24
24
[[re-ranking-ranking-overview-bm25]]
@@ -45,7 +45,7 @@ Hybrid search techniques combine results from full-text and vector search pipeli
45
45
46
46
[float]
47
47
[[re-ranking-overview-second-stage]]
48
-
=== Second stage: Re-ranking
48
+
=== Re-ranking
49
49
50
50
When using the following advanced re-ranking pipelines, first-stage retrieval mechanisms effectively generate a set of candidates.
51
51
These candidates are funneled into the re-ranker to perform more computationally expensive re-ranking tasks.
@@ -67,4 +67,4 @@ Learning To Rank involves training a machine learning model to build a ranking f
67
67
LTR is best suited for when you have ample training data and need highly customized relevance tuning.
0 commit comments