用大模型自动构建论点结构图,帮人理清文本中的论证关系。
An LLM-Based System for Argument Mining

- 分多阶段提取论点、前提和逻辑关系,生成有向无环图。
- 在教材数据上人工评估准确率良好,跨数据集表现稳定。
- 适合需要自动化分析复杂论证的法律、学术研究场景。
论点是人类推理的核心,涉及主张的支撑、反驳与权衡。我们提出一个基于大语言模型(LLM)的端到端系统,可将自然语言文本重构为抽象论点图。该系统采用多阶段流水线,逐步识别论点成分、筛选相关元素并揭示其逻辑关系。这些成分以有向无环图表示,包含两类节点(前提、结论)和三类关系(支持、攻击、削弱)。我们通过两项互补实验评估系统:一是对论据理论教科书中的论点进行人工评估,检验其恢复论点结构的能力;二是对基准数据集进行定量评估,通过映射至标准标注体系与已有方法对比。结果表明,系统能有效恢复论点结构,且在适配不同标注体系时,在多个基准数据集上均达到合理性能。这凸显了基于大模型的流水线在可扩展论点挖掘中的潜力。
原文摘要 · Abstract (English)
Arguments are a fundamental aspect of human reasoning, in which claims are supported, challenged, and weighed against one another. We present an end-to-end large language model (LLM)-based system for reconstructing arguments from natural language text into abstract argument graphs. The system follows a multi-stage pipeline that progressively identifies argumentative components, selects relevant elements, and uncovers their logical relations. These elements are represented as directed acyclic graphs consisting of two component types (premises and conclusions) and three relation types (support, attack, and undercut). We conduct two complementary experiments to evaluate the system. First, we perform a manual evaluation on arguments drawn from an argumentation theory textbook to assess the system's ability to recover argumentative structure. Second, we conduct a quantitative evaluation on benchmark datasets, allowing comparison with prior work by mapping our outputs to established annotation schemes. Results show that the system can adequately recover argumentative structures and, when adapted to different annotation schemes, achieve reasonable performance across benchmark datasets. These findings highlight the potential of LLM-based pipelines for scalable argument mining.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。