Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
marmalade (0) - 12 freq mairmalade (1) - 1 freq marinade (3) - 3 freq marmaids (3) - 1 freq marmaduke (3) - 1 freq armadale (3) - 3 freq carronade (4) - 1 freq lamalaeg (4) - 1 freq magdalene (4) - 3 freq man-made (4) - 5 freq mill-lade (4) - 1 freq drumblade (4) - 1 freq marmore (4) - 2 freq marple (4) - 2 freq armata (4) - 1 freq harald (4) - 17 freq murmled (4) - 5 freq mandalay (4) - 1 freq malady (4) - 1 freq marble (4) - 21 freq marcmalloy (4) - 1 freq barmaids (4) - 2 freq tarmacadam (4) - 2 freq margarine (4) - 10 freq marshmallae (4) - 3 freq |
marmalade (0) - 12 freq mairmalade (1) - 1 freq murmled (4) - 5 freq marled (5) - 2 freq marlled (5) - 1 freq mrmalky (5) - 32 freq mermaid (5) - 3 freq marmaduke (5) - 1 freq marinade (5) - 3 freq marmaids (5) - 1 freq marslife (6) - 1 freq armadale (6) - 3 freq normalise (6) - 4 freq mismade (6) - 1 freq formulate (6) - 2 freq mammal (6) - 2 freq moralise (6) - 1 freq marsalis (6) - 1 freq arnaldo (6) - 2 freq formulae (6) - 3 freq marlowe (6) - 1 freq marmaris (6) - 3 freq madlad (6) - 1 freq murmell (6) - 2 freq mormond (6) - 5 freq |
SoundEx code - M654 marmalade - 12 freq murmled - 5 freq muirmiln - 2 freq mairmalade - 1 freq murmlin - 2 freq murmeln - 1 freq murmell - 2 freq murmelt - 2 freq marinells - 1 freq mrmalky - 32 freq mrmalcovitch - 1 freq mrneilforsyth - 1 freq |
MetaPhone code - MRMLT marmalade - 12 freq murmled - 5 freq mairmalade - 1 freq murmelt - 2 freq |
MARMALADE |
Time to execute Levenshtein function - 0.290772 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.451534 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.029165 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.038920 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.000879 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. |