Phrase-Indexed Question Answering: A New Challenge for Scalable Document Comprehension
arXiv:1804.07726
Abstract
We formalize a new modular variant of current question answering tasks by enforcing complete independence of the document encoder from the question encoder. This formulation addresses a key challenge in machine comprehension by requiring a standalone representation of the document discourse. It additionally leads to a significant scalability advantage since the encoding of the answer candidate phrases in the document can be pre-computed and indexed offline for efficient retrieval. We experiment with baseline models for the new task, which achieve a reasonable accuracy but significantly underperform unconstrained QA models. We invite the QA research community to engage in Phrase-Indexed Question Answering (PIQA, pika) for closing the gap. The leaderboard is at: nlp.cs.washington.edu/piqa
arXiv commentEMNLP 2018 short; 6 pages
References in corpus (12)
- Teaching Machines to Read and Comprehend
- SQuAD: 100,000+ Questions for Machine Comprehension of Text
- The Goldilocks Principle: Reading Children's Books with Explicit Memory Representations
- Dynamic Coattention Networks For Question Answering
- A large annotated corpus for learning natural language inference
- Machine Comprehension Using Match-LSTM and Answer Pointer
- SearchQA: A New Q&A Dataset Augmented with Context from a Search Engine
- Asymmetric LSH (ALSH) for Sublinear Time Maximum Inner Product Search (MIPS)
- Quasar: Datasets for Question Answering by Search and Reading
- Learning Recurrent Span Representations for Extractive Question Answering
- Neural Models for Information Retrieval
- Reinforced Mnemonic Reader for Machine Reading Comprehension