{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/learning-how-to-simplify-from-explicit","title":"Learning How to Simplify From Explicit Labeling of Complex-Simplified Text Pairs","arxiv_id":null,"date":"2017-11-01","proceeding":"IJCNLP 2017 11","authors":["Fern Alva-Manchego","o","Joachim Bingel","Gustavo Paetzold","Carolina Scarton","Lucia Specia"],"abstract":"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.","url_abs":"https://aclanthology.org/I17-1030","url_pdf":"https://aclanthology.org/I17-1030.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"learning-how-to-simplify-from-explicit","repo_url":"https://github.com/ghpaetzold/massalign","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"machine-translation","task_name":"Machine Translation"},{"task_slug":"sentence","task_name":"Sentence"},{"task_slug":"sentence-compression","task_name":"Sentence Compression"},{"task_slug":"text-simplification","task_name":"Text Simplification"}],"methods":[{"method_slug":"ts","method_name":"TS"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/text-simplification-on-newsela","task":"Text Simplification","dataset":"Newsela","model":"SeqLabel","rank_in_archive_order":11,"of":13,"metrics":{"SARI":"29.53*"},"uses_additional_data":false},{"leaderboard":"/sota/text-simplification-on-pwkp-wikismall","task":"Text Simplification","dataset":"PWKP / WikiSmall","model":"SeqLabel","rank_in_archive_order":9,"of":11,"metrics":{"SARI":"30.50*"},"uses_additional_data":false},{"leaderboard":"/sota/text-simplification-on-turkcorpus","task":"Text Simplification","dataset":"TurkCorpus","model":"SeqLabel","rank_in_archive_order":25,"of":25,"metrics":{"SARI (EASSE>=0.2.1)":"37.08*"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"ghpaetzold/massalign","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"f0ed01208f54fdc4819b810508f8ce1fa5f7b72ef5c136d6fdc90c91374d0cfa","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}