Cargando…
Aggregating pairwise semantic differences for few-shot claim verification
As part of an automated fact-checking pipeline, the claim verification task consists in determining if a claim is supported by an associated piece of evidence. The complexity of gathering labelled claim-evidence pairs leads to a scarcity of datasets, particularly when dealing with new domains. In th...
Autores principales: | , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
PeerJ Inc.
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9680879/ https://www.ncbi.nlm.nih.gov/pubmed/36426249 http://dx.doi.org/10.7717/peerj-cs.1137 |
_version_ | 1784834501837324288 |
---|---|
author | Zeng, Xia Zubiaga, Arkaitz |
author_facet | Zeng, Xia Zubiaga, Arkaitz |
author_sort | Zeng, Xia |
collection | PubMed |
description | As part of an automated fact-checking pipeline, the claim verification task consists in determining if a claim is supported by an associated piece of evidence. The complexity of gathering labelled claim-evidence pairs leads to a scarcity of datasets, particularly when dealing with new domains. In this article, we introduce Semantic Embedding Element-wise Difference (SEED), a novel vector-based method to few-shot claim verification that aggregates pairwise semantic differences for claim-evidence pairs. We build on the hypothesis that we can simulate class representative vectors that capture average semantic differences for claim-evidence pairs in a class, which can then be used for classification of new instances. We compare the performance of our method with competitive baselines including fine-tuned Bidirectional Encoder Representations from Transformers (BERT)/Robustly Optimized BERT Pre-training Approach (RoBERTa) models, as well as the state-of-the-art few-shot claim verification method that leverages language model perplexity. Experiments conducted on the Fact Extraction and VERification (FEVER) and SCIFACT datasets show consistent improvements over competitive baselines in few-shot settings. Our code is available. |
format | Online Article Text |
id | pubmed-9680879 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2022 |
publisher | PeerJ Inc. |
record_format | MEDLINE/PubMed |
spelling | pubmed-96808792022-11-23 Aggregating pairwise semantic differences for few-shot claim verification Zeng, Xia Zubiaga, Arkaitz PeerJ Comput Sci Artificial Intelligence As part of an automated fact-checking pipeline, the claim verification task consists in determining if a claim is supported by an associated piece of evidence. The complexity of gathering labelled claim-evidence pairs leads to a scarcity of datasets, particularly when dealing with new domains. In this article, we introduce Semantic Embedding Element-wise Difference (SEED), a novel vector-based method to few-shot claim verification that aggregates pairwise semantic differences for claim-evidence pairs. We build on the hypothesis that we can simulate class representative vectors that capture average semantic differences for claim-evidence pairs in a class, which can then be used for classification of new instances. We compare the performance of our method with competitive baselines including fine-tuned Bidirectional Encoder Representations from Transformers (BERT)/Robustly Optimized BERT Pre-training Approach (RoBERTa) models, as well as the state-of-the-art few-shot claim verification method that leverages language model perplexity. Experiments conducted on the Fact Extraction and VERification (FEVER) and SCIFACT datasets show consistent improvements over competitive baselines in few-shot settings. Our code is available. PeerJ Inc. 2022-10-25 /pmc/articles/PMC9680879/ /pubmed/36426249 http://dx.doi.org/10.7717/peerj-cs.1137 Text en © 2022 Zeng and Zubiaga https://creativecommons.org/licenses/by/4.0/This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0/) , which permits unrestricted use, distribution, reproduction and adaptation in any medium and for any purpose provided that it is properly attributed. For attribution, the original author(s), title, publication source (PeerJ Computer Science) and either DOI or URL of the article must be cited. |
spellingShingle | Artificial Intelligence Zeng, Xia Zubiaga, Arkaitz Aggregating pairwise semantic differences for few-shot claim verification |
title | Aggregating pairwise semantic differences for few-shot claim verification |
title_full | Aggregating pairwise semantic differences for few-shot claim verification |
title_fullStr | Aggregating pairwise semantic differences for few-shot claim verification |
title_full_unstemmed | Aggregating pairwise semantic differences for few-shot claim verification |
title_short | Aggregating pairwise semantic differences for few-shot claim verification |
title_sort | aggregating pairwise semantic differences for few-shot claim verification |
topic | Artificial Intelligence |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9680879/ https://www.ncbi.nlm.nih.gov/pubmed/36426249 http://dx.doi.org/10.7717/peerj-cs.1137 |
work_keys_str_mv | AT zengxia aggregatingpairwisesemanticdifferencesforfewshotclaimverification AT zubiagaarkaitz aggregatingpairwisesemanticdifferencesforfewshotclaimverification |