| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mramirketabchi (0) - 1 freq marketable (6) - 1 freq mairket' (7) - 1 freq mairkets (7) - 3 freq mairech (7) - 1 freq mairketplace (7) - 1 freq mairket (7) - 20 freq mairkan (8) - 1 freq mhairiblack (8) - 2 freq heartache (8) - 1 freq markeast (8) - 1 freq mairchis (8) - 1 freq mairch (8) - 251 freq ramirez (8) - 9 freq cailleach (8) - 9 freq mairchin (8) - 35 freq aireamh (8) - 2 freq harpreach (8) - 3 freq mairker (8) - 1 freq craigiemack (8) - 2 freq braiket (8) - 2 freq semi-detached (8) - 5 freq ramballiach (8) - 2 freq maircht (8) - 3 freq remarkably (8) - 4 freq |
mramirketabchi (0) - 1 freq marketable (10) - 1 freq remarkably (12) - 4 freq remerkable (12) - 4 freq pairritch (12) - 1 freq remairkably (12) - 1 freq remarkable (12) - 14 freq markinch (12) - 1 freq marktracey (12) - 1 freq mairech (12) - 1 freq mairkets (12) - 3 freq mairket' (12) - 1 freq mairketplace (12) - 1 freq mairket (12) - 20 freq remairkable (12) - 1 freq ramrace (13) - 1 freq brattach (13) - 3 freq remerkit (13) - 2 freq cranreuch (13) - 14 freq inspireteach (13) - 1 freq matriarch (13) - 2 freq mairtha (13) - 3 freq marenich (13) - 1 freq remarkt (13) - 7 freq market's (13) - 1 freq |
SoundEx code - M656 mourners - 6 freq murmured - 13 freq murmurt - 3 freq mariners' - 2 freq murmur - 7 freq mourner - 2 freq mariner - 4 freq marmaris - 3 freq murmurs - 2 freq marmor - 2 freq marmore - 2 freq murmuration - 1 freq mærnoriess - 1 freq mærnorless - 1 freq murmurins - 1 freq murmer - 2 freq marmorschale - 1 freq marineris - 1 freq murmuring - 1 freq murners - 1 freq murmered - 1 freq mramirketabchi - 1 freq mrmarkmillar - 2 freq mermarble - 1 freq |
MetaPhone code - MRMRKTBX mramirketabchi - 1 freq |
MRAMIRKETABCHI |
| Time to execute Levenshtein function - 0.329163 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.659717 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.027962 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.076775 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.000874 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. |