Home/ Questions/Q 4051488
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-20T14:12:04+00:00

I have: Correct numerical ID such as Phone number / Social-security number / etc.

  • 0

I have:

  1. Correct numerical ID such as Phone number / Social-security number / etc.
  2. Another number, from some data-entry form

The 2nd number is similar, but not equal to the 1st number.
Both numbers are valid.

I want to calculate how probable it is that the 2nd number is actually a typing error of the 1st number.

Such errors may include:

  • Off by a few digits
  • Transposed digits
  • Misinterpreted digits (1-7, 4-9, 3-8, 2-5)

Does anyone know about existance of such algorithm / code?

Edit:

I’m not looking for a general string-similarity algorithm. I’m looking for an algorithm optimized for human number-entry typing errors, or for some research about this topic.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    There are several algorithms to measure a string similarity.

    You could implement some variant of the Levenshtein distance or Damerau-Levenshtein distance that rates the types of errors differently.

    • 0