We use the Levenshtein Distance Algorithm with a maximum of 2 edits. The Levenshtein distance between two words is the minimum number of single-character edits (insertions, deletions or substitutions) required to change one word into the other.

For example, the Levenshtein distance between "kitten" and "sitting" is 3, since the following three edits change one into the other, and there is no way to do it with fewer than three edits:

- kitten → sitten (substitution of "s" for "k")
- sitten → sittin (substitution of "i" for "e")
- sittin → sitting (insertion of "g" at the end)

Within Openprise, you can control the minimum length of a string to be matched. The default is 3 characters meaning that any string of 2 or fewer characters will not use fuzzy matching.

You can also set a value for matching:

- Low = 1 single-character difference
- High = 2 character difference
- Auto=1 or 2 character difference depending on the length of the string.