A multi-feature difficulty score for NLP papers, computed via entropy weighting, exhibits an inverted-U relationship with citation-based academic impact.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Measuring Research Difficulty of Academic Papers: A Case Study in Natural Language Processing
A multi-feature difficulty score for NLP papers, computed via entropy weighting, exhibits an inverted-U relationship with citation-based academic impact.