A Hybrid Multi-Agent Prompting Approach for Simplifying Complex Sentences

• URL: http://arxiv.org/abs/2506.11681v2
• Date: Tue, 17 Jun 2025 15:59:13 GMT
• Title: A Hybrid Multi-Agent Prompting Approach for Simplifying Complex Sentences
• Authors: Pratibha Zunjare, Michael Hsiao,
• Abstract summary: We propose a hybrid approach that combines advanced prompting with multi-agent architectures to enhance the sentence simplification process.<n> Experimental results show that our approach was able to successfully simplify 70% of the complex sentences written for video game design application.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper addresses the challenge of transforming complex sentences into sequences of logical, simplified sentences while preserving semantic and logical integrity with the help of Large Language Models. We propose a hybrid approach that combines advanced prompting with multi-agent architectures to enhance the sentence simplification process. Experimental results show that our approach was able to successfully simplify 70% of the complex sentences written for video game design application. In comparison, a single-agent approach attained a 48% success rate on the same task.

Related papers

• Grammar-Guided Evolutionary Search for Discrete Prompt Optimisation [63.97051732013936]
  We propose an evolutionary search approach to automated discrete prompt optimisation consisting of two phases.<n>In the first phase, grammar-guided genetic programming is invoked to synthesise prompt-creating programmes.<n>In the second phase, local search is applied to explore the neighbourhoods of best-performing programmes.
  arXiv  Detail & Related papers  (2025-07-14T14:34:15Z)
• Multi-LLM Collaborative Search for Complex Problem Solving [54.194370845153784]
  We propose the Mixture-of-Search-Agents (MoSA) paradigm to enhance search-based reasoning.<n>MoSA integrates diverse reasoning pathways by combining independent exploration with iterative refinement among LLMs.<n>Using Monte Carlo Tree Search (MCTS) as a backbone, MoSA enables multiple agents to propose and aggregate reasoning steps, resulting in improved accuracy.
  arXiv  Detail & Related papers  (2025-02-26T06:31:04Z)
• Progressive Document-level Text Simplification via Large Language Models [19.57555397986868]
  Long document-level simplification (DS) is still relatively unexplored.<n>We propose a progressive simplification method (ProgDS) by hierarchically decomposing the task.
  arXiv  Detail & Related papers  (2025-01-07T15:14:37Z)
• Refining Answer Distributions for Improved Large Language Model Reasoning [24.67507932821155]
  We present Refined Answer Distributions, a novel and principled algorithmic framework to enhance the reasoning capabilities of Large Language Models (LLMs)<n>Our approach can be viewed as an iterative sampling strategy for forming a Monte Carlo approximation of an underlying distribution of answers, with the goal of identifying the mode -- the most likely answer.
  arXiv  Detail & Related papers  (2024-12-17T19:45:53Z)
• Make Compound Sentences Simple to Analyze: Learning to Split Sentences for Aspect-based Sentiment Analysis [9.614424658292277]
  We propose Aspect Term Oriented Sentence Splitter (ATOSS), which simplifies compound sentence into simpler and clearer forms. As a plug-and-play module, this approach retains the parameters of the ABSA model while making it easier to identify essential intent within input sentences.
  arXiv  Detail & Related papers  (2024-10-03T08:27:59Z)
• Textualized Agent-Style Reasoning for Complex Tasks by Multiple Round LLM Generation [49.27250832754313]
  We present AgentCOT, a llm-based autonomous agent framework. At each step, AgentCOT selects an action and executes it to yield an intermediate result with supporting evidence. We introduce two new strategies to enhance the performance of AgentCOT.
  arXiv  Detail & Related papers  (2024-09-19T02:20:06Z)
• Self-Explanation Prompting Improves Dialogue Understanding in Large Language Models [52.24756457516834]
  We propose a novel "Self-Explanation" prompting strategy to enhance the comprehension abilities of Large Language Models (LLMs) This task-agnostic approach requires the model to analyze each dialogue utterance before task execution, thereby improving performance across various dialogue-centric tasks. Experimental results from six benchmark datasets confirm that our method consistently outperforms other zero-shot prompts and matches or exceeds the efficacy of few-shot prompts.
  arXiv  Detail & Related papers  (2023-09-22T15:41:34Z)
• Enhancing Coherence of Extractive Summarization with Multitask Learning [40.349019691412465]
  This study proposes a multitask learning architecture for extractive summarization with coherence boosting. The architecture contains an extractive summarizer and coherent discriminator module. Experiments show that our proposed method significantly improves the proportion of consecutive sentences in the extracted summaries.
  arXiv  Detail & Related papers  (2023-05-22T09:20:58Z)
• A Simple and Plug-and-play Method for Unsupervised Sentence Representation Enhancement [35.6803390044542]
  RepAL is an extremely simple post-processing method that enhances sentence representations. We show that RepAL is free of training and is a plug-and-play method that can be combined with most existing unsupervised sentence learning models.
  arXiv  Detail & Related papers  (2023-05-13T02:43:59Z)
• Alleviating Over-smoothing for Unsupervised Sentence Representation [96.19497378628594]
  We present a Simple method named Self-Contrastive Learning (SSCL) to alleviate this issue. Our proposed method is quite simple and can be easily extended to various state-of-the-art models for performance boosting.
  arXiv  Detail & Related papers  (2023-05-09T11:00:02Z)
• Sentence Simplification via Large Language Models [15.07021692249856]
  Sentence Simplification aims to rephrase complex sentences into simpler sentences while retaining original meaning. Large Language models (LLMs) have demonstrated the ability to perform a variety of natural language processing tasks.
  arXiv  Detail & Related papers  (2023-02-23T12:11:58Z)
• Lexical Complexity Controlled Sentence Generation [6.298911438929862]
  We introduce a novel task of lexical complexity controlled sentence generation. It has enormous potential in domains such as grade reading, language teaching and acquisition. We propose a simple but effective approach for this task based on complexity embedding.
  arXiv  Detail & Related papers  (2022-11-26T11:03:56Z)
• Complexity-Based Prompting for Multi-Step Reasoning [72.0057198610614]
  We study the task of prompting large-scale language models to perform multi-step reasoning. A central question is which reasoning examples make the most effective prompts. We propose complexity-based prompting, a simple and effective example selection scheme for multi-step reasoning.
  arXiv  Detail & Related papers  (2022-10-03T05:33:27Z)
• Learning to Ask Conversational Questions by Optimizing Levenshtein Distance [83.53855889592734]
  We introduce a Reinforcement Iterative Sequence Editing (RISE) framework that optimize the minimum Levenshtein distance (MLD) through explicit editing actions. RISE is able to pay attention to tokens that are related to conversational characteristics. Experimental results on two benchmark datasets show that RISE significantly outperforms state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-06-30T08:44:19Z)
• Fact-aware Sentence Split and Rephrase with Permutation Invariant Training [93.66323661321113]
  Sentence Split and Rephrase aims to break down a complex sentence into several simple sentences with its meaning preserved. Previous studies tend to address the issue by seq2seq learning from parallel sentence pairs. We introduce Permutation Training to verifies the effects of order variance in seq2seq learning for this task.
  arXiv  Detail & Related papers  (2020-01-16T07:30:19Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.