用拓扑分析让摘要保持逻辑连贯,兼顾效率与准确性
Text summarization via global structure awareness
- 通过语义加权图和持久同调识别核心语义结构
- 减少冗余同时保留语义与逻辑完整性,效率显著提升
- 适合长文本摘要,尤其利于下游大模型推理
文本摘要是自然语言处理中的基础任务,信息爆炸使得长文档处理愈发迫切。现有方法多关注模型优化与句级删减,常忽略全局结构,导致连贯性受损、下游性能下降。部分研究采用大语言模型(LLMs),虽准确率高但资源消耗大。为此,我们提出GloSA-sum,首个基于拓扑数据分析(TDA)实现全局结构感知的摘要方法。通过句子嵌入构建语义加权图,利用持久同调识别核心语义与逻辑结构,并存入“保护池”作为摘要骨干。设计拓扑引导的迭代策略,以轻量代理指标近似句重要性,避免重复高成本计算,兼顾结构完整与效率。为进一步提升长文本处理能力,提出分段级与全局级融合的层级策略。在多个数据集上的实验表明,GloSA-sum在降低冗余的同时保持语义与逻辑完整性,在准确率与效率间取得平衡,并通过缩短上下文保留关键推理链,有效助力LLM下游任务。
原文摘要 · Abstract (English)
Text summarization is a fundamental task in natural language processing (NLP), and the information explosion has made long-document processing increasingly demanding, making summarization essential. Existing research mainly focuses on model improvements and sentence-level pruning, but often overlooks global structure, leading to disrupted coherence and weakened downstream performance. Some studies employ large language models (LLMs), which achieve higher accuracy but incur substantial resource and time costs. To address these issues, we introduce GloSA-sum, the first summarization approach that achieves global structure awareness via topological data analysis (TDA). GloSA-sum summarizes text efficiently while preserving semantic cores and logical dependencies. Specifically, we construct a semantic-weighted graph from sentence embeddings, where persistent homology identifies core semantics and logical structures, preserved in a ``protection pool'' as the backbone for summarization. We design a topology-guided iterative strategy, where lightweight proxy metrics approximate sentence importance to avoid repeated high-cost computations, thus preserving structural integrity while improving efficiency. To further enhance long-text processing, we propose a hierarchical strategy that integrates segment-level and global summarization. Experiments on multiple datasets demonstrate that GloSA-sum reduces redundancy while preserving semantic and logical integrity, striking a balance between accuracy and efficiency, and further benefits LLM downstream tasks by shortening contexts while retaining essential reasoning chains.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。