A plurality of input string n-grams may be generated by accessing an input string and generating a Universal character set transformation format (UTF) encoded input string from the input string. The UTF encoded input string may be parsed via an n-gram parser to generate a plurality of input string n-grams, where a length of each of the input string n-grams is larger than a lower bound and smaller than an upper bound. The generated plurality of input string n-grams may be provided to determine matches between the input string and a domain.