Multi-Hop Fact Checking of Political Claims
- URL: http://arxiv.org/abs/2009.06401v3
- Date: Tue, 1 Jun 2021 14:06:14 GMT
- Title: Multi-Hop Fact Checking of Political Claims
- Authors: Wojciech Ostrowski, Arnav Arora, Pepa Atanasova, Isabelle Augenstein
- Abstract summary: We study more complex claim verification of naturally occurring claims with multiple hops over interconnected evidence chunks.
We construct a small annotated dataset, PolitiHop, of evidence sentences for claim verification.
We find that the task is complex and achieve the best performance with an architecture that specifically models reasoning over evidence pieces.
- Score: 43.25708842000248
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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.
Related papers
- EX-FEVER: A Dataset for Multi-hop Explainable Fact Verification [22.785622371421876]
We present a pioneering dataset for multi-hop explainable fact verification.
With over 60,000 claims involving 2-hop and 3-hop reasoning, each is created by summarizing and modifying information from hyperlinked Wikipedia documents.
We demonstrate a novel baseline system on our EX-FEVER dataset, showcasing document retrieval, explanation generation, and claim verification.
arXiv Detail & Related papers (2023-10-15T06:46:15Z) - Give Me More Details: Improving Fact-Checking with Latent Retrieval [58.706972228039604]
Evidence plays a crucial role in automated fact-checking.
Existing fact-checking systems either assume the evidence sentences are given or use the search snippets returned by the search engine.
We propose to incorporate full text from source documents as evidence and introduce two enriched datasets.
arXiv Detail & Related papers (2023-05-25T15:01:19Z) - Locate Then Ask: Interpretable Stepwise Reasoning for Multi-hop Question
Answering [71.49131159045811]
Multi-hop reasoning requires aggregating multiple documents to answer a complex question.
Existing methods usually decompose the multi-hop question into simpler single-hop questions.
We propose an interpretable stepwise reasoning framework to incorporate both single-hop supporting sentence identification and single-hop question generation.
arXiv Detail & Related papers (2022-08-22T13:24:25Z) - Generating Literal and Implied Subquestions to Fact-check Complex Claims [64.81832149826035]
We focus on decomposing a complex claim into a comprehensive set of yes-no subquestions whose answers influence the veracity of the claim.
We present ClaimDecomp, a dataset of decompositions for over 1000 claims.
We show that these subquestions can help identify relevant evidence to fact-check the full claim and derive the veracity through their answers.
arXiv Detail & Related papers (2022-05-14T00:40:57Z) - Dynamic Semantic Graph Construction and Reasoning for Explainable
Multi-hop Science Question Answering [50.546622625151926]
We propose a new framework to exploit more valid facts while obtaining explainability for multi-hop QA.
Our framework contains three new ideas: (a) tt AMR-SG, an AMR-based Semantic Graph, constructed by candidate fact AMRs to uncover any hop relations among question, answer and multiple facts, (b) a novel path-based fact analytics approach exploiting tt AMR-SG to extract active facts from a large fact pool to answer questions, and (c) a fact-level relation modeling leveraging graph convolution network (GCN) to guide the reasoning process.
arXiv Detail & Related papers (2021-05-25T09:14:55Z) - A Knowledge Enhanced Learning and Semantic Composition Model for Multi-Claim Fact Checking [18.395092826197267]
We propose an end-to-end knowledge enhanced learning and verification method for multi-claim fact checking.
Our method consists of two modules, KG-based learning enhancement and multi-claim semantic composition.
arXiv Detail & Related papers (2021-04-27T08:43:14Z) - Few Shot Learning for Information Verification [0.0]
We aim to verify facts based on evidence selected from a list of articles taken from Wikipedia.
In this research, we aim to verify facts based on evidence selected from a list of articles taken from Wikipedia.
arXiv Detail & Related papers (2021-02-22T12:56:12Z) - HoVer: A Dataset for Many-Hop Fact Extraction And Claim Verification [74.66819506353086]
HoVer is a dataset for many-hop evidence extraction and fact verification.
It challenges models to extract facts from several Wikipedia articles that are relevant to a claim.
Most of the 3/4-hop claims are written in multiple sentences, which adds to the complexity of understanding long-range dependency relations.
arXiv Detail & Related papers (2020-11-05T20:33:11Z) - Constructing A Multi-hop QA Dataset for Comprehensive Evaluation of
Reasoning Steps [31.472490306390977]
A multi-hop question answering dataset aims to test reasoning and inference skills by requiring a model to read multiple paragraphs to answer a given question.
Previous studies revealed that many examples in existing multi-hop datasets do not require multi-hop reasoning to answer a question.
We present a new multi-hop QA dataset, called 2WikiMultiHopQA, which uses structured and unstructured data.
arXiv Detail & Related papers (2020-11-02T15:42:40Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.