Reaching for upper bound ROUGE score of extractive summarization methods.

Akhmetov I, Mussabayev R, Gelbukh A

Open source

DOI
10.7717/peerj-cs.1103
Published
2022
Container
PeerJ. Computer science
Publisher
Not recorded
Open access
yes

Credibility signals

uncertain Score 53/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.7717/peerj-cs.1103,
  title = {Reaching for upper bound ROUGE score of extractive summarization methods.},
  author = {Akhmetov I and Mussabayev R and Gelbukh A},
  year = {2022},
  journal = {PeerJ. Computer science},
  doi = {10.7717/peerj-cs.1103},
  url = {https://doi.org/10.7717/peerj-cs.1103}
}

RIS

TY  - JOUR
TI  - Reaching for upper bound ROUGE score of extractive summarization methods.
AU  - Akhmetov I
AU  - Mussabayev R
AU  - Gelbukh A
PY  - 2022
JO  - PeerJ. Computer science
DO  - 10.7717/peerj-cs.1103
UR  - https://doi.org/10.7717/peerj-cs.1103
ER  - 

APA

I, A., R, M., & A, G. (2022). Reaching for upper bound ROUGE score of extractive summarization methods.. PeerJ. Computer science. https://doi.org/10.7717/peerj-cs.1103

Source records