| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eerans (0) - 1 freq eerrans (1) - 1 freq eeran (1) - 2 freq eerins (1) - 6 freq eerant (1) - 2 freq eenan (2) - 1 freq eer's (2) - 1 freq ferns (2) - 7 freq feelans (2) - 2 freq berns (2) - 10 freq ermans (2) - 1 freq errins (2) - 1 freq derns (2) - 4 freq hera's (2) - 1 freq vera's (2) - 3 freq trans (2) - 5 freq lemans (2) - 1 freq errants (2) - 4 freq eerin (2) - 2 freq reruns (2) - 1 freq crans (2) - 1 freq veterans (2) - 8 freq evans (2) - 27 freq vegans (2) - 1 freq eans (2) - 10 freq |
eerans (0) - 1 freq eerins (1) - 6 freq yerns (2) - 1 freq erns (2) - 1 freq rans (2) - 1 freq earns (2) - 3 freq eerrans (2) - 1 freq eerant (2) - 2 freq eeran (2) - 2 freq irons (3) - 3 freq deans (3) - 3 freq eers (3) - 9 freq weyans (3) - 1 freq leans (3) - 17 freq yearns (3) - 1 freq peans (3) - 1 freq eerin's (3) - 1 freq jeans (3) - 55 freq geans (3) - 2 freq rins (3) - 101 freq eras (3) - 2 freq eens (3) - 131 freq yarns (3) - 28 freq rns (3) - 5 freq raans (3) - 2 freq |
SoundEx code - E652 earrins - 2 freq erying - 1 freq erms - 48 freq ermchair - 10 freq earnestly - 4 freq earrings - 8 freq eerins - 6 freq earnest - 13 freq ernest - 6 freq eerin's - 1 freq errins - 1 freq earringed - 1 freq earns - 3 freq erns - 1 freq ee-wharms - 1 freq ern-cairriers - 1 freq erin's - 3 freq ernie's - 2 freq erm-chair - 1 freq eernest-like - 1 freq erne's - 1 freq euromosaic - 1 freq eerans - 1 freq ernes - 1 freq eringrieve - 7 freq eerrans - 1 freq |
MetaPhone code - ERNS earrins - 2 freq eerins - 6 freq eerin's - 1 freq errins - 1 freq earns - 3 freq erns - 1 freq erin's - 3 freq ernie's - 2 freq erne's - 1 freq eerans - 1 freq ernes - 1 freq eerrans - 1 freq |
EERANS |
| Time to execute Levenshtein function - 0.187079 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.350850 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.030121 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.043600 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.000939 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. |