| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eeran (0) - 2 freq eerant (1) - 2 freq eerin (1) - 2 freq eenan (1) - 1 freq erran (1) - 3 freq eerans (1) - 1 freq peeran (1) - 2 freq wern (2) - 1 freq pyran (2) - 1 freq ehman (2) - 1 freq heera (2) - 3 freq ee-aw (2) - 1 freq erra (2) - 3 freq veerin (2) - 1 freq certan (2) - 1 freq evenan (2) - 2 freq kertan (2) - 1 freq jerkan (2) - 1 freq yernan (2) - 1 freq wean (2) - 415 freq weman (2) - 1 freq waeran (2) - 1 freq eevin (2) - 5 freq een-an (2) - 1 freq duran (2) - 3 freq |
eeran (0) - 2 freq eerin (1) - 2 freq ern (2) - 14 freq ran (2) - 448 freq eiron (2) - 1 freq erun (2) - 2 freq earn (2) - 41 freq aran (2) - 5 freq erin (2) - 9 freq iran (2) - 2 freq eerant (2) - 2 freq erran (2) - 3 freq peeran (2) - 2 freq eerans (2) - 1 freq eenan (2) - 1 freq keiran (3) - 3 freq aaron (3) - 5 freq teerin (3) - 5 freq dern (3) - 21 freq fran (3) - 1 freq eatan (3) - 1 freq bean (3) - 41 freq reelan (3) - 3 freq lean (3) - 47 freq moran (3) - 8 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 |
EERAN |
| Time to execute Levenshtein function - 0.200104 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.406134 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.026801 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.036421 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.000747 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. |