Matching online accounts with overlapping characteristics based on non-homogenous data types

A method for matching online registry accounts with overlapping characteristics based on non-homogenous data types featuring incomplete data and a temporal element, the method comprising:

• receiving a first plurality of values for a first account, wherein the first plurality of values corresponds to respective data types;
• receiving a second plurality of values for a second account, wherein the second plurality of values corresponds to the respective data types;
• determining a first value of the first plurality of values that corresponds to a first respective data type of the respective data types, wherein the first respective data type corresponds to an event date;
• determining an event date window based on the first value, wherein the event date window is a range of dates surrounding an event date;
• and;
• determining a similarity likelihood based on a comparison of the first plurality of values and the second plurality of values using a matching algorithm, wherein the matching algorithm modifies weights for matches detected between the respective data types of the first plurality of values and the second plurality of values based on comparing the event date window of the first account to another event date window of the second account, wherein the matching algorithm comprises an n-gram parser, and wherein determining the similarity likelihood based on the comparison of the first plurality of values and the second plurality of values using the matching algorithm, comprises:
• determining a first string of n-grams based on the first plurality of values;
• determining a second string of n-grams based on the second plurality of values;
• parsing the first string and the second string using the n-gram parser;
• determining a number of n-grams that match in the first string and the second string;
• dividing the number by a total number of n-grams in the first string and the second string to determine a point value;
• and
• determining the similarity likelihood based on the point value;
• determining a current date;
• determining a threshold similarity likelihood based on a proximity of the event date to the current date;
• comparing the similarity likelihood to the threshold similarity likelihood to determine whether to generate for display a match recommendation;
• and
• generating for display, on a user interface, the match recommendation based on the first account and the second account based on the similarity likelihood.

A non-transitory, computer-readable medium for matching online registry accounts with overlapping characteristics based on non-homogenous data types featuring incomplete data and a temporal element, comprising instructions that, when executed by one or more processors, cause operations comprising:

• receiving a first plurality of values for a first account, wherein the first plurality of values corresponds to respective data types;
• receiving a second plurality of values for a second account, wherein the second plurality of values corresponds to the respective data types;
• determining a first value of the first plurality of values that corresponds to a first respective data type of the respective data types, wherein the first respective data type corresponds to an event date;
• determining an event date window based on the first value, wherein the event date window is a range of dates surrounding the event date;
• determining a similarity likelihood based on a comparison of the first plurality of values and the second plurality of values using a matching algorithm, wherein the matching algorithm modifies weights for matches detected between the respective data types of the first plurality of values and the second plurality of values based on comparing the event date window of the first account to another event date window of the second account, wherein the matching algorithm comprises an n-gram parser, and wherein determining the similarity likelihood based on the comparison of the first plurality of values and the second plurality of values using the matching algorithm, comprises:
• determining a first string of n-grams based on the first plurality of values;
• determining a second string of n-grams based on the second plurality of values;
• parsing the first string and the second string using the n-gram parser;
• determining a number of n-grams that match in the first string and the second string;
• dividing the number by a total number of n-grams in the first string and the second string to determine a point value;
• and
• determining the similarity likelihood based on the point value;
• determining a current date;
• determining a threshold similarity likelihood based on a proximity of the event date to the current date;
• comparing the similarity likelihood to the threshold similarity likelihood to determine whether to generate for display a match recommendation;
• and
• generating for display, on a user interface, the match recommendation based on the first account and the second account based on the similarity likelihood.