| Challenge: | Existing methods for fine-grained text sentiment transfer only reverse the sentiment polarity of text, but they lack a robust and parallel learning algorithm. |
| Approach: | They propose a novel fine-grained text sentiment transfer task that revises a sequence to satisfy a given sentiment intensity while preserving the original semantic content. |
| Outcome: | The proposed model outperforms existing methods by a large margin in automatic evaluation and human evaluation. |
Similar Papers
Learning to Control the Fine-grained Sentiment for Story Ending Generation (P19-1)
Copied to clipboard
| Challenge: | Existing studies focus on controlling the sentiment of story endings. |
| Approach: | They propose a generic and novel framework which controls fine-grained sentiment intensity for automatic story ending generation without manually annotating sentiment labels. |
| Outcome: | The proposed framework can generate story endings which meet the given sentiment intensity better. |
Unpaired Sentiment-to-Sentiment Translation: A Cycled Reinforcement Learning Approach (P18-1)
Copied to clipboard
| Challenge: | Existing studies for sentiment-to-sentiment "translation" only change the underlying sentiment and fail to keep the semantic content. |
| Approach: | They propose a cycled reinforcement learning method that combines neutralization module and emotionalization module. |
| Outcome: | The proposed method outperforms state-of-the-art systems on Yelp and Amazon review datasets. |
Faithful Low-Resource Data-to-Text Generation through Cycle Training (2023.acl-long)
Copied to clipboard
| Challenge: | Methods to generate text from structured data have advanced significantly in recent years, but can fail to produce output faithful to the input data, especially on out-of-domain data. |
| Approach: | They evaluate the effectiveness of cycle training by using two models which are inverses of each other to generate text from structured data and one which generates the structured data from natural language text. |
| Outcome: | The proposed approach achieves nearly the same performance as fully supervised approaches on the WebNLG, E2E, WTQ, and WSQL datasets. |
Focus-Constrained Attention Mechanism for CVAE-based Response Generation (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing models generate high-frequency but trivial responses such as "I don't know" or "I'm ok" due to the discrepancy in discourse-level information, standard models generate one-to-many relationships. |
| Approach: | They propose to transform coarse-grained discourse-level information into fine-grounded word-level knowledge by introducing a fine-grain focus signal and a focus-constrained attention mechanism to take full advantage of focus. |
| Outcome: | The proposed model can generate more diverse and informative responses compared with state-of-the-art models. |
Learning Sentiment Memories for Sentiment Modification without Parallel Data (D18-1)
Copied to clipboard
| Challenge: | Existing methods for sentiment modification generate input-irrelevant texts due to lack of parallel data. |
| Approach: | They propose a method that automatically extracts appropriate sentiment information from learned sentiment memories according to the specific context. |
| Outcome: | The proposed method significantly improves the content preservation degree and achieves the state-of-the-art performance. |
Towards Content Transfer through Grounded Text Generation (N19-1)
Copied to clipboard
| Challenge: | Recent work in neural natural language generation has attracted significant interest in controlling the form of text, such as style, persona, and wordiness. |
| Approach: | They propose a task where the task is to generate a next sentence in a document that fits its context and is grounded in . external textual source such as a news story. |
| Outcome: | The proposed task is based on 640k Wikipedia referenced sentences paired with the source articles to show significant improvements against baselines. |
AGSC: Adaptive Granularity and Semantic Clustering for Uncertainty Quantification in Long-text Generation (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods for aggregating large-form outputs overlook the nuance of neutral information and suffer from the high computational cost of fine-grained decomposition. |
| Approach: | They propose a UQ framework that uses NLI neutral probabilities as triggers to distinguish irrelevance from uncertainty, reducing computation costs. |
| Outcome: | Experiments on BIO and LongFact show that the proposed framework reduces inference time by 60% compared to full atomic decomposition. |
Beyond Noise: Mitigating the Impact of Fine-grained Semantic Divergences on Neural Machine Translation (2021.acl-long)
Copied to clipboard
| Challenge: | Prior work treats all types of mismatches between source and target as noise . Consequently, it remains unclear how noisy parallel training samples impact NMT training. |
| Approach: | They propose a divergent-aware NMT framework that uses factors to help NMT recover from the degradation caused by naturally occurring divergences. |
| Outcome: | The proposed framework improves translation quality and model calibration on EN-FR tasks. |
CHAE: Fine-Grained Controllable Story Generation with Characters, Actions and Emotions (2022.coling-1)
Copied to clipboard
| Challenge: | Existing studies on story generation focus on coarse-grained control of the story, neglecting the details of the narrative. |
| Approach: | They propose a model for fine-grained control on the story that allows the generation of customized stories with characters, corresponding actions and emotions arbitrarily assigned. |
| Outcome: | The proposed method has strong controllability to generate customized stories according to the fine-grained personalized guidance. |
Reinforcement Learning with Token-level Feedback for Controllable Text Generation (2024.findings-naacl)
Copied to clipboard
| Challenge: | Existing methods for controllable text generation are guided by coarse-grained feedback, which may lead to suboptimal performance owing to semantic twists or progressions within sentences. |
| Approach: | They propose a reinforcement learning algorithm which formulates TOken-LEvel rewards for controllable text generation and employs a "first-quantize-then-noise" paradigm to enhance the robustness of the RL algorithm. |
| Outcome: | The proposed algorithm can achieve superior performance on single-attribute and multi-attract control tasks. |