INPUT STRING MATCHING FOR DOMAIN NAMES

摘要

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.

主权项

1. A computer-implemented method, comprising:
accessing an input string that includes a keyword to be compared; generating a Universal character set transformation format (UTF)-encoded input string from the input string; parsing the UTF-encoded input string via an n-gram parser to generate a plurality of input string n-grams; accessing an input string that includes a domain to be compared; generating a UTF-encoded domain string from the input string that includes the domain; parsing the UTF-encoded domain string to generate a plurality of domain string n-grams from the UTF-encoded domain string; comparing the plurality of input string n-grams to the plurality of domain string n-grams; identifying a match between the input string that includes the keyword and the input string that includes the domain based on the comparison of the plurality of input string n-grams to the plurality of domain string n-grams; and generating a relevance score for each of the identified matches.