|
Home
News
Citegeist
|
Browse Groups
Search Groups
Journals
|
FAQs
Howto
Discussion
|
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
Algorithms for scoring coreference chainsby: Amit Bagga, Breck Baldwin
In In The First International Conference on Language Resources and Evaluation Workshop on Linguistics Coreference (1998), pp. 563-566.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting HistoryNEW
AbstractScoring the performance of a system is an extremely important aspect of coreference algorithm performance. The score for a particular run is the single strongest measure of how well the system is performing and it can strongly determine directions for further improvements. In this paper, we present several different scoring algorithms and detail their respective strengths and weaknesses for varying classes of processing. We also demonstrate that tasks like information extraction have very different needs from information retrieval in terms of how to score the performance of coreference annotation.
BibTeX record
RIS record