| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| randall (0) - 7 freq rendall (1) - 2 freq andalg (2) - 1 freq vandal (2) - 1 freq ragdoll (2) - 1 freq rainfall (2) - 304 freq randan (2) - 5 freq raifall (2) - 1 freq vandals (2) - 4 freq sandals (2) - 17 freq sandal (2) - 1 freq gandalf (2) - 1 freq candill (2) - 1 freq kendall (2) - 1 freq catall (3) - 1 freq handful (3) - 3 freq end-all (3) - 1 freq manually (3) - 2 freq rangle (3) - 2 freq randit (3) - 1 freq rascal (3) - 5 freq anawl (3) - 1 freq rentals (3) - 2 freq dall (3) - 8 freq fandan (3) - 7 freq |
randall (0) - 7 freq rendall (1) - 2 freq candill (3) - 1 freq rainfall (3) - 304 freq kendall (3) - 1 freq ragdoll (3) - 1 freq randomly (4) - 3 freq andalg (4) - 1 freq ranegill (4) - 1 freq mundell (4) - 2 freq rain'll (4) - 1 freq vandal (4) - 1 freq rnvll (4) - 1 freq raifall (4) - 1 freq randan (4) - 5 freq sandals (4) - 17 freq vandals (4) - 4 freq sandal (4) - 1 freq gandalf (4) - 1 freq ransel (5) - 1 freq an'll (5) - 2 freq raynal (5) - 1 freq rangil (5) - 1 freq ronda (5) - 1 freq man'll (5) - 6 freq |
SoundEx code - R534 rental - 9 freq roondhole - 1 freq rantletree - 3 freq roundelay - 1 freq rendall - 2 freq run-deil - 1 freq roundalays - 1 freq randall - 7 freq randolph - 1 freq remotely - 3 freq ryanheatly - 1 freq rentals - 2 freq randlestoon - 2 freq |
MetaPhone code - RNTL rental - 9 freq roundelay - 1 freq rendall - 2 freq run-deil - 1 freq randall - 7 freq |
RANDALL |
| Time to execute Levenshtein function - 0.234372 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.426091 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.029665 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.039751 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.000896 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |