Beyond Supervised Clarification: Input Rewriting with LLMs for Dialogue Discourse Parsing

arXiv cs.CL Papers

Summary

This paper investigates using LLMs to rewrite fragmentary dialogue utterances for improving frozen discourse parsers, finding that zero-shot clarification is unreliable and that error repair through rewriting has a practical ceiling, suggesting rewritability prediction as a key missing capability.

arXiv:2607.01964v1 Announce Type: new Abstract: Rewriting inputs to improve frozen downstream models has become a common strategy in modern NLP pipelines. Prior work on incremental dialogue discourse parsing (DDP) shows that supervised clarification models can rewrite fragmentary or underspecified utterances, such as resolving ellipsis or references, to improve parsing accuracy. In this work, we revisit this idea under realistic deployment conditions, where no clarification supervision is available and the clarifier must rely on zero-shot prompting or feedback from a frozen parser. Across three Segmented Discourse Representation Theory (SDRT) datasets and multiple parsers, we find that last-utterance clarification is far less reliable than suggested by supervised settings. Parser-agnostic rewriting often introduces more regressions than repairs, as edits that enable fixes also disrupt discourse cues relied upon by the parser. A best-of-8 rewriting analysis further reveals a practical ceiling: a large fraction of errors are not repairable through input rewriting alone. A parser-aware clarifier trained with GRPO reduces regressions by up to 37% by learning conservative abstention, yet still fails to produce selectivity-aware clarifications that consistently improve parsing. Together, these findings recast clarification as a selective intervention problem. We identify rewritability prediction, deciding whether an utterance is repairable before intervention, as the key missing capability for input-side optimization of frozen discourse parsers, and a critical direction for improving agentic pipelines more broadly.
Original Article
View Cached Full Text

Cached at: 07/03/26, 05:41 AM

# Beyond Supervised Clarification: Input Rewriting with LLMs for Dialogue Discourse Parsing
Source: [https://arxiv.org/abs/2607.01964](https://arxiv.org/abs/2607.01964)
[View PDF](https://arxiv.org/pdf/2607.01964)

> Abstract:Rewriting inputs to improve frozen downstream models has become a common strategy in modern NLP pipelines\. Prior work on incremental dialogue discourse parsing \(DDP\) shows that supervised clarification models can rewrite fragmentary or underspecified utterances, such as resolving ellipsis or references, to improve parsing accuracy\. In this work, we revisit this idea under realistic deployment conditions, where no clarification supervision is available and the clarifier must rely on zero\-shot prompting or feedback from a frozen parser\. Across three Segmented Discourse Representation Theory \(SDRT\) datasets and multiple parsers, we find that last\-utterance clarification is far less reliable than suggested by supervised settings\. Parser\-agnostic rewriting often introduces more regressions than repairs, as edits that enable fixes also disrupt discourse cues relied upon by the parser\. A best\-of\-8 rewriting analysis further reveals a practical ceiling: a large fraction of errors are not repairable through input rewriting alone\. A parser\-aware clarifier trained with GRPO reduces regressions by up to 37% by learning conservative abstention, yet still fails to produce selectivity\-aware clarifications that consistently improve parsing\. Together, these findings recast clarification as a selective intervention problem\. We identify rewritability prediction, deciding whether an utterance is repairable before intervention, as the key missing capability for input\-side optimization of frozen discourse parsers, and a critical direction for improving agentic pipelines more broadly\.

## Submission history

From: Yiming Liu \[[view email](https://arxiv.org/show-email/8fe5fce7/2607.01964)\] **\[v1\]**Thu, 2 Jul 2026 09:57:52 UTC \(428 KB\)

Similar Articles

Uncertainty Decomposition for Clarification Seeking in LLM Agents

arXiv cs.AI

This paper proposes a prompt-based uncertainty decomposition method for LLM agents that separates action confidence from request uncertainty, enabling proactive clarification seeking in underspecified tasks. The method is evaluated on new clarification-augmented benchmarks across five LLM backbones, showing significant improvements.

Learning to Refine Hidden States for Reliable LLM Reasoning

arXiv cs.LG

Proposes ReLAR, a reinforcement-guided latent refinement framework that iteratively updates hidden representations in LLMs before decoding, improving reasoning reliability and efficiency compared to chain-of-thought methods.