Cited by 6,208Topic ModelingNatural Language Processing TechniquesInformation Retrieval and Search Behavior

SQuAD: 100,000+ Questions for Machine Comprehension of Text

Open access
Rajpurkar, Pranav, Zhang, Jian, Lopyrev, Konstantin, Liang, Percy·2016·Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing

Abstract

We present the Stanford Question Answering Dataset (SQuAD), a new reading comprehension dataset consisting of 100,000+ questions posed by crowdworkers on a set of Wikipedia articles, where the answer to each question is a segment of text from the corresponding reading passage. We analyze the dataset to understand the types of reasoning required to answer the questions, leaning heavily on dependency and constituency trees. We build a strong logistic regression model, which achieves an F1 score of 51.0%, a significant improvement over a simple baseline (20%). However, human performance (86.8%) is much higher, indicating that the dataset presents a good challenge problem for future research. The dataset is freely available at https://stanford-qa.com

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.18653/v1/d16-1264

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Both F1 and Exact Match assume short, span-extractable answers, an assumption fundamentally violated by Think-class models that produce reasoning traces often running to several hundred tokens.

    “Both metrics assume short, span-extractable answers, an assumption fundamentally violated by Think-class models that produce reasoning traces often running to several hundred tokens.”

    From When Context Overwhelms: A Study of Long-Context vs. Retrieval-Based QA Under Noise (2026) · cites this paper as [15]

    The Introduction (p. 2) says SQuAD requires answers selected from passage spans, and Dataset Collection (p. 4) asks workers to select the shortest answering span. Model Evaluation (p. 7) defines Exact Match by exact agreement and F1 by token overlap, so lengthy reasoning traces could score poorly against those answers. The paper does not say the metrics themselves require span-extractable answers, or discuss Think-class models or traces of several hundred tokens. (LLM, conf=0.86)

    Experimental — accuracy not yet measured
  • SQuAD 1.1 excludes unanswerable questions added in v.2.0 that are deliberately constructed to induce mistakes so they do not in practice cause confabulations to occur.

    “We use SQuAD 1.1 which excludes the unanswerable questions added in v.2.0 that are deliberately constructed to induce mistakes so they do not in practice cause confabulations to occur.”

    From Detecting hallucinations in large language models using semantic entropy (2024) · cites this paper as [33]

    The Introduction (p. 1) describes SQuAD as a dataset in which every question has an answer span in the passage, supporting the distinction from deliberately unanswerable questions. The paper mentions v1.1 in the Introduction (p. 2), but does not discuss v2.0, questions designed to induce mistakes, or whether excluding them prevents confabulations. Dataset Collection (p. 4) also notes that additional workers marked 2.6% of development and test questions unanswerable. (LLM, conf=0.86)

    Experimental — accuracy not yet measured
  • PRECOG top-3 softmax-weighted state composition shows a small empirical degradation of 1.6 F1 compared to in-context RAG on SQuAD v1.1 dev.

    “The top-3 softmax-weighted configuration trades 1 . 6 F1 for multi-chunk fusion”

    From Structured Memory for Edge Language Models: Persistent Context and Corpus Retrieval via O(1) SSM State Injection (2026) · cites this paper as [33]

    The Introduction (p. 2) identifies SQuAD and mentions v1.1, so the paper supports the dataset identification. Its own experiments are on v1.0, however, and the Model Performance section (p. 7) reports logistic-regression and baseline results—not a PRECOG top-3 configuration, an in-context RAG comparison, or a 1.6-point F1 tradeoff. (LLM, conf=0.87)

    Experimental — accuracy not yet measured
  • The empirically optimal k is corpus-dependent: k = 1 for single-paragraph evidence (SQuAD), and k = 2-3 for multi-hop (HotpotQA).

    “The empirically optimal k is therefore corpus-dependent: k =1 for single-paragraph evidence (SQuAD), k =2 -3 for multi-hop (HotpotQA).”

    From Structured Memory for Edge Language Models: Persistent Context and Corpus Retrieval via O(1) SSM State Injection (2026) · cites this paper as [33]

    The Dataset Collection section (pp. 3–4) describes SQuAD questions and answers as based on individual paragraphs, supporting the single-paragraph characterization. It does not test or establish an empirically optimal k of 1, and our copy provides no HotpotQA comparison or k = 2–3 result. (LLM, conf=0.88)

    Experimental — accuracy not yet measured
  • No additional human verification step is required because the released SQuAD reference answers are used verbatim and no model-assisted question generation is introduced.

    “Because we use the released SQuAD reference answers verbatim and do not introduce model-assisted question generation, no additional human verification step is required.”

    From Structured Memory for Edge Language Models: Persistent Context and Corpus Retrieval via O(1) SSM State Injection (2026) · cites this paper as [33]

    The Introduction (p. 1) says SQuAD answers are spans of the reading passages, and Dataset Collection (pp. 3–4) says crowdworkers wrote the questions. The paper does not establish that reusing its reference answers eliminates the need for an additional human verification step; that is the citing authors’ judgment about their own workflow. (LLM, conf=0.83)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Rajpurkar, P., Zhang, J., Lopyrev, K., & Liang, P.
Affiliations
Stanford University (US)
Venue
Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing
Published
2016
Pages
2383-2392
OpenAlex
W2963748441
Cited by
6,208
References
2
Citations by year
2026: 335 · 2025: 492 · 2024: 506 · 2023: 1093 · 2022: 879 · 2021: 1127 · 2020: 858 · 2019: 592 · 2018: 254 · 2017: 62 · 2016: 3 · 2015: 2 · 2013: 1
FWCI
163.81
Type
conference paper
Language
en
Open access
Licence
cc-by
Locations
Conference on Empirical Methods in Natural Language Processing (EMNLP) (publishedVersion, cc-by)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
  • Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
  • Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
Keywords
question answering, reading comprehension, SQuAD, Wikipedia, dependency trees, constituency trees, logistic regression, human performance comparison, natural language understanding

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review