| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eerins (0) - 6 freq eerin (1) - 2 freq eenins (1) - 2 freq feerins (1) - 1 freq eerans (1) - 1 freq errins (1) - 1 freq eerin's (1) - 1 freq weering (2) - 2 freq eers (2) - 9 freq eejits (2) - 50 freq leerin (2) - 5 freq eesin (2) - 1 freq strins (2) - 2 freq teries (2) - 1 freq feelins (2) - 76 freq parins (2) - 3 freq merkins (2) - 1 freq erinm (2) - 2 freq pexins (2) - 1 freq weerin (2) - 67 freq hevins (2) - 1 freq eisins (2) - 1 freq bearins (2) - 9 freq eelids (2) - 2 freq eerily (2) - 1 freq |
eerins (0) - 6 freq eerans (1) - 1 freq rins (2) - 101 freq erns (2) - 1 freq reins (2) - 21 freq arins (2) - 1 freq yerns (2) - 1 freq eerin's (2) - 1 freq eerin (2) - 2 freq eenins (2) - 2 freq feerins (2) - 1 freq errins (2) - 1 freq earns (2) - 3 freq yerlins (3) - 1 freq ferns (3) - 7 freq ernes (3) - 1 freq yarns (3) - 28 freq weeyins (3) - 22 freq eries (3) - 1 freq reruns (3) - 1 freq deeins (3) - 7 freq eenies (3) - 15 freq grins (3) - 21 freq beirins (3) - 1 freq earrins (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 |
EERINS |
| Time to execute Levenshtein function - 0.188973 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.336985 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.027323 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.037481 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.000901 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. |