| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| elatit (0) - 1 freq eatit (1) - 1 freq relatit (1) - 34 freq slatit (1) - 1 freq slakit (2) - 1 freq datit (2) - 6 freq flaitit (2) - 3 freq beltit (2) - 14 freq flait (2) - 1 freq relait (2) - 1 freq lait (2) - 4 freq evitit (2) - 2 freq debatit (2) - 9 freq ratit (2) - 1 freq lantit (2) - 1 freq relatin (2) - 9 freq eatin (2) - 154 freq beatit (2) - 1 freq tltit (2) - 1 freq flamit (2) - 1 freq blait (2) - 2 freq hatit (2) - 15 freq glakit (2) - 4 freq seatit (2) - 7 freq plait (2) - 6 freq |
elatit (0) - 1 freq eatit (2) - 1 freq slatit (2) - 1 freq latt (2) - 3 freq relatit (2) - 34 freq exaltit (3) - 1 freq peltit (3) - 5 freq relatet (3) - 2 freq gloatit (3) - 2 freq elitist (3) - 4 freq loutit (3) - 3 freq elation (3) - 3 freq bloatit (3) - 3 freq plotit (3) - 3 freq pleatit (3) - 3 freq floatit (3) - 7 freq latin (3) - 92 freq meltit (3) - 26 freq flotit (3) - 1 freq delitit (3) - 3 freq evytit (3) - 1 freq elicit (3) - 1 freq leitit (3) - 3 freq latte (3) - 5 freq litt (3) - 2 freq |
SoundEx code - E433 eildit - 12 freq elated - 3 freq elted - 1 freq elatit - 1 freq elided - 1 freq eilidhdouglas - 4 freq |
MetaPhone code - ELTT eildit - 12 freq elated - 3 freq elted - 1 freq elatit - 1 freq elided - 1 freq ae-leidit - 1 freq |
ELATIT |
| Time to execute Levenshtein function - 0.442590 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.696949 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.062874 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.073305 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.000906 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. |