| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lilian (0) - 2 freq lillian (1) - 1 freq liltan (1) - 1 freq lippan (2) - 1 freq liftan (2) - 3 freq lallan (2) - 6 freq gillan (2) - 5 freq linin (2) - 10 freq lellan (2) - 1 freq ilin (2) - 1 freq ilia (2) - 1 freq lickan (2) - 3 freq ailin (2) - 2 freq julian (2) - 6 freq liein (2) - 3 freq oilcan (2) - 1 freq likin (2) - 38 freq simian (2) - 1 freq millan (2) - 1 freq eilean (2) - 1 freq bilin (2) - 42 freq lillias (2) - 1 freq lilico (2) - 1 freq lullan (2) - 1 freq lilied (2) - 1 freq |
lilian (0) - 2 freq llion (2) - 57 freq liltan (2) - 1 freq lillian (2) - 1 freq lilies (3) - 19 freq lilac (3) - 3 freq lili (3) - 2 freq dillan (3) - 1 freq libyan (3) - 1 freq fillan (3) - 8 freq lila (3) - 1 freq pilin (3) - 9 freq livan (3) - 6 freq rilin (3) - 2 freq wilin (3) - 1 freq filin (3) - 3 freq oilman (3) - 1 freq uglian (3) - 2 freq ellan (3) - 2 freq leilane (3) - 1 freq allan (3) - 91 freq alian (3) - 1 freq willan (3) - 5 freq gillian (3) - 7 freq milin (3) - 2 freq |
SoundEx code - L450 lee-lane - 6 freq lallan - 6 freq lollin - 2 freq lillian - 1 freq lei-lane - 3 freq lullan - 1 freq lie-lown - 1 freq leilane - 1 freq law-lyin - 1 freq lellan - 1 freq lilian - 2 freq |
MetaPhone code - LLN lee-lane - 6 freq lallan - 6 freq lollin - 2 freq lillian - 1 freq lei-lane - 3 freq lullan - 1 freq lie-lown - 1 freq leilane - 1 freq lellan - 1 freq lilian - 2 freq |
LILIAN |
| Time to execute Levenshtein function - 0.182295 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.335529 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.027566 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.037588 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.000940 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. |