Approximate string matcher for delimited strings
US6718325B1 · kind B1 · utility
25Cited by
13References
13Claims
0Family size
Assignee
Inventor
Key dates
| Filing date | Jun 14, 2000 |
| Grant date | Apr 6, 2004 |
| Priority date | — |
| Expiry date | Nov 16, 2021 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99936
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method for comparing two delimited strings, each of which has a plurality of substrings, includes pairing each substring in one of the delimited string with a corresponding substring in the other one of the delimited strings. The method further includes computing a proximity value for each pair of substrings, and computing a set of decaying weights corresponding to the pairs of substrings, multiplying the proximity value for each pair of substrings by the corresponding weight, and summing the weighted proximity values to obtain a strength of match between the delimited strings.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.