| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mesmerised (0) - 8 freq mesmereised (1) - 1 freq memorised (2) - 2 freq mesmeric (3) - 1 freq mesmerising (3) - 1 freq mestered (3) - 1 freq memorise (3) - 2 freq mesmerizin (3) - 1 freq memorisin (4) - 1 freq televised (4) - 3 freq deserted (4) - 5 freq motorised (4) - 1 freq mem'ries (4) - 2 freq memmers (4) - 41 freq merried (4) - 14 freq hesperides (4) - 4 freq feminised (4) - 1 freq festered (4) - 3 freq mysterie (4) - 3 freq lesser-uised (4) - 5 freq merrried (4) - 1 freq despised (4) - 2 freq messed (4) - 8 freq meemories (4) - 1 freq reversed (4) - 4 freq |
mesmerised (0) - 8 freq mesmereised (1) - 1 freq memorised (3) - 2 freq memorise (5) - 2 freq immersed (5) - 4 freq mesmerizin (5) - 1 freq mesmeric (5) - 1 freq mestered (5) - 1 freq mesmerising (5) - 1 freq memories (6) - 110 freq summarised (6) - 2 freq meesteries (6) - 3 freq murmered (6) - 1 freq mustered (6) - 1 freq miseries (6) - 2 freq miscried (6) - 1 freq mastered (6) - 1 freq immersd (6) - 1 freq dispersed (6) - 4 freq mesters (6) - 1 freq memers (6) - 1 freq suprised (6) - 1 freq mysteries (6) - 7 freq memries (6) - 9 freq motorised (6) - 1 freq |
SoundEx code - M256 mesmerised - 8 freq mogganer - 2 freq misunnerstaunin - 2 freq misunnerstaun - 1 freq mason-wark - 2 freq machinery - 16 freq messmer - 1 freq mesmeric - 1 freq massiemore - 2 freq missionary - 6 freq mesmerizin - 1 freq misunnerstanin - 1 freq mchenry's - 1 freq misunnerstud - 1 freq meesionaries - 1 freq misunnerstuid - 3 freq misummer - 1 freq masonwark - 1 freq mcmurtrie - 9 freq mcmurtrie's - 3 freq missionaries - 1 freq mesmereised - 1 freq mchenry - 1 freq mcnorejqxe - 1 freq msmaryandes - 2 freq mwsnrcn - 1 freq misssmart - 1 freq mesmerising - 1 freq maxinerosemunro - 2 freq macmerry - 1 freq |
MetaPhone code - MSMRST mesmerised - 8 freq mesmereised - 1 freq |
MESMERISED |
| Time to execute Levenshtein function - 0.315598 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.485157 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.032670 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.069903 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.000944 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. |