11. A computer-implemented method, comprising: accessing an input string; determining that the input string includes a top-level domain suffix; stripping the top-level domain suffix from the input string to create a modified input string; generating a Universal character set transformation format (UTF)-encoded input string from the modified input string; generating, via an n-gram parser, a plurality of input string n-grams from the UTF-encoded input string, a length of each of the input string n-grams being larger than a lower bound and smaller than an upper bound; providing the plurality of input string n-grams to compare with a plurality of domain string n-grams; generating a relevance score for an identified match between one of the plurality of input strings n-grams and one of the plurality of domain string n-grams, wherein the relevance score is based on a number of input string n-grams from the plurality of input string n-grams that match the plurality of domain string n-grams; receiving an indication of a matched domain name determined based on the relevance score; and providing the matched domain name and one or more variants of the matched domain name that include one or more graphemes that are different from one or more graphemes in the matched domain name.
12. The method of claim 11 , wherein the upper bound is the length of the input string.