Home | Trees | Indices | Help |
|
---|
|
Utility functions for evaluating processing modules.
|
|||
ConfusionMatrix The confusion matrix between a list of reference values and a corresponding list of test values. |
|
|||
|
|||
float or None
|
|
||
float or None
|
|
||
float or None
|
|
||
|
|||
tuple
|
|
||
int
|
|
||
|
|||
|
|||
|
|||
|
|
|||
betai = None
|
|
Given a list of reference values and a corresponding list of test
values, return the percentage of corresponding values that are equal. In
particular, return the percentage of indices
|
Given a set of reference values and a set of test values, return the
percentage of test values that appear in the reference set. In
particular, return
|
|
Given a set of reference values and a set of test values, return the
percentage of reference values that appear in the test set. In
particular, return
|
|
Given a set of reference values and a set of test values, return the
f-measure of the test values, when compared against the reference values.
The f-measure is the harmonic mean of the precision and
recall,
weighted by
The f-measure is:
If either
|
Given a list of reference values and a corresponding list of test probability distributions, return the average log likelihood of the reference values, given the probability distributions.
|
Returns an approximate significance level between two lists of independently generated test values. Approximate randomization calculates significance by randomly drawing from a sample of the possible permutations. At the limit of the number of possible permutations, the significance level is exact. The approximate significance level is the sample mean number of times the statistic of the permutated lists varies from the actual statistic of the unpermuted argument lists.
|
Compute the windowdiff score for a pair of segmentations. A segmentation is any sequence over a vocabulary of two items (e.g. "0", "1"), where the specified boundary value is used to mark the edge of a segmentation.
|
Calculate the Levenshtein edit-distance between two strings. The edit distance is the number of characters that need to be substituted, inserted, or deleted, to transform s1 into s2. For example, transforming "rain" to "shine" requires three steps, consisting of two substitutions and one insertion: "rain" -> "sain" -> "shin" -> "shine". These operations could have been done in other orders, but at least three steps are needed.
|
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0beta1 on Wed Aug 27 15:08:50 2008 | http://epydoc.sourceforge.net |