| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eildit (0) - 12 freq gildit (1) - 1 freq beildit (1) - 4 freq pilit (2) - 2 freq kiltit (2) - 4 freq heidit (2) - 60 freq rilit (2) - 1 freq milkit (2) - 5 freq heilit (2) - 1 freq hiltit (2) - 1 freq til'it (2) - 1 freq wiltit (2) - 1 freq wirdit (2) - 1 freq edit (2) - 17 freq eikit (2) - 65 freq eijit (2) - 1 freq sidit (2) - 1 freq foldit (2) - 12 freq fillit (2) - 2 freq eildrig (2) - 2 freq eilder (2) - 1 freq eildest (2) - 2 freq beirdit (2) - 1 freq liltit (2) - 2 freq neidit (2) - 1 freq |
eildit (0) - 12 freq gildit (2) - 1 freq beildit (2) - 4 freq eildon (3) - 3 freq endit (3) - 55 freq laedit (3) - 1 freq aidit (3) - 1 freq bidit (3) - 30 freq bieldit (3) - 5 freq waldit (3) - 1 freq eild (3) - 17 freq moldit (3) - 2 freq hidit (3) - 1 freq eldin (3) - 3 freq laidit (3) - 9 freq loadit (3) - 19 freq eilds (3) - 2 freq widit (3) - 1 freq neidit (3) - 1 freq eyndit (3) - 2 freq buildit (3) - 1 freq yirdit (3) - 29 freq eidiot (3) - 1 freq ladit (3) - 2 freq foldit (3) - 12 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 |
EILDIT |
| Time to execute Levenshtein function - 0.336645 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.581489 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.062377 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.039089 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.000777 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. |