| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| memorandum (0) - 5 freq memorundun (2) - 1 freq rembrandt (4) - 4 freq rederendum (4) - 1 freq memoriam (4) - 5 freq membrane (4) - 3 freq memorable (4) - 10 freq referendum (4) - 151 freq neverendum (4) - 1 freq geranium (4) - 1 freq memorably (4) - 1 freq notandum (4) - 1 freq errands (5) - 11 freq jehoram (5) - 2 freq demandit (5) - 45 freq demeanour (5) - 5 freq moorland (5) - 3 freq memorie's (5) - 1 freq random (5) - 35 freq emerants (5) - 1 freq moredun (5) - 1 freq emeralds (5) - 10 freq veranda (5) - 5 freq memores (5) - 1 freq msmaryandes (5) - 2 freq |
memorandum (0) - 5 freq memorundun (3) - 1 freq referendum (6) - 151 freq neverendum (6) - 1 freq memoriam (6) - 5 freq rederendum (6) - 1 freq random (7) - 35 freq miranda (7) - 7 freq 'random (7) - 1 freq memorised (7) - 1 freq tirrandom (7) - 1 freq msmaryandes (7) - 2 freq momentum (7) - 5 freq memorably (7) - 1 freq memorable (7) - 10 freq membrane (7) - 3 freq rembrandt (7) - 4 freq notandum (7) - 1 freq geranium (7) - 1 freq emerald (8) - 17 freq crankum (8) - 1 freq remand (8) - 2 freq verandae (8) - 1 freq demandan (8) - 1 freq demands (8) - 21 freq |
SoundEx code - M565 memoriam - 5 freq memorundun - 1 freq memorandum - 5 freq memorandum-byeuk - 1 freq manranofficial - 1 freq manwairing - 1 freq monrmkxsfp - 1 freq |
MetaPhone code - MMRNTM memorandum - 5 freq |
MEMORANDUM |
| Time to execute Levenshtein function - 0.241390 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.394217 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.027598 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.037897 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.000867 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. |