Unsupervised Sentence Simplification via Dependency Parsing
Text simplification is the task of rewriting a text so that it is readable and easily understood. In this paper, we propose a simple yet novel unsupervised sentence simplification system that harnesses parsing structures together with sentence embeddings to produce linguistically effective simplifications. This means our model is capable of introducing substantial modifications to simplify a sentence while maintaining its original semantics and adequate fluency. We establish the unsupervised state-of-the-art at 39.13 SARI on TurkCorpus set and perform competitively against supervised baselines on various quality metrics. Furthermore, we demonstrate our framework's extensibility to other languages via a proof-of-concept on Vietnamese data. Code for reproduction is published at \url{https://github.com/isVy08/USDP}.
Code (1)
Tasks
Dependency ParsingSentenceSentence EmbeddingsText SimplificationSimilar Papers 제목 키워드 기반
Unsupervised Sentence Simplification via Dependency Parsing
Text simplification is the task of rewriting a text so that it is readable and easily understood. In this paper, we propose a simple yet novel unsupervised sentence simplification system that harnesses parsing structures…
Dependency ParsingSentenceSentence EmbeddingsText SimplificationA Survey of Unsupervised Dependency Parsing
Syntactic dependency parsing is an important task in natural language processing. Unsupervised dependency parsing aims to learn a dependency parser from sentences that have no annotation of their correct parse trees. Des…
Dependency ParsingSurveyUnsupervised Dependency ParsingSplitting Complex English Sentences
This paper applies parsing technology to the task of syntactic simplification of English sentences, focusing on the identification of text spans that can be removed from a complex sentence. We report the most comprehensi…
Lexical SimplificationMachine TranslationPOSReading Comprehension+2Discourse Analysis via Questions and Answers: Parsing Dependency Structures of Questions Under Discussion
Automatic discourse processing is bottlenecked by data: current discourse formalisms pose highly demanding annotation tasks involving large taxonomies of discourse relations, making them inaccessible to lay annotators. T…
Dependency ParsingQuestion AnsweringSentenceOn Finding the K-best Non-projective Dependency Trees
The connection between the maximum spanning tree in a directed graph and the best dependency tree of a sentence has been exploited by the NLP community. However, for many dependency parsing schemes, an important detail o…
Dependency ParsingSentence