| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| randolph (0) - 1 freq rudolph (2) - 2 freq randall (3) - 7 freq ralph (3) - 5 freq randomly (3) - 3 freq random (3) - 36 freq rannoch (3) - 9 freq ragdoll (3) - 1 freq mandolin (3) - 14 freq alph (4) - 1 freq vandal (4) - 1 freq andalg (4) - 1 freq andylaw (4) - 2 freq oantoap (4) - 1 freq craddol (4) - 1 freq landon (4) - 2 freq handel (4) - 1 freq sakdlpg (4) - 1 freq lando (4) - 1 freq candles (4) - 9 freq graddol (4) - 2 freq anyoch (4) - 25 freq rankled (4) - 1 freq candour (4) - 1 freq rancour (4) - 2 freq |
randolph (0) - 1 freq rudolph (3) - 2 freq ralph (5) - 5 freq arnolphe (5) - 1 freq randall (5) - 7 freq adelphi (6) - 1 freq ronaldh (6) - 1 freq sandiloch (6) - 1 freq raindrap (6) - 1 freq raindraps (6) - 4 freq raindroaps (6) - 2 freq ragdoll (6) - 1 freq mandolin (6) - 14 freq rannoch (6) - 9 freq rendall (6) - 2 freq randomly (6) - 3 freq random (6) - 36 freq rankles (7) - 2 freq rankle (7) - 3 freq mandela (7) - 2 freq handily (7) - 1 freq sandle (7) - 1 freq ranch (7) - 3 freq randie (7) - 8 freq sandals (7) - 17 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 - RNTLF randolph - 1 freq |
RANDOLPH |
| Time to execute Levenshtein function - 0.348478 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.538137 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.028480 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.045585 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.001233 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. |