Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
morlichbck (0) - 2 freq morlich (3) - 3 freq vorlich (4) - 1 freq oorlich (4) - 2 freq molach (5) - 176 freq potlicht (5) - 1 freq norwick (5) - 1 freq yorick (5) - 2 freq mollach (5) - 2 freq maclintock (5) - 1 freq yallicrack (5) - 1 freq bollick (5) - 2 freq mortice (5) - 4 freq morice (5) - 1 freq morrices (5) - 6 freq moonlicht (5) - 8 freq spellcheck (5) - 6 freq corrlichie (5) - 2 freq morrices' (5) - 1 freq morrice'll (5) - 1 freq moralistic (5) - 1 freq oorichie (5) - 1 freq morocco (5) - 1 freq monolithic (5) - 4 freq mollachin (5) - 1 freq |
morlichbck (0) - 2 freq morlich (6) - 3 freq oorlich (8) - 2 freq vorlich (8) - 1 freq charliechock (8) - 1 freq mortlach (9) - 1 freq norloch (9) - 1 freq muircock (9) - 6 freq mortlock (9) - 1 freq mollachin (9) - 1 freq monolithic (9) - 4 freq mollucca (9) - 1 freq mollochy (9) - 1 freq collieback (9) - 1 freq splashback (9) - 1 freq angelachick (9) - 2 freq soundcheck (9) - 4 freq mollachy (9) - 1 freq marwick (9) - 15 freq morocco (9) - 1 freq mealick (9) - 1 freq mrcelebuk (9) - 1 freq moonlicht (9) - 8 freq molach (9) - 176 freq yallicrack (9) - 1 freq |
SoundEx code - M642 morals - 10 freq mairlike - 2 freq morales - 1 freq marlies - 1 freq marless - 8 freq miralles - 2 freq murals - 8 freq mirrie-lik - 1 freq mirligoes - 3 freq moralisin - 1 freq merle's - 2 freq marraless - 1 freq moralistic - 1 freq merles - 1 freq morroless - 1 freq morlich - 3 freq moralise - 1 freq morlichbck - 2 freq mareelshetland - 1 freq marlex - 1 freq |
MetaPhone code - MRLXBK morlichbck - 2 freq |
MORLICHBCK |
Time to execute Levenshtein function - 0.256314 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.570442 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.058040 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.037592 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.000936 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. |