Iryna Gurevych, Mohit Bansal, Leonardo Ribeiro, Markus Dreyer, Mengwen Liu
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Despite recent improvements in abstractive summarization, most current approaches generate summaries that are not factually consistent with the source document, severely restricting their trust and usage in real-world applications. Recent works have shown promising improvements in factuality error identification using text or dependency arc entailments; however, they do not consider the entire semantic graph simultaneously. To this end, we propose FACT-GRAPH, a method that decomposes the document and the summary into structured meaning representations (MR), which are more suitable for factuality evaluation. MRs describe core semantic concepts and their relations, aggregating the main content in both document and summary in a canonical form, and reducing data sparsity. FACTGRAPH encodes such graphs using a graph encoder augmented with structure-aware adapters to capture interactions among the concepts based on the graph connectivity, along with text representations using an adapter-based text encoder. Experiments on different benchmarks for evaluating factuality show that FACTGRAPH outperforms previous approaches by up to 15%. Furthermore, FACT-GRAPH improves performance on identifying content verifiability errors and better captures subsentence-level factual inconsistencies. 1 * Work done as an intern at Amazon Alexa AI.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2204.06508")
get_code_for_paper("2204.06508")
have("2204.06508")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2204.06508.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2204.06508)
Connect an agent — have() is free.