Complexity-Weighted Loss and Diverse Reranking for Sentence Simplification
Sentence simplification is the task of rewriting texts so they are easier to understand. Recent research has applied sequence-to-sequence (Seq2Seq) models to this task, focusing largely on training-time improvements via reinforcement learning and memory augmentation. One of the main problems with applying generic Seq2Seq models for simplification is that these models tend to copy directly from the original sentence, resulting in outputs that are relatively long and complex. We aim to alleviate this issue through the use of two main techniques. First, we incorporate content word complexities, as predicted with a leveled word complexity model, into our loss function during training. Second, we generate a large set of diverse candidate simplifications at test time, and rerank these to promote fluency, adequacy, and simplicity. Here, we measure simplicity through a novel sentence complexity model. These extensions allow our models to perform competitively with state-of-the-art systems while generating simpler sentences. We report standard automatic and human evaluation metrics.
Code (2)
Tasks
Reinforcement LearningRerankingSentenceText SimplificationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
3rd Place Solution to ICCV LargeFineFoodAI Retrieval
This paper introduces the 3rd place solution to the ICCV LargeFineFoodAI Retrieval Competition on Kaggle. Four basic models are independently trained with the weighted sum of ArcFace and Circle loss, then TTA and Ensembl…
LLM4Rerank: LLM-based Auto-Reranking Framework for Recommendations
Reranking is a critical component in recommender systems, playing an essential role in refining the output of recommendation algorithms. Traditional reranking models have focused predominantly on accuracy, but modern app…
DiversityFairnessRecommendation SystemsRerankingTest-Time Training for Zero-Resource Dense Retrieval Reranking
Dense retrievers excel at first-stage candidate generation but lack effective reranking in zero-resource settings. Existing approaches face a fundamental dilemma: cross-encoders deliver strong reranking quality but requi…
Domain GeneralizationNeural Reranking for Named Entity Recognition
We propose a neural reranking system for named entity recognition (NER). The basic idea is to leverage recurrent neural network models to learn sentence-level patterns that involve named entity mentions. In particular, g…
named-entity-recognitionNamed Entity RecognitionNamed Entity Recognition (NER)NER+2Approximating solution structure of the Weighted Sentence Alignment problem
We study the complexity of approximating solution structure of the bijective weighted sentence alignment problem of DeNero and Klein (2008). In particular, we consider the complexity of finding an alignment that has a si…
Sentence