z-logo
open-access-imgOpen Access
Reaching for upper bound ROUGE score of extractive summarization methods
Author(s) -
Iskander Akhmetov,
Rustam Mussabayev,
Alexander Gelbukh
Publication year - 2022
Publication title -
peerj computer science
Language(s) - English
Resource type - Journals
ISSN - 2376-5992
DOI - 10.7717/peerj-cs.1103
Subject(s) - automatic summarization , rouge , greedy algorithm , computer science , genetic algorithm , salient , algorithm , set (abstract data type) , artificial intelligence , machine learning , mathematics , natural language processing , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom