Papers with Code 아카이브

Passage Retrieval

태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.

하위 태스크
0
평가표
19
보존된 평가 기록
38

Passage retrieval is a specialized type of IR application that retrieves relevant passages (or pieces of text) rather than an entire ranked set of documents.

데이터셋

출처에 같은 태스크 이름으로 연결된 데이터셋입니다. 동명 태스크가 포함될 수 있으므로, 비교할 때는 평가 결과의 조건도 확인하세요.

Natural Questions

The Natural Questions corpus is a question answering dataset containing 307,373 training examples, 7,830 development examples, and 7,842 test examples. Each example is comprised of a google.com query and a corresponding Wikipedia page. Each Wikipedia page has a passage (or long answer) annotated on the page that answers the question and one or more short spans from the annotated passage containing the actual answer. The long and the short answer annotations can however be empty. If they are both empty, then there is no answer on the page at all. If the long answer annotation is non-empty, but the short answer annotation is empty, then the annotated passage answers the question but no explicit short answer could be found. Finally 1% of the documents have a passage annotated with a short answer that is “yes” or “no”, instead of a list of short spans. Source: A BERT Baseline for the Natural Questions Image Source: https://paperswithcode.com/paper/natural-questions-a-benchmark-for-question/

MS MARCO

The MS MARCO (Microsoft MAchine Reading Comprehension) is a collection of datasets focused on deep learning in search. The first dataset was a question answering dataset featuring 100,000 real Bing questions and a human generated answer. Over time the collection was extended with a 1,000,000 question dataset, a natural language generation dataset, a passage ranking dataset, keyphrase extraction dataset, crawling dataset, and a conversational search. Source: https://microsoft.github.io/msmarco/ Image Source: https://arxiv.org/pdf/1809.08267.pdf

BEIR

BEIR (Benchmarking IR) is a heterogeneous benchmark containing different information retrieval (IR) tasks. Through BEIR, it is possible to systematically study the zero-shot generalization capabilities of multiple neural retrieval approaches. The benchmark contains a total of 9 information retrieval tasks (Fact Checking, Citation Prediction, Duplicate Question Retrieval, Argument Retrieval, News Retrieval, Question Answering, Tweet Retrieval, Biomedical IR, Entity Retrieval) from 19 different datasets: * MS MARCO * TREC-COVID * NFCorpus * BioASQ * Natural Questions * HotpotQA * FiQA-2018 * Signal-1M * TREC-News * ArguAna * Touche 2020 * CQADupStack * Quora Question Pairs * DBPedia * SciDocs * FEVER * Climate-FEVER * SciFact * Robust04

EntityQuestions

EntityQuestions is a dataset of simple, entity-rich questions based on facts from Wikidata (e.g., "Where was Arve Furset born? ").

QAMPARI

QAMPARI is an ODQA benchmark, where question answers are lists of entities, spread across many paragraphs. It was created by (a) generating questions with multiple answers from Wikipedia's knowledge graph and tables, (b) automatically pairing answers with supporting evidence in Wikipedia paragraphs, and (c) manually paraphrasing questions and validating each answer. Source: QAMPARI: : An Open-domain Question Answering Benchmark for Questions with Many Answers from Multiple Paragraphs Image Source: https://arxiv.org/pdf/2205.12665v2.pdf

PeerQA

We present PeerQA, a real-world, scientific, document-level Question Answering (QA) dataset. PeerQA questions have been sourced from peer reviews, which contain questions that reviewers raised while thoroughly examining the scientific article. Answers have been annotated by the original authors of each paper. The dataset contains 579 QA pairs from 208 academic articles, with a majority from ML and NLP, as well as a subset of other scientific communities like Geoscience and Public Health. PeerQA supports three critical tasks for developing practical QA systems: Evidence retrieval, unanswerable question classification, and answer generation. We provide a detailed analysis of the collected dataset and conduct experiments establishing baseline systems for all three tasks. Our experiments and analyses reveal the need for decontextualization in document-level retrieval, where we find that even simple decontextualization approaches consistently improve retrieval performance across architectures. On answer generation, PeerQA serves as a challenging benchmark for long-context modeling, as the papers have an average size of 12k tokens.

GermanDPR

GermanDPR is a dataset for passage retrieval in German. GermanDPR comprises 8,245 question/answer pairs in the training set, 1,030 pairs in the development set, and 1,025 pairs in the test set. For each pair, there are one positive context and three hard negative contexts.

CSPRD

The Chinese Stock Policy Retrieval Dataset (CSPRD) contains a Chinese policy corpus of 10,002 articles and 709 prospectus examples from 545 companies listed on China’s Science and Technology Innovation Board (STAR Market). CSPRD is bilingual in Chinese and English (Translated by ChatGPT) and is annotated by experienced experts from Shanghai Stock Exchange.

DAPFAM

Dataset DAPFAM See the accompanying paper: Ayaou et al., 2025 — “DAPFAM: A Domain‑Aware Patent Retrieval Dataset Aggregated at the Family Level” (arXiv:2506.22141). ## Summary DAPFAM provides 1 247 balanced query patent families and 45 336 target families with forward/backward‑citation relevance labels (≈ 50 K pairs). Each relevant link is explicitly marked in‑domain or out‑of‑domain according to IPC 3‑char overlap, enabling rigorous cross‑domain evaluation. * Full text (title · abstract · claims · description) plus rich metadata for every family. * Multi‑jurisdictional, English‑only text (families may originate in US, JP, EP, CN, …). * Parquet qrel file: qrels_all.parquet. ## Dataset Structure corpus.parquet # 45 336 rows, targets – every original column from the paper queries.parquet # 1 247 rows, queries – same columns + abstract_keywords qrels_all.parquet # (all | in | out) four‑column tables → query_id · relevant_id · relevance_score · domain_rel ## Citation @misc{ayaou2025dapfam, title={DAPFAM: A Domain-Aware Patent Retrieval Dataset Aggregated at the Family Level}, author={Iliass Ayaou and Denis Cavallucci and Hicham Chibane}, year={2025}, eprint={2506.22141}, archivePrefix={arXiv}, primaryClass={cs.CL} } ## Quick Stats * Queries: 1,247 * Corpus (targets): 45,336 * Qrels (all): 49,869 * Qrels (in): 19,736 * Qrels (out): 5,193

출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.