| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eerins (0) - 6 freq feerins (1) - 1 freq eerin (1) - 2 freq eenins (1) - 2 freq errins (1) - 1 freq eerans (1) - 1 freq eerin's (1) - 1 freq merits (2) - 7 freq lerint (2) - 1 freq heevins (2) - 4 freq teries (2) - 1 freq steerins (2) - 5 freq errin (2) - 1 freq derlins (2) - 1 freq parins (2) - 3 freq yerns (2) - 1 freq strins (2) - 2 freq weeyins (2) - 22 freq eer's (2) - 1 freq endins (2) - 13 freq eerrans (2) - 1 freq seeins (2) - 2 freq eerant (2) - 2 freq teri's (2) - 1 freq peering (2) - 1 freq |
eerins (0) - 6 freq eerans (1) - 1 freq rins (2) - 101 freq erns (2) - 1 freq reins (2) - 21 freq earns (2) - 3 freq arins (2) - 1 freq yerns (2) - 1 freq eenins (2) - 2 freq eerin (2) - 2 freq errins (2) - 1 freq eerin's (2) - 1 freq feerins (2) - 1 freq eers (3) - 9 freq eeran (3) - 2 freq herons (3) - 3 freq easins (3) - 6 freq grins (3) - 19 freq eries (3) - 1 freq eenies (3) - 15 freq terns (3) - 2 freq yerlins (3) - 1 freq reruns (3) - 1 freq leains (3) - 3 freq ferns (3) - 7 freq |
SoundEx code - E652 earrins - 2 freq erying - 1 freq erms - 42 freq ermchair - 10 freq earnestly - 4 freq earrings - 7 freq eerins - 6 freq earnest - 13 freq ernest - 6 freq eerin's - 1 freq errins - 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 |
EERINS |
| Time to execute Levenshtein function - 0.226267 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.348438 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.029088 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.037007 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.000831 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. |