Using Natural Language Relations between Answer Choices for Machine Comprehension

by   Rajkumar Pujari, et al.

When evaluating an answer choice for Reading Comprehension task, other answer choices available for the question and the answers of related questions about the same paragraph often provide valuable information. In this paper, we propose a method to leverage the natural language relations between the answer choices, such as entailment and contradiction, to improve the performance of machine comprehension. We use a stand-alone question answering (QA) system to perform QA task and a Natural Language Inference (NLI) system to identify the relations between the choice pairs. Then we perform inference using an Integer Linear Programming (ILP)-based relational framework to re-evaluate the decisions made by the standalone QA system in light of the relations identified by the NLI system. We also propose a multitask learning model that learns both the tasks jointly.


page 1

page 2

page 3

page 4


Training a Ranking Function for Open-Domain Question Answering

In recent years, there have been amazing advances in deep learning metho...

A Puzzle-Based Dataset for Natural Language Inference

We provide here a dataset for tasks related to natural language understa...

A Joint Model for Question Answering and Question Generation

We propose a generative machine comprehension model that learns jointly ...

QASem Parsing: Text-to-text Modeling of QA-based Semantics

Several recent works have suggested to represent semantic relations with...

Variational Question-Answer Pair Generation for Machine Reading Comprehension

We present a deep generative model of question-answer (QA) pairs for mac...

Machine Comprehension Using Match-LSTM and Answer Pointer

Machine comprehension of text is an important problem in natural languag...

Multi-tasking Dialogue Comprehension with Discourse Parsing

Multi-party dialogue machine reading comprehension (MRC) raises an even ...