| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| robmcd (0) - 8 freq robbed (2) - 16 freq jomcd (2) - 3 freq roamed (2) - 3 freq roald (3) - 8 freq doomed (3) - 21 freq boomed (3) - 8 freq oecd (3) - 1 freq riband (3) - 1 freq roamin (3) - 9 freq rock (3) - 194 freq rimed (3) - 1 freq soumed (3) - 3 freq rossmc (3) - 1 freq roch (3) - 124 freq lobbed (3) - 6 freq rsamd (3) - 2 freq room (3) - 1181 freq koomed (3) - 1 freq rotund (3) - 1 freq rooed (3) - 2 freq roed (3) - 1 freq rabid (3) - 4 freq jobbed (3) - 1 freq rocked (3) - 6 freq |
robmcd (0) - 8 freq jomcd (4) - 3 freq roamed (4) - 3 freq robbed (4) - 16 freq rhymed (5) - 8 freq rbm (5) - 4 freq romped (5) - 1 freq robocop (5) - 2 freq cifmcd (5) - 1 freq reamed (5) - 1 freq bmd (5) - 1 freq rbdd (5) - 1 freq rammed (5) - 9 freq bmc (5) - 7 freq robfmac (5) - 1 freq ribbed (5) - 2 freq rimmed (5) - 1 freq libpcd (5) - 3 freq rabid (5) - 4 freq rubbed (5) - 43 freq ramed (5) - 2 freq riband (5) - 1 freq rimed (5) - 1 freq rsamd (5) - 2 freq boomed (5) - 8 freq |
SoundEx code - R152 robinson - 22 freq revenge - 23 freq rapunzel - 1 freq ribbons - 33 freq 'ribbons - 1 freq ravenscraig - 2 freq ravens - 5 freq raivens - 1 freq robbing - 1 freq ripeness - 1 freq reopens - 1 freq ripens - 2 freq ribbans - 1 freq repones - 59 freq rifeness - 2 freq robin's - 14 freq robins - 1 freq rubenstein - 1 freq ravines - 1 freq rib-beens - 1 freq repons - 1 freq revengance - 1 freq revengeance - 2 freq revenues - 4 freq rubbing - 3 freq ravenous - 2 freq €˜ribbons - 1 freq revenish - 1 freq robmacleansport - 2 freq rovingpirate - 1 freq raving - 2 freq robinmcoach - 1 freq raybans - 1 freq robmcd - 8 freq robinscottellio - 2 freq rbfmaguire - 5 freq rovnick - 1 freq robinsonalan - 1 freq robinacrawford - 2 freq reponse - 1 freq reffing - 1 freq repping - 1 freq robfmac - 1 freq ripping - 1 freq |
MetaPhone code - RBMKT robmcd - 8 freq |
ROBMCD |
| Time to execute Levenshtein function - 0.175509 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.343783 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.028456 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.037460 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.000938 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. |