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}.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Document-Level Text Generation with Minimum Bayes Risk Decoding using Optimal Transport
LLMs Are Not Scorers: Rethinking MT Evaluation with Generation-Based Methods
Contrastive Prompting Enhances Sentence Embeddings in LLMs through Inference-Time Steering
Sentence Embeddings as an intermediate target in end-to-end summarisation
JTCSE: Joint Tensor-Modulus Constraints and Cross-Attention for Unsupervised Contrastive Learning of Sentence Embeddings
Information Leakage of Sentence Embeddings via Generative Embedding Inversion Attacks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.