Elamur Research
☰
home / papers / 2019 / Natural Questions: A Benchmark for Question Answering Research

Natural Questions: A Benchmark for Question Answering Research

Written for the Research library (claude-opus-5-5) from the paper text. Original — aclanthology.org/Q19-1026.pdf

Summary

Open-domain question answering lacked training and evaluation data built from real information needs. In earlier sets such as SQuAD, annotators wrote questions after seeing the evidence. Query-based sets like MS Marco scored free-form answers with BLEU. The Google Research team built Natural Questions (NQ) to fill this gap. Each NQ item pairs an anonymized Google search query of eight or more words with a Wikipedia page taken from the top five results. Annotators read the whole page and mark a long answer, usually a paragraph, table or list. They also mark a short answer, which is one or more entity spans or a yes/no verdict. When the page has no answer, they record NULL. Quality checks show that the annotations are highly precise. Labelling the same items 25 times shows that real questions often have several acceptable answers or are truly ambiguous. To handle this, the paper defines metrics scored against five reference annotations per item and estimates a human upper bound that a system could actually reach. Baselines, including Document-QA and a DecAtt+DocReader pipeline, fall well below that bound, which makes NQ a hard benchmark for natural language understanding.

Key points

  • Release sizes: 307,373 training examples with one annotation each, 7,830 development examples with five annotations each, and 7,842 test examples with five annotations each that are kept hidden. Another 302 examples were labelled 25 times to study how much annotators disagree.
  • Questions were picked from frequent queries with simple wording rules (for example, ones starting with who, when or where). About 49% of examples have a non-NULL long answer.
  • Checked after annotation, long answers are 90% precise and short answers 84% precise.
  • The human upper bound is 90% precision and 85% recall for long answers, and 79% precision and 72% recall for short answers.
  • DecAtt+DocReader reaches 54.8% F1 on long answers. On examples whose answer is a list, it scores only 32.0%. The authors attribute the large gap to humans to the need for better language understanding.

Our summary of the paper, in our own words — not its text. The work belongs to its authors; read it at the links above.

Fields: Natural language processing

Cited by

1981 papers of our library cite it (of the 140673 whose bibliographies we read); 136 of them have a page here, the first 100 below, 1845 not yet.

Cite

The paper itself, not this page. BibTeX from the library's record of the work. DOI 10.1162/tacl_a_00276

@misc{kwiatkowski2019natural,
  title = {{Natural Questions: A Benchmark for Question Answering Research}},
  author = {Kwiatkowski, Tom and Palomaki, Jennimaria and Redfield, Olivia and Collins, Michael and Parikh, Ankur and Alberti, Chris and Epstein, Danielle and Polosukhin, Illia and Devlin, Jacob and Lee, Kenton and Toutanova, Kristina and Jones, Llion and Kelcey, Matthew and Chang, Ming-Wei and Dai, Andrew M. and Uszkoreit, Jakob and Le, Quoc and Petrov, Slav},
  year = {2019},
  doi = {10.1162/tacl\_a\_00276},
  url = {https://doi.org/10.1162/tacl_a_00276}
}

References

24 references, 15 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet.

  1. Chris Alberti, Kenton Lee, and Michael Collins. 2019. A BERT Baseline for the Natural Questions. arXiv preprint:1901.08634. — [arXiv:1901.08634](https://arxiv.org/abs/1901.08634) find
  2. Christopher Clark and Matt Gardner. 2018. Simple and effective multi-paragraph reading comprehension. In Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 845–855, Melbourne. find our card
  3. Melis, and Edward Grefenstette. 2018. The narrative qa reading comprehension challenge. Transactions of the Association for Computational Linguistics, 6317–328. find
  4. Luc Devroye, László Györfi, and Gábor Lugosi. 1997. A Probabilistic Theory of Pattern Recognition, corrected 2nd edition, volume 31 of Applications of Mathematics. Springer. find
  5. Guokun Lai, Qizhe Xie, Hanxiao Liu, Yiming Yang, and Eduard Hovy. 2017. Race: Large-scale reading comprehension dataset from examinations. In Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing, pages 785–794. Copenhagen. find our card
  6. Wei He, Kai Liu, Jing Liu, Yajuan Lyu, Shiqi Zhao, Xinyan Xiao, Yuan Liu, Yizhong Wang, Hua Wu, Qiaoqiao She, Xuan Liu, Tian Wu, and Haifeng Wang. 2018. Dureader: A Chinese machine reading comprehension dataset from real-world applications. In Proceedings of the Workshop on Machine Reading for Quest… find our card
  7. Todor Mihaylov, Peter Clark, Tushar Khot, and Ashish Sabharwal. 2018. Can A suit of armor conduct electricity? A new dataset for open book question answering. In Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, pages 2381–2391, Brussels. find
  8. Marti A. Hearst. 1992. Automatic acquisition of hyponyms from large text corpora. In COLING 1992 Volume 2: The 15th International Conference on Computational Linguistics. find
  9. Tri Nguyen, Mir Rosenberg, Xia Song, Jianfeng Gao, Saurabh Tiwary, Rangan Majumder, and Li Deng. 2016. MS MARCO: A human generated machine reading comprehension dataset. In Proceedings of the Workshop on Cognitive Computation: Integrating Neural and Symbolic Approaches. find our card
  10. Karl Moritz Hermann, Tomáš Kočiský, Edward Grefenstette, Lasse Espeholt, Will Kay, Mustafa Suleyman, and Phil Blunsom. 2015. Teaching machines to read and comprehend. In Proceedings of the 28th International Conference on Neural Information Processing Systems, NIPS’15. Cambridge, MA. find our card
  11. Takeshi Onishi, Hai Wang, Mohit Bansal, Kevin Gimpel, and David McAllester. 2016. Who did what: A large-scale person-centered cloze dataset. In Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing, pages 2230–2235. Austin, TX. find
  12. Felix Hill, Antoine Bordes, Sumit Chopra, and Jason Weston. 2015. The goldilocks principle: Reading children’s books with explicit memory representations. In Proceedings of the International Conference on Learning Representations. find our card
  13. Denis Paperno, Germán Kruszewski, Angeliki Lazaridou, Ngoc Quan Pham, Raffaella Bernardi, Sandro Pezzelle, Marco Baroni, Gemma Boleda, and Raquel Fernandez. 2016. The LAMBADA dataset: Word prediction requiring a broad discourse context. In Proceedings of the 54th Annual Meeting of the Association f… find our card
  14. Robin Jia and Percy Liang. 2017. Adversarial examples for evaluating reading comprehension systems. In Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing, pages 2021–2031, Copenhagen. find our card
  15. Mandar Joshi, Eunsol Choi, Daniel Weld, and Luke Zettlemoyer. 2017. Triviaqa: A large scale distantly supervised challenge dataset for reading comprehension. In Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 1601–1611. find our card
  16. Kishore Papineni, Salim Roukos, Todd Ward, and Wei-Jing Zhu. 2002. BLUE: A method for automatic evaluation of machine translation. In Proceedings of 40th Annual Meeting of the Association for Computational Linguistics, pages 311–318, Philadelphia. find
  17. Tomas Kocisky, Jonathan Schwarz, Phil Blunsom, Chris Dyer, Karl Moritz Hermann, Gabor Ankur Parikh, Oscar Täckström, Dipanjan Das, and Jakob Uszkoreit. 2016. A decomposable attention model for natural language inference. In Proceedings of the 2016 Conference on Empirical Methods in Natural Languag… find
  18. Adina Williams, Nikita Nangia, and Samuel Bowman. 2018. A broad-coverage challenge corpus for sentence understanding through inference. In Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Pa… find
  19. Pranav Rajpurkar, Robin Jia, and Percy Liang. 2018. Know what you don’t know: Unanswerable questions for squad. In Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers), pages 784–789. find our card
  20. Pranav Rajpurkar, Jian Zhang, Konstantin Lopyrev, and Percy Liang. 2016. SQuAD: 100,000+ Questions for Machine Comprehension of Text. In Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing, pages 2383–2392, Austin, TX. find our card
  21. Yi Yang, Wen-tau Yih, and Christopher Meek. 2015. Wikiqa: A challenge dataset for open-domain question answering. In Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, pages 2013–2018, Lisbon. find our card
  22. Siva Reddy, Danqi Chen, and Christopher D. Manning. 2018. Coqa: A conversational question answering challenge. arXiv preprint arXiv:1808.07042. find our card
  23. Zhilin Yang, Peng Qi, Saizheng Zhang, Yoshua Bengio, William Cohen, Ruslan Salakhutdinov, and Christopher D. Manning. 2018. Hotpotqa: A dataset for diverse, explainable multi-hop question answering. In Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, pages 2369… find our card
  24. Matthew Richardson, Christopher J. C. Burges, and Erin Renshaw. 2013. MCTest: A challenge dataset for the open-domain machine comprehension of text. In Proceedings of the find our card