Update README.md
Browse files
README.md
CHANGED
@@ -7,10 +7,10 @@ language:
|
|
7 |
size_categories:
|
8 |
- 1M<n<10M
|
9 |
---
|
10 |
-
#
|
11 |
|
12 |
## Introduction
|
13 |
-
|
14 |
|
15 |
|
16 |
Passage ranking are important and challenging topics for both academics and industries in the area of Information Retrieval (IR). The goal of passage ranking is to compile a search result list ordered in terms of relevance to the query from a large passage collection. Typically, Passage ranking involves two stages: passage retrieval and passage re-ranking.
|
@@ -18,7 +18,7 @@ Passage ranking are important and challenging topics for both academics and indu
|
|
18 |
To support the passage ranking research, various benchmark datasets are constructed. However, the commonly-used datasets for passage ranking usually focus on the English language. For non-English scenarios, such as Chinese, the existing datasets are limited in terms of data scale, fine-grained relevance annotation and false negative issues.
|
19 |
|
20 |
|
21 |
-
To address this problem, we introduce
|
22 |
|
23 |
|
24 |
<div align=center><img width="600" height="200" src="https://github.com/THUIR/T2Ranking/blob/main/pic/stat.png?raw=true"/></div>
|
@@ -26,7 +26,7 @@ To address this problem, we introduce T2Ranking, a large-scale Chinese benchmark
|
|
26 |
|
27 |
|
28 |
|
29 |
-
Compared with existing datasets,
|
30 |
* The proposed dataset focus on the Chinese search scenario, and has advantages in data scale compared with existing Chinese passage ranking datasets, which can better support the design of deep learning algorithms
|
31 |
* The proposed dataset has a large number of fine-grained relevance annotations, which is helpful for mining fine-grained relationship between queries and passages and constructing more accurate ranking algorithms.
|
32 |
* By retrieving passage results from multiple commercial search engines and providing complete annotation, we ease the false negative problem to some extent, which is beneficial to providing more accurate evaluation.
|
|
|
7 |
size_categories:
|
8 |
- 1M<n<10M
|
9 |
---
|
10 |
+
# T<sup>2</sup>Ranking
|
11 |
|
12 |
## Introduction
|
13 |
+
T<sup>2</sup>Ranking is a large-scale Chinese benchmark for passage ranking. The details about T<sup>2</sup>Ranking are elaborated in [this paper](https://arxiv.org/abs/2304.03679#).
|
14 |
|
15 |
|
16 |
Passage ranking are important and challenging topics for both academics and industries in the area of Information Retrieval (IR). The goal of passage ranking is to compile a search result list ordered in terms of relevance to the query from a large passage collection. Typically, Passage ranking involves two stages: passage retrieval and passage re-ranking.
|
|
|
18 |
To support the passage ranking research, various benchmark datasets are constructed. However, the commonly-used datasets for passage ranking usually focus on the English language. For non-English scenarios, such as Chinese, the existing datasets are limited in terms of data scale, fine-grained relevance annotation and false negative issues.
|
19 |
|
20 |
|
21 |
+
To address this problem, we introduce T<sup>2</sup>Ranking, a large-scale Chinese benchmark for passage ranking. T<sup>2</sup>Ranking comprises more than 300K queries and over 2M unique passages from real- world search engines. Specifically, we sample question-based search queries from user logs of the Sogou search engine, a popular search system in China. For each query, we extract the content of corresponding documents from different search engines. After model-based passage segmentation and clustering-based passage de-duplication, a large-scale passage corpus is obtained. For a given query and its corresponding passages, we hire expert annotators to provide 4-level relevance judgments of each query-passage pair.
|
22 |
|
23 |
|
24 |
<div align=center><img width="600" height="200" src="https://github.com/THUIR/T2Ranking/blob/main/pic/stat.png?raw=true"/></div>
|
|
|
26 |
|
27 |
|
28 |
|
29 |
+
Compared with existing datasets, T<sup>2</sup>Ranking dataset has the following characteristics and advantages:
|
30 |
* The proposed dataset focus on the Chinese search scenario, and has advantages in data scale compared with existing Chinese passage ranking datasets, which can better support the design of deep learning algorithms
|
31 |
* The proposed dataset has a large number of fine-grained relevance annotations, which is helpful for mining fine-grained relationship between queries and passages and constructing more accurate ranking algorithms.
|
32 |
* By retrieving passage results from multiple commercial search engines and providing complete annotation, we ease the false negative problem to some extent, which is beneficial to providing more accurate evaluation.
|