arXiv:1501.01243
Un résumeur à base de graphes, indépéndant de la langue
원문 초록
In this paper we present REG, a graph-based approach for study a fundamental problem of Natural Language Processing (NLP): the automatic text summarization. The algorithm maps a document as a graph, then it computes the weight of their sentences. We have applied this approach to summarize documents in three languages.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
APE: Selective Fine-tuning with Acceptance Criteria for Language Model Adaptation
On-the-Fly Adaptive Distillation of Transformer to Dual-State Linear Attention
Improving large language models with concept-aware fine-tuning
Multimodal Survival Modeling in the Age of Foundation Models
A Split-then-Join Approach to Abstractive Summarization for Very Long Documents in a Low Resource Setting
ConTextual: Improving Clinical Text Summarization in LLMs with Context-preserving Token Filtering and Knowledge Graphs
토론
이 논문과 연결된 포럼 글이 아직 없습니다.