| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ivverlaistin (0) - 1 freq iverlaistin (1) - 1 freq iverlastin (2) - 4 freq ivverlestin (2) - 3 freq everlastin (3) - 3 freq ivveriethin (4) - 1 freq iver-risin (4) - 1 freq everlestin (4) - 1 freq ivveryithin (4) - 1 freq ever-lastin (4) - 1 freq everlasting (4) - 1 freq inheritin (5) - 2 freq enlistin (5) - 1 freq interestin (5) - 156 freq advertisin (5) - 8 freq interactin (5) - 2 freq iuterestin (5) - 1 freq idealistic (5) - 2 freq iveriethin (5) - 13 freq vvreitin (5) - 1 freq innerleithin (5) - 1 freq imperialistic (5) - 1 freq investin (5) - 6 freq iver-hantin (5) - 1 freq innermaist (5) - 5 freq |
ivverlaistin (0) - 1 freq iverlaistin (2) - 1 freq ivverlestin (2) - 3 freq iverlastin (3) - 4 freq everlastin (4) - 3 freq everlestin (5) - 1 freq ever-lastin (6) - 1 freq everlasting (6) - 1 freq ivveriethin (7) - 1 freq vvreitin (7) - 1 freq ivveryithin (7) - 1 freq imperialistic (8) - 1 freq iverleevin (8) - 1 freq overlappin (8) - 2 freq traistin (8) - 1 freq ivverythin (8) - 3 freq investin (8) - 6 freq iver-risin (8) - 1 freq interestin (8) - 156 freq iuterestin (8) - 1 freq enlistin (8) - 1 freq advertisin (8) - 8 freq hermiston (9) - 1 freq intrestin (9) - 7 freq vibratin (9) - 2 freq |
SoundEx code - I164 ivver-helpfu - 1 freq iverlastin - 4 freq ivverlestin - 3 freq ivverlaistin - 1 freq iver-lovin - 1 freq iverleevin - 1 freq iverlaistin - 1 freq ivorljohnson - 2 freq |
MetaPhone code - IFRLSTN iverlastin - 4 freq ivverlestin - 3 freq ivverlaistin - 1 freq iverlaistin - 1 freq |
IVVERLAISTIN |
| Time to execute Levenshtein function - 0.214355 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.370076 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.027720 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.037615 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.000903 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. |