Two step algorithm for non-exact matching of large datasets
US11042555B1 · kind B1 · utility
15Cited by
6References
20Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Jun 28, 2019 |
| Grant date | Jun 22, 2021 |
| Priority date | — |
| Expiry date | Mar 13, 2040 |
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.