Skip to content

Commit 21fe01a

Browse files
authored
[DOCS] Update re-ranking intro to remove confusion about stages (#114302) (#114308)
(cherry picked from commit 10f6f25)
1 parent 2e06fc9 commit 21fe01a

File tree

1 file changed

+7
-7
lines changed

1 file changed

+7
-7
lines changed

docs/reference/reranking/index.asciidoc

Lines changed: 7 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -1,12 +1,12 @@
11
[[re-ranking-overview]]
22
= Re-ranking
33

4-
Many search systems are built on two-stage retrieval pipelines.
4+
Many search systems are built on multi-stage retrieval pipelines.
55

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.
77

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.
1010
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.
1111

1212
{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
1818

1919
[float]
2020
[[re-ranking-first-stage-pipeline]]
21-
=== First stage: initial retrieval
21+
=== Initial retrieval
2222

2323
[float]
2424
[[re-ranking-ranking-overview-bm25]]
@@ -45,7 +45,7 @@ Hybrid search techniques combine results from full-text and vector search pipeli
4545

4646
[float]
4747
[[re-ranking-overview-second-stage]]
48-
=== Second stage: Re-ranking
48+
=== Re-ranking
4949

5050
When using the following advanced re-ranking pipelines, first-stage retrieval mechanisms effectively generate a set of candidates.
5151
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
6767
LTR is best suited for when you have ample training data and need highly customized relevance tuning.
6868

6969
include::semantic-reranking.asciidoc[]
70-
include::learning-to-rank.asciidoc[]
70+
include::learning-to-rank.asciidoc[]

0 commit comments

Comments
 (0)