| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ulan (0) - 1 freq klan (1) - 1 freq clan (1) - 56 freq alan (1) - 150 freq plan (1) - 236 freq lan (1) - 139 freq usan (1) - 4 freq flan (1) - 3 freq uplan (1) - 4 freq sudan (2) - 1 freq faan (2) - 70 freq €¦an (2) - 1 freq van (2) - 161 freq kan (2) - 28 freq blag (2) - 1 freq land (2) - 352 freq larn (2) - 16 freq slab (2) - 32 freq ullans (2) - 32 freq klaz (2) - 1 freq blat (2) - 37 freq julian (2) - 6 freq cuban (2) - 2 freq sean (2) - 16 freq dylan (2) - 15 freq |
ulan (0) - 1 freq alan (1) - 150 freq lan (1) - 139 freq laen (2) - 3 freq lin (2) - 10 freq aloan (2) - 1 freq laun (2) - 76 freq elon (2) - 1 freq lun (2) - 1 freq alaen (2) - 10 freq lyn (2) - 17 freq alain (2) - 8 freq klan (2) - 1 freq alane (2) - 273 freq alian (2) - 1 freq alyn (2) - 1 freq ulna (2) - 1 freq loan (2) - 42 freq yulin (2) - 1 freq lane (2) - 240 freq alen (2) - 1 freq oilan (2) - 1 freq laan (2) - 9 freq aln (2) - 1 freq lain (2) - 18 freq |
SoundEx code - U450 ulan - 1 freq uilleann - 1 freq ulna - 1 freq |
MetaPhone code - ULN ulan - 1 freq uilleann - 1 freq ulna - 1 freq |
ULAN |
| Time to execute Levenshtein function - 0.193349 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.351045 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.029949 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.042720 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.001226 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. |