Can Knowledge Graphs Simplify Text?

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Colas, Anthony, Ma, Haodi, He, Xuanli, Bai, Yang, Wang, Daisy Zhe
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Colas, Anthony
Ma, Haodi
He, Xuanli
Bai, Yang
Wang, Daisy Zhe
description 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.
doi_str_mv 10.48550/arxiv.2308.06975
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2308_06975</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2308_06975</sourcerecordid><originalsourceid>FETCH-LOGICAL-a675-d343bacfcb7922aef1f468928d2b5fd28bbaae65ef3fcccdf5defe75c2d187023</originalsourceid><addsrcrecordid>eNotzrsKwjAUgOEsDqI-gJMF59Y0aZp0EineUHCwezlJztFC1VLFy9uLl-nffj7GhjGPEqMUn0D7rO6RkNxEPM206rJxDudgc748avQHDJYtNMdrsK9OTV3RKyjweZv2WYegvuLg3x4rFvMiX4Xb3XKdz7YhpFqFXibSgiNndSYEIMWUpCYTxguryAtjLQCmCkmSc86T8kiolRM-NpoL2WOj3_arLJu2OkH7Kj_a8quVb6meOmo</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Can Knowledge Graphs Simplify Text?</title><source>arXiv.org</source><creator>Colas, Anthony ; Ma, Haodi ; He, Xuanli ; Bai, Yang ; Wang, Daisy Zhe</creator><creatorcontrib>Colas, Anthony ; Ma, Haodi ; He, Xuanli ; Bai, Yang ; Wang, Daisy Zhe</creatorcontrib><description>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.</description><identifier>DOI: 10.48550/arxiv.2308.06975</identifier><language>eng</language><subject>Computer Science - Computation and Language</subject><creationdate>2023-08</creationdate><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2308.06975$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2308.06975$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Colas, Anthony</creatorcontrib><creatorcontrib>Ma, Haodi</creatorcontrib><creatorcontrib>He, Xuanli</creatorcontrib><creatorcontrib>Bai, Yang</creatorcontrib><creatorcontrib>Wang, Daisy Zhe</creatorcontrib><title>Can Knowledge Graphs Simplify Text?</title><description>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.</description><subject>Computer Science - Computation and Language</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzrsKwjAUgOEsDqI-gJMF59Y0aZp0EineUHCwezlJztFC1VLFy9uLl-nffj7GhjGPEqMUn0D7rO6RkNxEPM206rJxDudgc748avQHDJYtNMdrsK9OTV3RKyjweZv2WYegvuLg3x4rFvMiX4Xb3XKdz7YhpFqFXibSgiNndSYEIMWUpCYTxguryAtjLQCmCkmSc86T8kiolRM-NpoL2WOj3_arLJu2OkH7Kj_a8quVb6meOmo</recordid><startdate>20230814</startdate><enddate>20230814</enddate><creator>Colas, Anthony</creator><creator>Ma, Haodi</creator><creator>He, Xuanli</creator><creator>Bai, Yang</creator><creator>Wang, Daisy Zhe</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20230814</creationdate><title>Can Knowledge Graphs Simplify Text?</title><author>Colas, Anthony ; Ma, Haodi ; He, Xuanli ; Bai, Yang ; Wang, Daisy Zhe</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a675-d343bacfcb7922aef1f468928d2b5fd28bbaae65ef3fcccdf5defe75c2d187023</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Computer Science - Computation and Language</topic><toplevel>online_resources</toplevel><creatorcontrib>Colas, Anthony</creatorcontrib><creatorcontrib>Ma, Haodi</creatorcontrib><creatorcontrib>He, Xuanli</creatorcontrib><creatorcontrib>Bai, Yang</creatorcontrib><creatorcontrib>Wang, Daisy Zhe</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Colas, Anthony</au><au>Ma, Haodi</au><au>He, Xuanli</au><au>Bai, Yang</au><au>Wang, Daisy Zhe</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Can Knowledge Graphs Simplify Text?</atitle><date>2023-08-14</date><risdate>2023</risdate><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.</abstract><doi>10.48550/arxiv.2308.06975</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2308.06975
ispartof
issn
language eng
recordid cdi_arxiv_primary_2308_06975
source arXiv.org
subjects Computer Science - Computation and Language
title Can Knowledge Graphs Simplify Text?
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T06%3A42%3A20IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Can%20Knowledge%20Graphs%20Simplify%20Text?&rft.au=Colas,%20Anthony&rft.date=2023-08-14&rft_id=info:doi/10.48550/arxiv.2308.06975&rft_dat=%3Carxiv_GOX%3E2308_06975%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true