Two step algorithm for non-exact matching of large datasets
US11238053B2 · kind B2 · utility
0Cited by
72References
20Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | May 20, 2021 |
| Grant date | Feb 1, 2022 |
| Priority date | — |
| Expiry date | May 20, 2041 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F40/279
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A two-step algorithm for conducting near real-time fuzzy searches of a target on one or more large data sets is described. This algorithm includes the simplification of the data by removing grammatical constructs to bring the target search term (and the stored database) to their base elements and then perform a Levenstein comparison to create a subset of the data set that may be a match. Then performing a scoring algorithm while comparing the target to the subset of the data set to identify any matches.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.