paper-with-me

홈 › Papers

Complexity-Weighted Loss and Diverse Reranking for Sentence Simplification

2019-04-04 · NAACL 2019 6 · Reno Kriz, João Sedoc, Marianna Apidianaki, Carolina Zheng, Gaurav Kumar, Eleni Miltsakaki, Chris Callison-Burch

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.

📄 PDF Abstract BibTeX arXiv:1904.02767

Code (2)

rekriz11/sockeye-recipes 공식 구현
rekriz11/DeDiv

Tasks

Reinforcement LearningRerankingSentenceText Simplification

Methods 이 논문이 사용한 방법론

Sigmoid Activation 설명 없음
Tanh Activation 설명 없음
LSTM An LSTM is a type of recurrent neural network that addresses the vanishing gradient problem in vanilla…
Seq2Seq Seq2Seq, or Sequence To Sequence, is a model used in sequence prediction tasks, such as language modelling and machine translation. The idea is to use one…

Similar Papers 제목 키워드 기반

3rd Place Solution to ICCV LargeFineFoodAI Retrieval

2025-10-24 · Yang Zhong, Zhiming Wang, Zhaoyang Li, Jinyu Ma 외 arxiv

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

2024-06-18 · Jingtong Gao, Bo Chen, Weiwen Liu, Xiangyang Li 외

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 SystemsReranking

Test-Time Training for Zero-Resource Dense Retrieval Reranking

2026-05-31 · Shiyan Liu, Yichen Li arxiv

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 Generalization

Neural Reranking for Named Entity Recognition

2017-07-17 · RANLP 2017 9 · Jie Yang, Yue Zhang, Fei Dong

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+2

Approximating solution structure of the Weighted Sentence Alignment problem

2014-09-08 · Antonina Kolokolova, Renesa Nizamee

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