While dealing with the “Fuzzy Match” plugin with the default algorithm, how is measure value decided?
Hi Pradnya,
Levenshtein algorithm calculate the distance between two strings by looking at how many edit steps are needed to get from one string to another.
It looks at inserts, deletes, and replacements. The score indicates the minimum number of changes needed.
For instance, the difference between John and Jan would be two; to turn the name John into Jan you need one step to replace the ‘O’ with an ‘A’ , and another step to delete the ‘H’ .
You can get more details on below link:
“https://en.wikipedia.org/wiki/Levenshtein_distance”
