Can Knowledge Graphs Simplify Text?

Anthony Colas, Haodi Ma, Xuanli He, Yang Bai, Daisy Zhe Wang
8/14/2023
cs.CL

No official code found. Best implementation: acolas1/KGSimple (11 stars, CC0-1.0, last commit 2023-12-14).

Abstract

Knowledge Graph (KG)-to-Text Generation has seen recent improvements in generating fluent and informative sentences which describe a given KG. As KGs are widespread across multiple domains and contain important entity-relation information, and as text simplification aims to reduce the complexity of a text while preserving the meaning of the original text, we propose KGSimple, a novel approach to unsupervised text simplification which infuses KG-established techniques in order to construct a simplified KG path and generate a concise text which preserves the original input's meaning. Through an iterative and sampling KG-first approach, our model is capable of simplifying text when starting from a KG by learning to keep important information while harnessing KG-to-text generation to output fluent and descriptive sentences. We evaluate various settings of the KGSimple model on currently-available KG-to-text datasets, demonstrating its effectiveness compared to unsupervised text simplification models which start with a given complex text. Our code is available on GitHub.

View on arXivView PDF

Code Implementations(1)

acolas1/KGSimpleCommunity100%
CC0-1.0

Repository for "Can Knowledge Graphs Simplify Text?" accepted to CIKM 2023.

112Shell, PythonOct 24, 20232 years agoCC0-1.0

Similar Papers

Cite this paper

@article{colas2023knowledge,
  title  = {Can Knowledge Graphs Simplify Text?},
  author = {Anthony Colas and Haodi Ma and Xuanli He and Yang Bai and Daisy Zhe Wang},
  year   = {2023},
  eprint = {2308.06975},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2308.06975v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2308.06975.svg)](https://codeofpaper.com/paper/2308.06975)

Discussion