| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ernie (0) - 50 freq fernie (1) - 1 freq eenie (1) - 4 freq arnie (1) - 5 freq ermie (1) - 1 freq ertie (1) - 12 freq erie (1) - 1 freq erne (1) - 4 freq bernie (1) - 2 freq rennie (2) - 44 freq kertie (2) - 2 freq jeanie (2) - 34 freq dernit (2) - 4 freq beanie (2) - 1 freq eried (2) - 6 freq crie (2) - 7 freq erchie (2) - 59 freq beenie (2) - 5 freq eelie (2) - 1 freq earlie (2) - 7 freq irnae (2) - 23 freq merrie (2) - 7 freq eries (2) - 1 freq ennit (2) - 2 freq versie (2) - 1 freq |
ernie (0) - 50 freq arnie (1) - 5 freq erne (1) - 4 freq ironie (2) - 1 freq urnae (2) - 31 freq irnae (2) - 23 freq erin (2) - 9 freq arnae (2) - 18 freq arne (2) - 1 freq ern (2) - 14 freq arni (2) - 3 freq eryin (2) - 3 freq fernie (2) - 1 freq eenie (2) - 4 freq ertie (2) - 12 freq bernie (2) - 2 freq erie (2) - 1 freq ermie (2) - 1 freq ranyie (3) - 2 freq onnie (3) - 7 freq earnin (3) - 7 freq aerlie (3) - 10 freq exne (3) - 1 freq banie (3) - 1 freq erke (3) - 1 freq |
SoundEx code - E650 erm - 66 freq erun - 2 freq eairryin - 1 freq eeran - 2 freq earn - 41 freq eryin - 3 freq erum - 1 freq ern - 14 freq eerin - 2 freq eiron - 1 freq ermy - 2 freq errin - 1 freq erowen - 1 freq erwin - 1 freq erran' - 1 freq earrin - 1 freq erran - 3 freq ernie - 50 freq eireann - 1 freq ermie - 1 freq eirinn - 1 freq erowan - 1 freq erenn - 1 freq erin - 9 freq €˜erin - 1 freq erne - 4 freq erinm - 2 freq eye-rhyme - 1 freq |
MetaPhone code - ERN erun - 2 freq eeran - 2 freq earn - 41 freq ern - 14 freq eerin - 2 freq eiron - 1 freq errin - 1 freq erran' - 1 freq earrin - 1 freq erran - 3 freq ernie - 50 freq eireann - 1 freq eirinn - 1 freq erenn - 1 freq erin - 9 freq €˜erin - 1 freq erne - 4 freq aeaeron - 5 freq |
ERNIE |
| Time to execute Levenshtein function - 0.184102 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.327225 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.027722 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.037648 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.000799 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. |