String compare demo
the Levenshtein distance is a string metric for measuring the difference between two sequences. Informally, 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. It is named after the Soviet mathematician Vladimir Levenshtein, who considered this distance in 1965.
Value
Distance
abcd efgh
0
abcd  efgh
0.04
abcd zz efgh
0.12
abcd,efgh
0.2
zzz abcd kkk efgh lll
0.48
qqq abcd rrr sss efgh ttt
0.64
abcds efghs
0.72
efgh abcd
1.6
abcdefgh
1.76
acbd efgh
2
AbcD EFgh
4
zzz abcd zzzz
4.16
Silk UI Framework Simulation Device
Resize the window to preview the page in target devices.
Open the settings to change the simulation device options.
Click here to see your activities