Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
liltin (0) - 6 freq giltin (1) - 2 freq lilting (1) - 1 freq liftin (1) - 75 freq listin (1) - 4 freq lintin (1) - 2 freq littin (1) - 10 freq liltan (1) - 1 freq liltit (1) - 2 freq tiltin (1) - 6 freq fittin (2) - 44 freq kittin (2) - 1 freq fistin (2) - 1 freq littie (2) - 1 freq nittin (2) - 3 freq glintin (2) - 15 freq flistin (2) - 1 freq lickin (2) - 31 freq aitin (2) - 21 freq lootin (2) - 4 freq ilin (2) - 1 freq tillin (2) - 3 freq linin (2) - 10 freq kistin (2) - 3 freq citin (2) - 1 freq |
liltin (0) - 6 freq liltan (1) - 1 freq lilting (2) - 1 freq tiltin (2) - 6 freq giltin (2) - 2 freq littin (2) - 10 freq liltit (2) - 2 freq liftin (2) - 75 freq listin (2) - 4 freq lintin (2) - 2 freq linton (3) - 19 freq tiltan (3) - 1 freq meltin (3) - 24 freq pilton (3) - 1 freq dilutin (3) - 10 freq lillian (3) - 1 freq lilian (3) - 2 freq peltin (3) - 7 freq milton (3) - 4 freq flitin (3) - 1 freq lilty (3) - 1 freq laitin (3) - 19 freq boltin (3) - 3 freq quiltin (3) - 1 freq lustin (3) - 1 freq |
SoundEx code - L435 liltinhie - 1 freq liltin - 6 freq liltan - 1 freq lilting - 1 freq |
MetaPhone code - LLTN liltin - 6 freq liltan - 1 freq |
LILTIN |
Time to execute Levenshtein function - 0.204923 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.361854 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.028452 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.038391 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.001024 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. |