Browse State-of-the-Art › Table-based Fact Verification
Table-based Fact Verification
19 papers with code · 1 benchmark · 2 datasets archive 2025-07-28
Verifying facts given semi-structured data.
Description from the archive archive 2025-07-28.
Benchmarks archive 2025-07-28
1 leaderboard table shown for this task, 1 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted.
| Dataset | Best model (first row in archive order) | Paper | Code | Syntology | Compare |
|---|---|---|---|---|---|
| TabFact (15 rows) | ARTEMIS-DA | ARTEMIS-DA: An Advanced Reasoning and Transformation Engine for... | — | — | Compare |
Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. A dash means no Syntology record for that paper, not a recorded non-run. Read from the graph 2026-09-24.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
2 datasets whose archive record lists this task, ordered by the archive's paper count.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Most implemented papers archive 2025-07-28
19 shown of 19 papers with code (26 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.
-
6 Oct 2022 4 repositories listed Syntology ran 2 of 3 samples · 1 unverifiedWe propose Binder, a training-free neural-symbolic framework that maps the task input to a program, which (1) allows binding a unified API of language model (LM) functionalities to a programming language (e.
-
16 Jul 2021 4 repositories listedTAPEX addresses the data scarcity challenge via guiding the language model to mimic a SQL executor on the diverse, large-scale and high-quality synthetic corpus.
-
15 Apr 2024 2 repositories listed Syntology ran 7 of 15 samples · 8 unverified · 15 pointer-only (licence)Table reasoning is a challenging task that requires understanding both natural language questions and structured tabular data.
-
9 Jan 2024 2 repositories listed Syntology ran 6 of 8 samples · 2 unverifiedWe propose the Chain-of-Table framework, where tabular data is explicitly used in the reasoning chain as a proxy for intermediate thoughts.
-
31 Jan 2023 2 repositories listedTo alleviate the above challenges, we exploit large language models (LLMs) as decomposers for effective table-based reasoning, which (i) decompose huge evidence (a huge table) into sub-evidence (a small table) to…
-
18 Sep 2024 1 repository listedCurrent Large Language Models (LLMs) exhibit limited ability to understand table structures and to apply precise numerical reasoning, which is crucial for tasks such as table question answering (TQA) and table-based…
-
25 Jun 2024 1 repository listedIn recent years, Large Language Models (LLMs) have demonstrated remarkable capabilities in parsing textual data and generating code.
-
4 Feb 2024 1 repository listedFinally, we analyze some possible directions to promote the accuracy of TFV via LLMs, which is beneficial to further research of table reasoning.
-
13 Jun 2023 1 repository listedIn this work, we propose heuristic heterogeneous graph reasoning networks (H2GRN) to capture the shared consistent evidence by strengthening associations between linguistic and logical evidence from two perspectives of…
-
5 Nov 2022 1 repository listed Syntology ran 1 of 6 samples · 5 unverifiedIn particular, on the complex set of TabFact, which contains multiple operations, PASTA largely outperforms the previous state of the art by 4.
-
22 Oct 2022 1 repository listed Syntology ran 0 of 11 samples · 11 unverifiedReasoning over tabular data requires both table structure understanding and a broad set of table reasoning skills.
-
19 Apr 2022 1 repository listed Syntology ran 1 of 2 samples · 1 unverifiedThe table-based fact verification task has recently gained widespread attention and yet remains to be a very challenging problem.
-
16 Jan 2022 1 repository listed Syntology ran 1 of 5 samples · 4 unverifiedStructured knowledge grounding (SKG) leverages structured knowledge to complete user requests, such as semantic parsing over databases and question answering over knowledge bases.
-
22 Sep 2021 1 repository listedFact verification based on structured data is challenging as it requires models to understand both natural language and symbolic operations performed over tables.
-
14 Sep 2021 1 repository listed Syntology ran 6 of 7 samples · 1 unverified · 7 pointer-only (licence)Specifically, we first retrieve logic-level program-like evidence from the given table and statement as supplementary evidence for the table.
-
9 Sep 2021 1 repository listedFrom one perspective, our system conducts masked salient token prediction to enhance the model for alignment and reasoning between the table and the statement.
-
1 Aug 2021 1 repository listedThis paper describes our approach for Task 9 of SemEval 2021: Statement Verification and Evidence Finding with Tables.
-
1 Oct 2020 1 repository listedTo be able to use long examples as input of BERT models, we evaluate table pruning techniques as a pre-processing step to drastically improve the training and prediction efficiency at a moderate drop in accuracy.
-
5 Sep 2019 1 repository listed Syntology ran 2 of 3 samples · 1 unverified · 2 pointer-only (licence)To this end, we construct a large-scale dataset called TabFact with 16k Wikipedia tables as the evidence for 118k human-annotated natural language statements, which are labeled as either ENTAILED or REFUTED.
Syntology lines on 9 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections