| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eerrans (0) - 1 freq eerans (1) - 1 freq eerrant (1) - 1 freq errands (2) - 11 freq herrins (2) - 2 freq errins (2) - 1 freq earrins (2) - 2 freq currans (2) - 1 freq errand (2) - 5 freq terrains (2) - 1 freq erran (2) - 3 freq harrans (2) - 1 freq eeran (2) - 2 freq errants (2) - 4 freq ermans (2) - 1 freq eerant (2) - 2 freq errant (2) - 2 freq earrant (2) - 1 freq merran (2) - 4 freq eerins (2) - 6 freq merran's (2) - 1 freq erran' (2) - 1 freq servans (2) - 4 freq germans (2) - 32 freq kerrant (2) - 1 freq |
eerrans (0) - 1 freq earrins (2) - 2 freq errins (2) - 1 freq eerrant (2) - 1 freq eerans (2) - 1 freq errant (3) - 2 freq ermans (3) - 1 freq earrant (3) - 1 freq erran' (3) - 1 freq reruns (3) - 1 freq errants (3) - 4 freq eerins (3) - 6 freq errand (3) - 5 freq currans (3) - 1 freq errands (3) - 11 freq terrains (3) - 1 freq harrans (3) - 1 freq herrins (3) - 2 freq erran (3) - 3 freq herns (4) - 1 freq organs (4) - 12 freq orras (4) - 1 freq barrens (4) - 1 freq wrans (4) - 1 freq derns (4) - 4 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 |
EERRANS |
| Time to execute Levenshtein function - 0.202140 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.377648 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.037350 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.040418 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.001157 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. |