مقایسهٔ روش‌ها

	خلاصه‌سازی متن	خوشه‌بندی اسناد	استخراج کلیدواژه
حوزه	متن‌کاوی	متن‌کاوی	متن‌کاوی
خانواده	Process / pipeline	Process / pipeline	Process / pipeline
سال پیدایش	—	—	—
پدیدآور	—	—	—
نوع	NLP text-generation / text-reduction task	Unsupervised text-mining task	NLP text-mining task
منبع بنیادین	Nenkova, A. & McKeown, K. (2011). Automatic Summarization. Foundations and Trends in Information Retrieval.	Aggarwal, C. C. & Zhai, C. (2012). Mining Text Data. Springer. ISBN: 9781461432227	Mihalcea, R. & Tarau, P. (2004). TextRank: Bringing Order into Texts. EMNLP, 404-411.
نام‌های دیگر	automatic summarization, extractive summarization, abstractive summarization, Otomatik Metin Özetleme	text clustering, unsupervised text grouping, Belge Kümeleme (Document Clustering)	keyphrase extraction, key term extraction, Anahtar Kelime Çıkarma (Keyword Extraction)
مرتبط	4	4	4
خلاصه	Automatic text summarization is a natural-language-processing task that condenses long documents into shorter summaries while preserving their key information. It works through one of two families of approaches — extractive summarization, which selects the most important spans from the source, or abstractive summarization, which generates new text. The field was consolidated by Nenkova and McKeown (2011), and sequence-to-sequence models such as BART (Lewis et al., 2020) advanced the abstractive side.	Document clustering is an unsupervised text-mining task that groups documents with similar content together without using any labels. It is used to organise large collections and for exploratory analysis, drawing on the body of text-mining techniques consolidated by Aggarwal and Zhai (2012) and compared empirically by Steinbach, Karypis and Kumar (2000).	Keyword extraction is a natural-language-processing task that automatically identifies the words or phrases that best represent the content of a document. It turns a body of free text into a compact, ranked list of key terms, drawing on statistical, graph-based methods such as TextRank (Mihalcea & Tarau, 2004), or embedding-based methods such as KeyBERT (Grootendorst, 2020).