Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/41323
DC Field | Value | |
---|---|---|
dc.title | Evaluating N-gram based evaluation metrics for automatic keyphrase extraction | |
dc.contributor.author | Kim, S.N. | |
dc.contributor.author | Baldwin, T. | |
dc.contributor.author | Kan, M.-Y. | |
dc.date.accessioned | 2013-07-04T08:24:49Z | |
dc.date.available | 2013-07-04T08:24:49Z | |
dc.date.issued | 2010 | |
dc.identifier.citation | Kim, S.N.,Baldwin, T.,Kan, M.-Y. (2010). Evaluating N-gram based evaluation metrics for automatic keyphrase extraction. Coling 2010 - 23rd International Conference on Computational Linguistics, Proceedings of the Conference 2 : 572-580. ScholarBank@NUS Repository. | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/41323 | |
dc.description.abstract | This paper describes a feasibility study of n-gram-based evaluation metrics for automatic key phrase extraction. To account for near-misses currently ignored by standard evaluation metrics, we adapt various evaluation metrics developed for machine translation and summarization, and also the R-precision evaluation metric from key phrase evaluation. In evaluation, the R-precision metric is found to achieve the highest correlation with human annotations. We also provide evidence that the degree of semantic similarity varies with the location of the partially-matching component words. | |
dc.source | Scopus | |
dc.type | Conference Paper | |
dc.contributor.department | COMPUTER SCIENCE | |
dc.description.sourcetitle | Coling 2010 - 23rd International Conference on Computational Linguistics, Proceedings of the Conference | |
dc.description.volume | 2 | |
dc.description.page | 572-580 | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.