USFD at KBP 2011: Entity Linking, Slot Filling and Temporal Bounding
Table 3: Performance of Nil Clustering
['[BOLD] Levenshtein distance', '[BOLD] RI', '[BOLD] Precision', '[BOLD] Recall', '[BOLD] F1']
2.1.4 Nil Clustering A simple clustering technique is applied. The Levenshtein distance is measured between the different mentions and if the distance is under a threshold α, the mentions are grouped into the same cluster. As shown clustering according to the string equality achieves better results than allowing a distance of one.