|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectedu.illinois.cs.cogcomp.lbj.coref.scorers.Scorer<ChainSolution<T>>
edu.illinois.cs.cogcomp.lbj.coref.scorers.ChainScorer<Mention>
edu.illinois.cs.cogcomp.lbj.coref.scorers.BCubedBase
edu.illinois.cs.cogcomp.lbj.coref.scorers.BCubedUniformPerMentionBase
public abstract class BCubedUniformPerMentionBase
Base class for scorers that compute the B-Cubed F-Score for a collection of documents, giving equal weight to each mention. See (Amit) Bagga and Baldwin (MUC-7 1998).
| Constructor Summary | |
|---|---|
protected |
BCubedUniformPerMentionBase()
Default constructor. |
| Method Summary | |
|---|---|
abstract double |
getPrecision(java.util.List<ChainSolution<Mention>> keys,
java.util.List<ChainSolution<Mention>> preds)
Computes the B-Cubed precision for a collection of documents. |
abstract double |
getRecall(java.util.List<ChainSolution<Mention>> keys,
java.util.List<ChainSolution<Mention>> preds)
Computes the B-Cubed recall for a collection of documents. |
abstract Score |
getScore(java.util.List<ChainSolution<Mention>> keys,
java.util.List<ChainSolution<Mention>> preds)
Computes the B-Cubed F-Score for a collection of documents. |
| Methods inherited from class edu.illinois.cs.cogcomp.lbj.coref.scorers.BCubedBase |
|---|
getPartition, getPrecision, getRecall, getScore, haveSameMembers |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
protected BCubedUniformPerMentionBase()
| Method Detail |
|---|
public abstract Score getScore(java.util.List<ChainSolution<Mention>> keys,
java.util.List<ChainSolution<Mention>> preds)
The precision of a collection of documents is the average of the precisions of all mentions in all documents. The precision of a mention m is calculated as the number of mentions correctly predicted to be in the same cluster as m (including m) divided by the number of mentions in the predicted cluster containing m.
The recall of a collection of documents is the average of the recalls of all mentions in all documents. The recall of a mention m is calculated as the number of mentions correctly predicted to be in the same cluster as m (including m) divided by the number of mentions in the true cluster containing m.
The B-Cubed F-Score is the harmonic mean of the precision and recall defined above. This B-Cubed F-Score is weighted so that every mention's precision and recall gets equal weight.
getScore in class BCubedBasekeys - A collection of true (gold standard) solutions
(for example, one per document)preds - A collection of predicted solutions
(for example, one per document)
public abstract double getPrecision(java.util.List<ChainSolution<Mention>> keys,
java.util.List<ChainSolution<Mention>> preds)
getPrecision in class BCubedBasekeys - A collection of true (gold standard) solutions
(for example, one per document)preds - A collection of predicted solutions
(for example, one per document)
public abstract double getRecall(java.util.List<ChainSolution<Mention>> keys,
java.util.List<ChainSolution<Mention>> preds)
getRecall in class BCubedBasekeys - A collection of true (gold standard) solutions
(for example, one per document)preds - A collection of predicted solutions
(for example, one per document)
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||