1. A computer-implemented method of identifying a set of textual identifiers comprising: maintaining a log of requests for a predetermined date range to resolve unresolvable textual identifiers in one or more domain name requests, wherein the log comprises geolocation information for each request in the log; identifying a set of unique unresolvable textual identifiers based on the log; determining a number of requests for each unique textual identifier in the log; creating a first association between each unique unresolvable textual identifier and one or more requests corresponding to each unique unresolvable textual identifier; creating one or more tokens for each of the unique unresolvable textual identifiers contained within the first association; creating a second association between the one or more tokens and each unique unresolvable textual identifier for which the one more tokens were created by inverting the first association, wherein the second association comprises the number of the requests and geolocation information corresponding to each request; and sorting the second association according to the number of the requests associated with each of the one or more tokens, wherein each of the unique unresolvable textual identifiers comprises a sequence of symbols, wherein each of the one or more tokens comprises an n-gram, and wherein the n-gram is a subsequence of n items from the sequence of symbols forming each of the unique unresolvable textual identifiers.
1. A computer-implemented method of identifying a set of textual identifiers comprising: maintaining a log of requests for a predetermined date range to resolve unresolvable textual identifiers in one or more domain name requests, wherein the log comprises geolocation information for each request in the log; identifying a set of unique unresolvable textual identifiers based on the log; determining a number of requests for each unique textual identifier in the log; creating a first association between each unique unresolvable textual identifier and one or more requests corresponding to each unique unresolvable textual identifier; creating one or more tokens for each of the unique unresolvable textual identifiers contained within the first association; creating a second association between the one or more tokens and each unique unresolvable textual identifier for which the one more tokens were created by inverting the first association, wherein the second association comprises the number of the requests and geolocation information corresponding to each request; and sorting the second association according to the number of the requests associated with each of the one or more tokens, wherein each of the unique unresolvable textual identifiers comprises a sequence of symbols, wherein each of the one or more tokens comprises an n-gram, and wherein the n-gram is a subsequence of n items from the sequence of symbols forming each of the unique unresolvable textual identifiers. 2. The computer-implemented method of claim 1 further comprising: receiving a plurality of the requests, each of the plurality of requests comprising a request to resolve an unresolvable textual identifier.