Patent Document ID: 10140282
Application ID: 14242190

Base Claim:
1. A computer-implemented method, comprising: accessing a first input string that includes a keyword to be compared; generating a Universal character set transformation format (UTF)-encoded input string from the first input string; parsing the UTF-encoded input string via an n-gram parser to generate a plurality of input string n-grams; accessing a second input string that includes a domain to be compared; determining that the second input string includes a top-level domain suffix; stripping the top-level domain suffix from the second input string to create a modified second input string; generating a UTF-encoded domain string from the modified second 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 first input string that includes the keyword and the second 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; generating a relevance score for the identified match, wherein the relevance score is based on a first input string n-gram from the plurality of input string n-grams that match the plurality of domain string n-grams; and returning the second input string that includes a domain based on determining that the relevance score meets a threshold value and one or more variants of the domain that include one or more graphemes that are different from one or more graphemes in the domain.

---

Claim 4:
4. The computer-implemented method of claim 1 , wherein parsing the UTF-encoded input string via an n-gram parser includes: splitting the UTF-encoded input string into a plurality of n-grams having a length between an upper bound and a lower bound.