Identifying non-exactly matching text
US11163955B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Nov 2, 2020 |
| Grant date | Nov 2, 2021 |
| Priority date | — |
| Expiry date | Nov 2, 2040 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F40/295
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A computer-implemented method for matching user inputted text to stored text. The user inputted text is compared to each of the text strings stored in a database using a string similarity score determined using a Levenshtein distance algorithm, the n-gram or trigram methods, the Jaro-Winkler algorithm, the Cosine similarity algorithm, the Hamming distance algorithm, the Damerau-Levenshtein distance algorithm, or similar. For each comparison, the string similarity score is analyzed to determine exact matches, non-matches, and probable matches. Probable matches are further analyzed using a keyboard distance algorithm to differentiate between matches and non-matches.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.