CLAug 14, 2023

Can Knowledge Graphs Simplify Text?

arXiv:2308.06975v35 citationsh-index: 24Has Code
Originality Incremental advance
AI Analysis

This addresses text simplification for domains with knowledge graphs, but it is incremental as it adapts existing KG-to-text techniques.

The paper tackles the problem of text simplification by proposing KGSimple, an unsupervised approach that uses knowledge graphs to generate concise text while preserving meaning, showing effectiveness compared to other unsupervised models on available datasets.

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.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes