| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ermie (0) - 1 freq erie (1) - 1 freq ernie (1) - 50 freq ertie (1) - 12 freq ermine (1) - 7 freq enemie (2) - 7 freq eamin (2) - 1 freq erode (2) - 1 freq eddie (2) - 31 freq erin (2) - 9 freq jerrie (2) - 5 freq fernie (2) - 1 freq evie (2) - 8 freq eisie (2) - 2 freq rimie (2) - 2 freq ellie (2) - 7 freq erste (2) - 1 freq famie (2) - 1 freq envie (2) - 2 freq perrie (2) - 1 freq emit (2) - 4 freq permit (2) - 7 freq eri (2) - 1 freq elkie (2) - 1 freq derkie (2) - 3 freq |
ermie (0) - 1 freq airmie (2) - 15 freq erie (2) - 1 freq erm (2) - 70 freq ormi (2) - 3 freq rimie (2) - 2 freq ermy (2) - 2 freq ernie (2) - 50 freq ertie (2) - 12 freq ermine (2) - 7 freq a'mie (3) - 1 freq armies (3) - 4 freq gamie (3) - 12 freq deemie (3) - 3 freq eryin (3) - 3 freq qrme (3) - 1 freq armoy (3) - 1 freq eried (3) - 6 freq mamie (3) - 1 freq wirmie (3) - 1 freq orrie (3) - 3 freq erik (3) - 2 freq eerie (3) - 34 freq earlie (3) - 7 freq jeemie (3) - 61 freq |
SoundEx code - E650 erm - 70 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 - ERM erm - 70 freq erum - 1 freq ermy - 2 freq ermie - 1 freq |
ERMIE |
| Time to execute Levenshtein function - 0.193199 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.419961 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.062794 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.040931 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.001224 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. |