Domain Filter Using N-gram Distance for Trademark Infringement Detection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for identifying potential trademark infringers on the Internet are inefficient due to the vast number of domains, requiring significant time and computational power to process and analyze hundreds of millions of domain names, with no effective first-pass domain filters available.
Innovation Solution
A novel domain processing system that uses n-gram distance to filter down candidate domains against seed domains by comparing character strings, calculating the difference in n-grams to identify closely related domains, and applying a threshold to reduce the number of domains for further processing, thereby reducing computational costs and time.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If traditional methods (e.g., Levenshtein distance) are used to compare all candidate domains against seed domains, then measurement precision for identifying trademark infringers is improved, but productivity and processing speed deteriorate due to the enormous computational requirements
Solution Approach 1:
The patent segments the domain name comparison process into multiple stages: first applying a fast n-gram filter to divide the candidate domain set into filtered and non-filtered groups, then applying more precise but computationally intensive methods only to the filtered subset. This segmentation resolves the contradiction by maintaining measurement precision where needed while improving overall productivity through the preliminary filtering stage.
Solution Approach 2:
The patent performs preliminary filtering using n-gram distance calculation before applying more accurate but slower methods like Levenshtein distance. By pre-processing the candidate domains and eliminating obvious non-matches early, the system maintains the ability to accurately identify infringers while significantly reducing the computational burden and processing time.
2Measurement precision
If all hundreds of millions of domains on the Internet are processed to identify potential trademark infringers, then measurement precision is improved, but loss of time and computational resources increases significantly
Solution Approach 1:
The patent applies partial action by using the n-gram filter to process all candidate domains quickly, then applying more rigorous analysis only to the subset that passes the filter. This approach achieves sufficient measurement precision for identifying infringers while avoiding the excessive time and computational resource loss that would result from analyzing all hundreds of millions of domains with equally intensive methods.
Solution Approach 2:
The n-gram filter serves as an intermediary between the initial candidate domain set and the final infringement detection analysis. It provides a computationally efficient first pass that maintains reasonable measurement precision while dramatically reducing the number of domains requiring further analysis, thus resolving the contradiction between completeness of detection and loss of time/resources.
3Measurement precision
If no first-pass domain filter is applied, then measurement precision for identifying infringers is maintained, but device complexity and computational requirements increase
Solution Approach 1:
The patent segments the domain filtering system into a simple first-pass n-gram filter and a second-pass analysis stage. This segmentation maintains measurement precision by preserving the option to apply more complex analysis where needed, while reducing overall device complexity by eliminating the need to apply complex methods to all candidate domains.
Solution Approach 2:
The n-gram filter acts as a disposable, computationally inexpensive first-pass filter that quickly eliminates non-promising candidates. This cheap filtering layer maintains measurement precision for the final results while reducing device complexity and computational requirements by preventing unnecessary processing of irrelevant domains.
Data Source
AI summary
Disclosed is a domain filter capable of determining an n-gram distance between a seed domain and each of a plurality of candidate domains. The domain filter loads a seed domain n-gram for the seed domain and a candidate domain n-gram for each candidate domain in memory, compares the seed domain n-gram and the candidate domain n-gram to identify any identical grams, removes any identical grams from the seed domain n-gram, and determines how many grams are left in the seed domain n-gram, representing the n-gram distance between the seed domain and the candidate domain. The domain filter then compares n-gram distances thus determined with a predetermined threshold, eliminates any candidate domain having an n-gram distance from the seed domain that exceeds the predetermined threshold, and provides remaining candidate domains to a downstream computing facility such as a user interface or an analytical module operating in an enterprise computing environment.