English: Most Entity Linking algorithms are composed of a first Named Entity Recognition step in which Named Entities are found in the original text (here, Paris and France), and of a subsequent step in which each Named Entity is linked to its corresponding unique identifier (here, a Wikipedia page). This last step is often done by creating a small set of candidate identifiers for each Named Entity, and by picking the most promising candidate with respect to a chosen metric.