4. The method of claim 1 wherein a clique comprises a set of candidate entities for the article, the set of candidate entities interconnected by links between the set of candidate entities, the clique being ranked based on a score for each candidate entity of the set of candidate entities and a number of candidates in the set of candidates.
1. A computer implemented method of disambiguating a string from an article comprising: at an electronic device including one or more hardware processing units, accessing a disambiguation database comprising a plurality of string-entity combinations and associated metrics for each of the plurality of string-entity combinations, the associated metrics including at least one metric associated with an arrival probability of linking at a web page for a particular entity of a particular string-entity combination after a specified number of links, wherein the arrival probability is a sum of a link probability for each hyperlink in a chain of hyperlinks between a starting page and the web page for the particular entity, wherein a length of the chain of hyperlinks is less than or equal to the specified number of links; analyzing an article to identify one or more strings in the article that are associated with at least one of the plurality of string-entity combinations, wherein each entity of the at least one of the plurality of string-entity combinations is a candidate entity for the identified one or more strings in the article; generating a clique graph for each candidate entity of the article, the clique graph including a plurality of cliques; and generating a probability that a particular candidate entity corresponds to a particular string associated with the particular candidate entity as a function of one or more score attributes generated from the clique graph and the arrival probability of linking at the web page for the particular entity after the specified number of links.