11. A computer-implemented method comprising: identifying a character string in an alphanumeric format having no token delineating breaks and comprising one or more tokens in the alphanumeric format, wherein the identified character string is included in a plurality of previously received search requests; for each of the one or more tokens, parsing the identified character string into a first portion containing a first token and a second portion containing the remaining tokens; determining whether the first token is already included in a lexicon comprising an ontology of interrelated tokens and whether the first token occurs in the plurality of previously received search requests with at least a threshold frequency; based upon the determination of whether the first token is already included in the lexicon and the determination of whether the first token occurs in the plurality of previously received search results with at least the threshold frequency, identifying a second token that comprises a correct spelling of the first token, or an alternate spelling of the first token; and adding the first token to the lexicon with an association to the identified second token; receiving an alphanumeric string of characters comprising a domain name and having no token-delineating breaks; matching a portion of the received alphanumeric string of characters to the first token using the lexicon; and replacing the matched portion of the received alphanumeric string of characters with the identified second token contained in the lexicon.
11. A computer-implemented method comprising: identifying a character string in an alphanumeric format having no token delineating breaks and comprising one or more tokens in the alphanumeric format, wherein the identified character string is included in a plurality of previously received search requests; for each of the one or more tokens, parsing the identified character string into a first portion containing a first token and a second portion containing the remaining tokens; determining whether the first token is already included in a lexicon comprising an ontology of interrelated tokens and whether the first token occurs in the plurality of previously received search requests with at least a threshold frequency; based upon the determination of whether the first token is already included in the lexicon and the determination of whether the first token occurs in the plurality of previously received search results with at least the threshold frequency, identifying a second token that comprises a correct spelling of the first token, or an alternate spelling of the first token; and adding the first token to the lexicon with an association to the identified second token; receiving an alphanumeric string of characters comprising a domain name and having no token-delineating breaks; matching a portion of the received alphanumeric string of characters to the first token using the lexicon; and replacing the matched portion of the received alphanumeric string of characters with the identified second token contained in the lexicon. 14. The computer-implemented method of claim 11 , wherein the portion of the received alphanumeric string of characters is matched to the first token using the lexicon in response to a failed attempt to resolve the domain name.