Afficher la notice abrégée

dc.contributor.author HABIBI, LEILA
dc.contributor.author ELMECHERFI, OMAR
dc.date.accessioned 2022-03-16T08:14:15Z
dc.date.available 2022-03-16T08:14:15Z
dc.date.issued 2021
dc.identifier.uri http://e-biblio.univ-mosta.dz/handle/123456789/20447
dc.description.abstract The increasing availability of online information has triggered an intensive research in the area of automatic text summarization within the Natural Language Processing (NLP). The various methods to summarize one or more documents can be broadly classified into extractive and abstractive text summarization where the former involves selecting key parts in the document and embedding into the summary while balancing between salience and redundancy which this work mainly focused on. in this thesis a comparative analysis is proposed for five algorithms: LexRank, KLSum, Luhn, LSA and BERT. The experiments on the MultiLing 2013 show the best algorithms among the five proposed based on the parameters: F-Score, precision and recall in ROUGE-1, ROUGE-2 and ROUGE-L. After comparing the results obtained, we noticed that the BERT algorithm gives the best results in terms of precision and F-Score on all the metrics tested. On the other hand, in terms of recall, the LSA algorithm is considered to be better. en_US
dc.language.iso en en_US
dc.relation.ispartofseries MINF275;
dc.subject evaluation summary en_US
dc.subject ROUGE metric en_US
dc.subject abstractive summary en_US
dc.subject Natural Language Processing en_US
dc.subject Extractive summary en_US
dc.subject Automatic Summarization en_US
dc.subject ummary en_US
dc.title Natural Language Processing en_US
dc.type Other en_US


Fichier(s) constituant ce document

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée

Chercher dans le dépôt


Parcourir

Mon compte