Conference paper Open Access

Learning How to Simplify From Explicit Labeling of Complex-Simplified Text Pairs

Fernando Alva-Manchego; Joachim Bingel; Gustavo Henrique Paetzold; Carolina Scarton; Lucia Specia

Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="" xmlns:oai_dc="" xmlns:xsi="" xsi:schemaLocation="">
  <dc:creator>Fernando Alva-Manchego</dc:creator>
  <dc:creator>Joachim Bingel</dc:creator>
  <dc:creator>Gustavo Henrique Paetzold</dc:creator>
  <dc:creator>Carolina Scarton</dc:creator>
  <dc:creator>Lucia Specia</dc:creator>
  <dc:description>Current research in text simplification has been hampered by two central problems: (i) the small amount of high-quality parallel simplification data available, and (ii) the lack of explicit annotations of simplification operations, such as deletions or substitutions, on existing data. While the recently introduced Newsela corpus has alleviated the first problem, simplifications still need to be learned directly from parallel text using black-box, end-to-end approaches rather than from explicit annotations. These complex-simple parallel sentence pairs often differ to such a high degree that generalization becomes difficult.  End-to-end models also make it hard to interpret what is actually learned from data.  We propose a method that decomposes the task of TS into its sub-problems. We devise a way to automatically identify operations in a parallel corpus and introduce a sequence-labeling approach based on these annotations. Finally, we provide insights on the types of transformations that different approaches can model.</dc:description>
  <dc:title>Learning How to Simplify From Explicit Labeling of Complex-Simplified Text Pairs</dc:title>
All versions This version
Views 3636
Downloads 2828
Data volume 5.0 MB5.0 MB
Unique views 3030
Unique downloads 2828


Cite as