Natural Language Processing

dc.contributor.authorHABIBI, LEILA
dc.contributor.authorELMECHERFI, OMAR
dc.date.accessioned2022-03-16T08:14:15Z
dc.date.available2022-03-16T08:14:15Z
dc.date.issued2021
dc.description.abstractThe 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.identifier.urihttp://e-biblio.univ-mosta.dz/handle/123456789/20447
dc.language.isoenen_US
dc.relation.ispartofseriesMINF275;
dc.subjectevaluation summaryen_US
dc.subjectROUGE metricen_US
dc.subjectabstractive summaryen_US
dc.subjectNatural Language Processingen_US
dc.subjectExtractive summaryen_US
dc.subjectAutomatic Summarizationen_US
dc.subjectummaryen_US
dc.titleNatural Language Processingen_US
dc.typeOtheren_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
MINF275.pdf
Size:
2.44 MB
Format:
Adobe Portable Document Format
Description:
MINF275

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: