Recently, novel multi-hop models and datasets have been introduced to achieve more complex natural language reasoning with neural networks . One notable task that requires multi-hop reasoning is fact checking, where a chain of connected evidence pieces leads to the final verdict of a claim. However, existing datasets  do not provide annotations for the gold evidence pieces, which is a critical aspect for improving the explainability of fact checking systems. The only exception is the FEVER dataset , which is artificially constructed based on Wikipedia and does not use naturally occurring political claims and evidence pages, which is more challenging. Most claims in FEVER only have one evidence sentence associated with them and require no reasoning to make label predictions -- the small number of instances with two evidence sentences only require simple reasoning . In this paper , we study how to perform more complex claim verification on naturally occurring claims with multiple hops over  evidence chunks. We first construct a small annotated dataset, PolitiHop, of reasoning chains for claim verification . We then compare the dataset to other existing multi-hop datasets and study how to transfer knowledge from more extensive in- and out-of-domain resources to PolitiHop. We find that the task is complex , and achieve the best performance using an architecture that specifically models reasoning over evidence chains in combination with in-domain transfer learning.
Recent work has proposed multi-hop models and datasets for studying complex natural language reasoning . One notable task requiring multi-hop reasoning is fact checking, where a set of connected evidence pieces leads to the final verdict of a claim. However, existing datasets either do not provide annotations for gold evidence pages, or the only dataset which does (FEVER) mostly consists of claims which can be fact-checked with simple reasoning and is constructed artificially. Here , we study more complex claim verification of naturally occurring claims with multiple hops over interconnected evidence chunks. We : 1) construct a small annotated dataset, PolitiHop, of evidence sentences for claim verification ; 2) compare it to existing multi-hop datasets ; and 3) study how to transfer knowledge from more extensive in- and out-of-domain resources to PolitiHop. We find that the task is complex and achieve the best performance with an architecture that specifically models reasoning over evidence pieces in combination with in-domain transfer learning.
R
Recently, novel
Recent work has proposed
R
have been introduced to achieve more
for studying
D
with neural networks
R
that requires
requiring
R
chain
set
A
either
R
the gold evidence pieces, which is a critical aspect for improving the explainability of fact checking systems. The only exception is the FEVER dataset , which is artificially constructed based on Wikipedia and does not use naturally occurring political claims and evidence pages, which is more challenging. Most claims in FEVER only have one evidence sentence associated with them and require no reasoning to make label predictions -- the small number of instances with two evidence sentences only require simple reasoning . In this paper
gold evidence pages, or the only dataset which does (FEVER) mostly consists of claims which can be fact-checked with simple reasoning and is constructed artificially. Here
D
how to perform
R
on
of
A
interconnected
R
first
: 1)
R
reasoning chains
evidence sentences
R
. We then compare the dataset to other
; 2) compare it to
R
and
; and 3)
D
,
R
using
with
R
chains
pieces