REVIEW 2 cited by
Exploring Graph-structured Passage Representation for Multi-hop Reading Comprehension with Graph Neural Networks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Multi-hop reading comprehension focuses on one type of factoid question, where a system needs to properly integrate multiple pieces of evidence to correctly answer a question. Previous work approximates global evidence with local coreference information, encoding coreference chains with DAG-styled GRU layers within a gated-attention reader. However, coreference is limited in providing information for rich inference. We introduce a new method for better connecting global evidence, which forms more complex graphs compared to DAGs. To perform evidence integration on our graphs, we investigate two recent graph neural networks, namely graph convolutional network (GCN) and graph recurrent network (GRN). Experiments on two standard datasets show that richer global information leads to better answers. Our method performs better than all published results on these datasets.
Forward citations
Cited by 2 Pith papers
-
Discourse-Aware Semantic Self-Attention for Narrative Reading Comprehension
A self-attention reading comprehension model that injects discourse, semantic role, and coreference annotations into dedicated attention heads improves NarrativeQA question answering by up to 3.4 Rouge-L over the QANe...
-
Multi-passage BERT: A Globally Normalized BERT Model for Open-domain Question Answering
Applying global normalization across passages, 100-word sliding windows, and a passage ranker to BERT yields state-of-the-art open-domain QA results on four benchmarks.
Discussion (0). Continue with ORCID to comment.