| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| everlastin (0) - 3 freq iverlastin (1) - 4 freq everlasting (1) - 1 freq everlestin (1) - 1 freq ever-lastin (1) - 1 freq iverlaistin (2) - 1 freq ivverlestin (3) - 3 freq overlappin (3) - 2 freq ivverlaistin (3) - 1 freq exeistin (4) - 1 freq everwan (4) - 4 freq revertin (4) - 2 freq everyfin (4) - 10 freq everyhin (4) - 31 freq everythin (4) - 119 freq exertin (4) - 1 freq enlistin (4) - 1 freq terestin (4) - 1 freq reversin (4) - 4 freq hervestin (4) - 1 freq feastin (4) - 17 freq everson (4) - 3 freq lastin (4) - 9 freq elevatin (4) - 1 freq overcast (4) - 3 freq |
everlastin (0) - 3 freq everlestin (1) - 1 freq iverlastin (1) - 4 freq iverlaistin (2) - 1 freq ever-lastin (2) - 1 freq everlasting (2) - 1 freq ivverlaistin (4) - 1 freq ivverlestin (4) - 3 freq overlappin (5) - 2 freq roastin (6) - 23 freq verlaine (6) - 2 freq iverleevin (6) - 1 freq blastin (6) - 11 freq ayelestin (6) - 1 freq overcast (6) - 3 freq aye-lestin (6) - 1 freq lastin (6) - 9 freq avertin (6) - 1 freq everton (6) - 3 freq dlastin (6) - 1 freq relatin (6) - 9 freq everest (6) - 1 freq overladen (6) - 1 freq hervestin (6) - 1 freq terestin (6) - 1 freq |
SoundEx code - E164 ever-lastin - 1 freq everlastin - 3 freq epril - 1 freq everlestin - 1 freq everilk - 1 freq everly - 1 freq everlasting - 1 freq |
MetaPhone code - EFRLSTN ever-lastin - 1 freq everlastin - 3 freq everlestin - 1 freq |
EVERLASTIN |
| Time to execute Levenshtein function - 0.255010 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.444112 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.029195 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.039358 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.001062 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. |