| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lallan (0) - 6 freq allan (1) - 91 freq lullan (1) - 1 freq lellan (1) - 1 freq fallan (1) - 4 freq callan (1) - 3 freq hallan (1) - 1 freq lallans (1) - 129 freq pallin (2) - 2 freq lilian (2) - 2 freq pullan (2) - 6 freq rallyan (2) - 2 freq yellan (2) - 1 freq haalan (2) - 2 freq lachlan (2) - 1 freq lankan (2) - 2 freq lalldy (2) - 1 freq alban (2) - 3 freq millan (2) - 1 freq liltan (2) - 1 freq pallas (2) - 2 freq callin (2) - 31 freq fillan (2) - 8 freq lawland (2) - 20 freq €˜allan (2) - 1 freq |
lallan (0) - 6 freq lellan (1) - 1 freq lullan (1) - 1 freq lollin (2) - 2 freq lillian (2) - 1 freq lallans (2) - 129 freq hallan (2) - 1 freq allan (2) - 91 freq callan (2) - 3 freq fallan (2) - 4 freq mullan (3) - 2 freq ellan (3) - 2 freq killan (3) - 2 freq rollan (3) - 2 freq allen (3) - 2 freq gillan (3) - 5 freq hallon (3) - 1 freq fallean (3) - 1 freq lallie (3) - 1 freq ballin (3) - 3 freq gellan (3) - 7 freq sellan (3) - 1 freq fallin (3) - 48 freq lally (3) - 2 freq fallen (3) - 29 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 |
LALLAN |
| Time to execute Levenshtein function - 0.168034 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.310357 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.026861 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.036309 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.000795 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. |