Teaching Machines to Read and Comprehend
Written for the Research library (claude-opus-5-5) from the paper text, in our own words: the license "arXiv — non-exclusive licence to distribute" does not allow redistributing the text itself. Original — arxiv.org/pdf/1506.03340
Summary
Research on machine reading had no large supervised datasets of documents paired with questions and answers. Earlier systems therefore depended on hand-built grammars, information extraction or small synthetic corpora. The authors generate this kind of data automatically from CNN and Daily Mail news articles. Each article comes with bullet-point highlights that summarise it in new wording rather than copying it. They turn each highlight into a Cloze-style query by blanking out one entity at a time. Models should have to use the document, not background knowledge or language-model guesses. To ensure this, a coreference system groups mentions of the same entity, each entity becomes an abstract marker, and the markers are shuffled again every time an example is loaded. On this resource of about one million examples they compare frequency baselines, a PropBank frame-semantic pipeline, a word-distance heuristic and several LSTM-based neural readers. The attention-based Attentive and Impatient Readers score highest. They beat the symbolic NLP methods and a Deep LSTM Reader that has no attention. The work created a widely adopted benchmark and showed that attention helps networks combine evidence spread across long texts.
Key points
- Corpus scale: about 93k CNN and 220k Daily Mail articles, giving roughly 380k CNN and 879k Daily Mail training queries. Documents average about 760–810 tokens, and articles longer than 2,000 tokens were removed. The generation code is released at github.com/deepmind/rc-data.
- Task difficulty: after anonymisation, choosing the most frequent entity in the document gives the correct answer only 30.5% of the time on CNN and 25.6% on Daily Mail.
- Symbolic benchmarks: the frame-semantic approach suffers from poor parser coverage and cannot handle queries whose answer needs several sentences. The word-distance benchmark (maximum penalty m = 8) does surprisingly well, especially on Daily Mail, because the highlights often reuse words from the article.
- Neural models: the Uniform Reader, which ignores attention weights, performs poorly, which supports the claim that attention drives the gains. The Deep LSTM Reader copes reasonably with sequences of up to 2,000 tokens. The Attentive and Impatient Readers do best even though they use only single-layer LSTMs.
- Analysis: attention heat maps show the Attentive Reader handling synonyms ("killed" → "deceased") and coreference while also using how close query words sit to candidate answers.
Cited by
- Leveraging Digitized Newspapers to Collect Summarization Data in Low-Resource Languages
- Muppet: Massive Multi-task Representations with Pre-Finetuning
- Learning to Compose Neural Networks for Question Answering
- On the Cross-lingual Transferability of Monolingual Representations
- Layer Normalization
- MS MARCO: A Human Generated MAchine Reading COmprehension Dataset
- A Multitask, Multilingual, Multimodal Evaluation of ChatGPT on Reasoning, Hallucination, and Interactivity
- LLMs instead of Human Judges? A Large Scale Empirical Study across 20 NLP Evaluation Tasks
- STARC: Structured Annotations for Reading Comprehension
- Identifying and Reducing Gender Bias in Word-Level Language Models
- CLIFF: Contrastive Learning for Improving Faithfulness and Factuality in Abstractive Summarization
- A Thorough Examination of the CNN/Daily Mail Reading Comprehension Task
- Reading Wikipedia to Answer Open-Domain Questions
- Fast Abstractive Summarization with Reinforce-Selected Sentence Rewriting
- DialogSum: A Real-Life Scenario Dialogue Summarization Dataset
- Long Short-Term Memory-Networks for Machine Reading
- Neural Summarization by Extracting Sentences and Words
- Simple and Effective Multi-Paragraph Reading Comprehension
- A Discourse-Aware Attention Model for Abstractive Summarization of Long Documents
- GSum: A General Framework for Guided Neural Abstractive Summarization
- Learning to Ask: Neural Question Generation for Reading Comprehension
- SearchQA: A New Q&A Dataset Augmented with Context from a Search Engine
- FEQA: A Question Answering Evaluation Framework for Faithfulness Assessment in Abstractive Summarization
- English Machine Reading Comprehension Datasets: A Survey
- Multi-News: A Large-Scale Multi-Document Summarization Dataset and Abstractive Hierarchical Model
- QAFactEval: Improved QA-Based Factual Consistency Evaluation for Summarization
- Ranking Generated Summaries by Correctness: An Interesting but Challenging Application for Natural Language Inference
- Controllable Abstractive Summarization
- Reducing Transformer Depth on Demand with Structured Dropout
- A Survey of Data Augmentation Approaches for NLP
- Bottom-Up Abstractive Summarization
- Annotating and Modeling Fine-grained Factuality in Summarization
- Newsroom: A Dataset of 1.3 Million Summaries with Diverse Extractive Strategies
- A Survey on Automated Fact-Checking
- DuReader: a Chinese Machine Reading Comprehension Dataset from Real-world Applications
- The Goldilocks Principle: Reading Children's Books with Explicit Memory Representations
- TRUE: Re-evaluating Factual Consistency Evaluation
- Cosmos QA: Machine Reading Comprehension with Contextual Commonsense Reasoning
- C-Eval: A Multi-Level Multi-Discipline Chinese Evaluation Suite for Foundation Models
- Attention is not Explanation
- LLM-Blender: Ensembling Large Language Models with Pairwise Ranking and Generative Fusion
- TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehension
- RealTime QA: What's the Answer Right Now?
- How Much Reading Does Reading Comprehension Require? A Critical Investigation of Popular Benchmarks
- A Diagram Is Worth A Dozen Images
- CTRL: A Conditional Transformer Language Model for Controllable Generation
- Looking Beyond the Surface: A Challenge Set for Reading Comprehension over Multiple Sentences
- The NarrativeQA Reading Comprehension Challenge
- Explainable Automated Fact-Checking for Public Health Claims
- Neural Text Summarization: A Critical Evaluation
- Ask Me Anything: Dynamic Memory Networks for Natural Language Processing
- Natural Questions: A Benchmark for Question Answering Research
- WikiLingua: A New Benchmark Dataset for Cross-Lingual Abstractive Summarization
- RACE: Large-scale ReAding Comprehension Dataset From Examinations
- TVQA: Localized, Compositional Video Question Answering
- MLQA: Evaluating Cross-lingual Extractive Question Answering
- BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehension
- Discourse Parsing with Attention-based Hierarchical Neural Networks
- DailyDialog: A Manually Labelled Multi-turn Dialogue Dataset
- CMMLU: Measuring massive multitask language understanding in Chinese
- RA-DIT: Retrieval-Augmented Dual Instruction Tuning
- Hierarchical Transformers for Multi-Document Summarization
- Event Extraction as Machine Reading Comprehension
- LogiQA: A Challenge Dataset for Machine Reading Comprehension with Logical Reasoning
- SimCLS: A Simple Framework for Contrastive Learning of Abstractive Summarization
- BRIO: Bringing Order to Abstractive Summarization
- The Natural Language Decathlon: Multitask Learning as Question Answering
- The Third Multilingual Surface Realisation Shared Task (SR'20): Overview and Evaluation Results
- SummaRuNNer: A Recurrent Neural Network based Sequence Model for Extractive Summarization of Documents
- fairseq: A Fast, Extensible Toolkit for Sequence Modeling
- Understanding Factuality in Abstractive Summarization with FRANK: A Benchmark for Factuality Metrics
- The LAMBADA dataset: Word prediction requiring a broad discourse context
- A Deep Reinforced Model for Abstractive Summarization
- SQuAD: 100,000+ Questions for Machine Comprehension of Text
- Know What You Don't Know: Unanswerable Questions for SQuAD
- Is Reinforcement Learning (Not) for Natural Language Processing: Benchmarks, Baselines, and Building Blocks for Natural Language Policy Optimization
- EQUATE: A Benchmark Evaluation Framework for Quantitative Reasoning in Natural Language Inference
- Reasoning about Entailment with Neural Attention
- Leveraging Pre-trained Checkpoints for Sequence Generation Tasks
- DuoRC: Towards Complex Language Understanding with Paraphrased Reading Comprehension
- NLP Evaluation in trouble: On the Need to Measure LLM Data Contamination for each Benchmark
- Multitask Prompted Training Enables Zero-Shot Task Generalization
- Harnessing the linguistic signal to predict scalar inferences
- Bidirectional Attention Flow for Machine Comprehension
- Is Attention Interpretable?
- SCROLLS: Standardized CompaRison Over Long Language Sequences
- Pragmatically Informative Text Generation
- Aya Dataset: An Open-Access Collection for Multilingual Instruction Tuning
- Beyond the Imitation Game: Quantifying and extrapolating the capabilities of language models
- DREAM: A Challenge Data Set and Models for Dialogue-Based Reading Comprehension
- UL2: Unifying Language Learning Paradigms
- The Galactic Dependencies Treebanks: Getting More Data by Synthesizing New Languages
- Aya Model: An Instruction Finetuned Open-Access Multilingual Language Model
- SPoT: Better Frozen Model Adaptation through Soft Prompt Transfer
- Machine Comprehension Using Match-LSTM and Answer Pointer
- Is ChatGPT a Good NLG Evaluator? A Preliminary Study
- RSA-Control: A Pragmatics-Grounded Lightweight Controllable Text Generation Framework
- Crowdsourcing Multiple Choice Science Questions
- Constructing Datasets for Multi-hop Reading Comprehension Across Documents
- Towards AI-Complete Question Answering: A Set of Prerequisite Toy Tasks
Cite
@misc{hermann2015teaching,
title = {{Teaching Machines to Read and Comprehend}},
author = {Hermann, Karl Moritz and Kočiský, Tomáš and Grefenstette, Edward and Espeholt, Lasse and Kay, Will and Suleyman, Mustafa and Blunsom, Phil},
year = {2015},
doi = {10.48550/arxiv.1506.03340},
eprint = {1506.03340},
archivePrefix = {arXiv},
url = {https://doi.org/10.48550/arxiv.1506.03340}
}References
- Ellen Riloff and Michael Thelen. A rule-based question answering system for reading comprehension tests. In Proceedings of the ANLP/NAACL Workshop on Reading Comprehension Tests As Evaluation for Computer-based Language Understanding Sytems. find
- Hoifung Poon, Janara Christensen, Pedro Domingos, Oren Etzioni, Raphael Hoffmann, Chloe Kiddon, Thomas Lin, Xiao Ling, Mausam, Alan Ritter, Stefan Schoenmackers, Stephen Soderland, Dan Weld, Fei Wu, and Congle Zhang. Machine reading at the University of Washington. In Proceedings of the NAACL HLT 20… find
- Jason Weston, Sumit Chopra, and Antoine Bordes. Memory networks. CoRR, abs/1410.3916, 2014. find
- Sainbayar Sukhbaatar, Arthur Szlam, Jason Weston, and Rob Fergus. End-to-end memory networks. CoRR, abs/1503.08895, 2015. find
- Terry Winograd. Understanding Natural Language. Academic Press, Inc., Orlando, FL, USA, 1972. find
- Dzmitry Bahdanau, Kyunghyun Cho, and Yoshua Bengio. Neural machine translation by jointly learning to align and translate. CoRR, abs/1409.0473, 2014. find our card
- Volodymyr Mnih, Nicolas Heess, Alex Graves, and Koray Kavukcuoglu. Recurrent models of visual attention. In Advances in Neural Information Processing Systems 27. find
- Karol Gregor, Ivo Danihelka, Alex Graves, and Daan Wierstra. DRAW: A recurrent neural network for image generation. CoRR, abs/1502.04623, 2015. find
- Matthew Richardson, Christopher J. C. Burges, and Erin Renshaw. Mctest: A challenge dataset for the open-domain machine comprehension of text. In Proceedings of EMNLP. find our card
- Krysta Svore, Lucy Vanderwende, and Christopher Burges. Enhancing single-document summarization by combining RankNet and third-party sources. In Proceedings of EMNLP/CoNLL. find
- Kristian Woodsend and Mirella Lapata. Automatic generation of story highlights. In Proceedings of ACL, 2010. find
- Wilson L Taylor. “Cloze procedure”: a new tool for measuring readability. Journalism Quarterly, 30:415–433, 1953. find
- Dipanjan Das, Desai Chen, André F. T. Martins, Nathan Schneider, and Noah A. Smith. Frame-semantic parsing. Computational Linguistics, 40(1):9–56, 2013. find our card
- Karl Moritz Hermann, Dipanjan Das, Jason Weston, and Kuzman Ganchev. Semantic frame identification with distributed word representations. In Proceedings of ACL, June 2014. find
- Nal Kalchbrenner, Edward Grefenstette, and Phil Blunsom. A convolutional neural network for modelling sentences. In Proceedings of ACL, 2014. find our card
- Ronan Collobert, Jason Weston, Léon Bottou, Michael Karlen, Koray Kavukcuoglu, and Pavel Kuksa. Natural language processing (almost) from scratch. Journal of Machine Learning Research, 12:2493–2537, November 2011. find our card
- Ilya Sutskever, Oriol Vinyals, and Quoc V. V Le. Sequence to sequence learning with neural networks. In Advances in Neural Information Processing Systems 27. find
- Sepp Hochreiter and Jürgen Schmidhuber. Long short-term memory. Neural Computation, 9(8):1735–1780, November 1997. find
- Alex Graves. Supervised Sequence Labelling with Recurrent Neural Networks, volume 385 of Studies in Computational Intelligence. Springer, 2012. find
- T. Tieleman and G. Hinton. Lecture 6.5—RmsProp: Divide the gradient by a running average of its recent magnitude. COURSERA: Neural Networks for Machine Learning, 2012. find