| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| erin (0) - 9 freq erinm (1) - 2 freq erwin (1) - 1 freq eein (1) - 6 freq etin (1) - 10 freq enin (1) - 4 freq eri (1) - 1 freq eryin (1) - 3 freq errin (1) - 1 freq grin (1) - 135 freq erun (1) - 2 freq rin (1) - 452 freq herin (1) - 2 freq ewin (1) - 1 freq eerin (1) - 2 freq edin (1) - 4 freq erie (1) - 1 freq brin (1) - 3 freq ecrin (1) - 1 freq erik (1) - 2 freq evin (1) - 64 freq ein (1) - 86 freq ern (1) - 14 freq 'rin (1) - 2 freq eric (1) - 63 freq |
erin (0) - 9 freq ern (1) - 14 freq eryin (1) - 3 freq rin (1) - 452 freq erun (1) - 2 freq eerin (1) - 2 freq ron (2) - 12 freq urn (2) - 6 freq aran (2) - 5 freq orun (2) - 1 freq urine (2) - 2 freq ran (2) - 448 freq rn (2) - 7 freq orain (2) - 1 freq rine (2) - 1 freq ruin (2) - 36 freq erne (2) - 4 freq ren (2) - 11 freq rein (2) - 14 freq run (2) - 623 freq ryn (2) - 2 freq iron (2) - 103 freq orion (2) - 4 freq rain (2) - 672 freq iran (2) - 2 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 |
ERIN |
| Time to execute Levenshtein function - 0.184310 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.357764 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.029089 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.037933 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.000894 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. |