| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rpnldf (0) - 1 freq pdf (3) - 37 freq pelf (3) - 6 freq rdf (3) - 3 freq ldf (3) - 1 freq rend (3) - 2 freq dnlf (3) - 1 freq puld (3) - 6 freq randy (3) - 15 freq plldo (3) - 1 freq ronaldh (3) - 1 freq ronald (3) - 49 freq rund (3) - 2 freq rtnf (3) - 1 freq jnlf (3) - 1 freq rnzuf (3) - 1 freq rbnf (3) - 1 freq ruld (3) - 1 freq rinds (3) - 1 freq pnd (3) - 1 freq ronaldo (3) - 2 freq roald (3) - 8 freq rolf (3) - 1 freq palf (3) - 1 freq runoff (3) - 1 freq |
rpnldf (0) - 1 freq ronaldo (5) - 2 freq ronaldh (5) - 1 freq ronald (5) - 49 freq rnnd (6) - 1 freq rgnl (6) - 1 freq ronda (6) - 1 freq roald (6) - 8 freq rolf (6) - 1 freq palf (6) - 1 freq runoff (6) - 1 freq rand (6) - 2 freq rippled (6) - 1 freq panloaf (6) - 1 freq arnold (6) - 6 freq arnaldo (6) - 2 freq repond (6) - 1 freq rippuld (6) - 1 freq reponed (6) - 60 freq ripened (6) - 2 freq reynolds (6) - 4 freq pdf (6) - 37 freq ldf (6) - 1 freq rend (6) - 2 freq pnd (6) - 1 freq |
SoundEx code - R154 robin'il - 1 freq rpnldf - 1 freq |
MetaPhone code - RPNLTF rpnldf - 1 freq |
RPNLDF |
| Time to execute Levenshtein function - 0.514370 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.972374 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.038021 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.093539 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.001118 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. |