| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mairtha (0) - 3 freq martha (1) - 7 freq mair-a (2) - 1 freq pairth (2) - 1 freq bairth (2) - 1 freq mairch (2) - 251 freq mairtian (2) - 2 freq dairths (2) - 1 freq mairt (2) - 5 freq matha (2) - 2 freq marcha (2) - 1 freq hairths (2) - 1 freq mairchan (2) - 3 freq mirth (2) - 12 freq maircht (2) - 3 freq mairchd (2) - 1 freq dairth (2) - 1 freq mairtin (2) - 1 freq mattha (2) - 22 freq mairtial (2) - 3 freq nairth (2) - 1 freq mairtha's (2) - 1 freq maireh (2) - 3 freq marta (2) - 1 freq airth (2) - 11 freq |
mairtha (0) - 3 freq martha (1) - 7 freq mirth (2) - 12 freq mairtial (3) - 3 freq mattha (3) - 22 freq dairth (3) - 1 freq maireh (3) - 3 freq hairth (3) - 26 freq airth (3) - 11 freq marta (3) - 1 freq nairth (3) - 1 freq mairtin (3) - 1 freq mairtian (3) - 2 freq mairch (3) - 251 freq pairth (3) - 1 freq mairt (3) - 5 freq bairth (3) - 1 freq marcha (3) - 1 freq matha (3) - 2 freq march (4) - 139 freq birth (4) - 92 freq mart (4) - 38 freq mith (4) - 63 freq mairit (4) - 11 freq martyn (4) - 1 freq |
SoundEx code - M630 mairrit - 59 freq mort - 3 freq mairried - 40 freq mairiet - 4 freq married - 30 freq mairriet - 55 freq marred - 5 freq mired - 2 freq mirth - 12 freq merit - 17 freq moored - 2 freq merriet - 39 freq mairret - 17 freq marta - 1 freq 'mairrit - 1 freq mart - 38 freq merried - 14 freq mird - 6 freq mardi - 2 freq martha - 7 freq mairied - 10 freq mairie't - 1 freq moort - 4 freq mayritt - 1 freq mairead - 6 freq mairit - 11 freq myriad - 11 freq mairt - 5 freq marriet - 15 freq merde - 1 freq mairtha - 3 freq muirret - 1 freq moorit - 8 freq merrried - 1 freq mert - 1 freq mereat - 1 freq murdo - 18 freq merrit - 6 freq murriet - 1 freq marrit - 1 freq marit - 1 freq maerried - 1 freq marriot - 1 freq moretti - 1 freq morde - 1 freq merida - 1 freq muirhead - 1 freq |
MetaPhone code - MR0 mirth - 12 freq martha - 7 freq mairtha - 3 freq |
MAIRTHA |
| Time to execute Levenshtein function - 0.486930 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.674887 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.039819 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.069947 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.000899 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. |