| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| liltit (0) - 2 freq liltin (1) - 6 freq giltit (1) - 3 freq wiltit (1) - 1 freq tiltit (1) - 7 freq hiltit (1) - 1 freq listit (1) - 7 freq liftit (1) - 134 freq kiltit (1) - 4 freq laistit (2) - 2 freq lintin (2) - 2 freq iftit (2) - 1 freq limpit (2) - 1 freq likkit (2) - 2 freq lifit (2) - 2 freq lightit (2) - 1 freq willit (2) - 1 freq lantit (2) - 1 freq kittit (2) - 2 freq stiltit (2) - 1 freq litt (2) - 2 freq peltit (2) - 5 freq tintit (2) - 3 freq til'it (2) - 1 freq littin (2) - 10 freq |
liltit (0) - 2 freq listit (2) - 7 freq kiltit (2) - 4 freq hiltit (2) - 1 freq liftit (2) - 134 freq liltin (2) - 6 freq tiltit (2) - 7 freq giltit (2) - 3 freq wiltit (2) - 1 freq liltan (3) - 1 freq tiltet (3) - 1 freq luistit (3) - 1 freq lilties (3) - 2 freq luntit (3) - 3 freq allotit (3) - 1 freq lilty (3) - 1 freq luftit (3) - 7 freq lootit (3) - 1 freq listet (3) - 1 freq loutit (3) - 3 freq haltit (3) - 3 freq meltit (3) - 26 freq boltit (3) - 4 freq lastit (3) - 13 freq bultit (3) - 1 freq |
SoundEx code - L433 liltit - 2 freq |
MetaPhone code - LLTT liltit - 2 freq |
LILTIT |
| Time to execute Levenshtein function - 0.332167 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.492004 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.035009 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.044170 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.001069 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. |