| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mcrorie (0) - 3 freq mccrorie (1) - 6 freq mcrorrie (1) - 5 freq merrie (2) - 7 freq scoorie (2) - 3 freq cronie (2) - 2 freq marjorie (2) - 1 freq coorie (2) - 29 freq scorie (2) - 1 freq rorie (2) - 3 freq memorie (2) - 13 freq mirrie (2) - 7 freq mcredie (2) - 1 freq chorie (2) - 1 freq moorie (2) - 5 freq murriet (3) - 1 freq hurrie (3) - 1 freq scorin (3) - 6 freq mcburnie (3) - 1 freq corbie (3) - 27 freq mcalpie (3) - 1 freq kcrommie (3) - 19 freq crowpie (3) - 1 freq scurrie (3) - 3 freq mozie (3) - 1 freq |
mcrorie (0) - 3 freq mcrorrie (2) - 5 freq mccrorie (2) - 6 freq mcredie (3) - 1 freq merrie (3) - 7 freq mirrie (3) - 7 freq currie (4) - 1 freq carrie (4) - 11 freq mirrir (4) - 1 freq scurrie (4) - 3 freq merrier (4) - 4 freq marrae (4) - 8 freq mcrae (4) - 4 freq mirrae (4) - 1 freq mcgrory (4) - 2 freq mairrie (4) - 7 freq mcarle (4) - 2 freq morrae (4) - 2 freq corrie (4) - 55 freq scorrie (4) - 1 freq marjorie (4) - 1 freq rorie (4) - 3 freq scorie (4) - 1 freq coorie (4) - 29 freq cronie (4) - 2 freq |
SoundEx code - M266 macreary - 1 freq makar-owersetter - 1 freq mccrorie - 6 freq mcrorie - 3 freq mcrorrie - 5 freq mcgrory - 2 freq |
MetaPhone code - MKRR macreary - 1 freq mcrorie - 3 freq mcrorrie - 5 freq |
MCRORIE |
| Time to execute Levenshtein function - 0.240172 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.481870 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.032844 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.041843 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.000884 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. |