| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eleventh (0) - 6 freq eleiventh (1) - 1 freq seeventh (2) - 6 freq seventh (2) - 6 freq eleven (2) - 36 freq element (2) - 45 freq eleevent (2) - 1 freq eleevinth (2) - 1 freq elements (2) - 35 freq eleyven (3) - 5 freq gleven (3) - 1 freq prevent (3) - 14 freq elyven (3) - 2 freq lenth (3) - 83 freq elegant (3) - 12 freq eeleevent (3) - 1 freq levelt (3) - 1 freq clements (3) - 1 freq leven (3) - 17 freq seeventy (3) - 10 freq leven's (3) - 2 freq elevkit (3) - 1 freq pleven (3) - 1 freq elementar (3) - 3 freq leent (3) - 26 freq |
eleventh (0) - 6 freq eleiventh (1) - 1 freq eleevinth (2) - 1 freq eleevent (3) - 1 freq seventh (3) - 6 freq seeventh (3) - 6 freq eeleevent (4) - 1 freq seiventh (4) - 2 freq leavent (4) - 1 freq lenth (4) - 83 freq element (4) - 45 freq elements (4) - 35 freq eleven (4) - 36 freq seventy (5) - 19 freq sivventh (5) - 1 freq elevate (5) - 2 freq event (5) - 103 freq eleiven (5) - 15 freq seevent (5) - 3 freq events (5) - 82 freq linth (5) - 42 freq elemints (5) - 1 freq elven (5) - 1 freq eleeven (5) - 35 freq aleevint (5) - 1 freq |
SoundEx code - E415 elephants - 12 freq eleventh - 6 freq elbowin - 4 freq elephant - 34 freq eleeven - 35 freq eleiventh - 1 freq eleiven - 15 freq elfin - 5 freq eleivin - 1 freq elivvin - 1 freq elefven - 1 freq eleven - 36 freq eleeven-year-auld - 1 freq eleeven-an-a-hauf - 1 freq eleven-an-a-hauf - 1 freq eleeven-year-aul - 1 freq eleevinth - 1 freq elbain - 1 freq elyven - 2 freq eleevent - 1 freq elephant's - 1 freq eleevin - 4 freq eeleeven - 1 freq elieven - 3 freq elephantine - 1 freq eeleevent - 1 freq elphinstone - 14 freq elibank - 2 freq ellyfants - 1 freq elphinstane - 3 freq eleyven - 5 freq eleevan - 1 freq elven - 1 freq elivin - 1 freq elephint - 1 freq elphinstonejack - 7 freq |
MetaPhone code - ELFN0 eleventh - 6 freq eleiventh - 1 freq eleevinth - 1 freq |
ELEVENTH |
| Time to execute Levenshtein function - 0.195916 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.338273 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.027036 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.036792 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.000864 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. |