Natural language processing is an important discipline with the aim of understanding text by its digital representation, that due to the diverse way we write and speak, is often not accurate enough. Our paper explores different graph-related algorithms that can be used in solving the text summarization problem using an extractive approach. We consider two metrics: sentence overlap and edit distance for measuring sentence similarity.
@article{arxiv.2106.10955,
title = {Extractive approach for text summarisation using graphs},
author = {Kastriot Kadriu and Milenko Obradovic},
journal= {arXiv preprint arXiv:2106.10955},
year = {2021}
}