| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lollin (0) - 2 freq rollin (1) - 58 freq hollin (1) - 1 freq collin (1) - 2 freq pollin (1) - 10 freq losin (2) - 38 freq lillian (2) - 1 freq lowin (2) - 31 freq lovin (2) - 51 freq holin (2) - 2 freq follit (2) - 11 freq loafin (2) - 1 freq pollen (2) - 3 freq collie (2) - 27 freq loutin (2) - 3 freq lockin (2) - 7 freq lolls (2) - 2 freq fowlin (2) - 1 freq mullin (2) - 3 freq trollin (2) - 1 freq rollin' (2) - 1 freq howlin (2) - 53 freq tollie (2) - 3 freq poolin (2) - 2 freq wellin (2) - 5 freq |
lollin (0) - 2 freq lillian (2) - 1 freq lullan (2) - 1 freq lallan (2) - 6 freq lellan (2) - 1 freq rollin (2) - 58 freq pollin (2) - 10 freq hollin (2) - 1 freq collin (2) - 2 freq rollen (3) - 2 freq callin (3) - 31 freq fellin (3) - 3 freq follien (3) - 1 freq pullin (3) - 104 freq sellin (3) - 70 freq follyin (3) - 4 freq tillin (3) - 3 freq roullin (3) - 3 freq mellin (3) - 64 freq millin (3) - 6 freq youllin (3) - 1 freq lolly (3) - 1 freq liltin (3) - 6 freq lillie (3) - 4 freq lallie (3) - 1 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 |
LOLLIN |
| Time to execute Levenshtein function - 0.319047 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.606328 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.067839 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.038766 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.000854 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. |