| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| morphed (0) - 1 freq mopped (2) - 3 freq mouthed (2) - 1 freq morpheus (2) - 1 freq moped (2) - 1 freq moothed (2) - 5 freq mumphed (2) - 1 freq morpheme (2) - 10 freq merched (2) - 10 freq marched (2) - 15 freq morph (2) - 1 freq mooched (2) - 3 freq coached (3) - 1 freq sirpled (3) - 1 freq mortem (3) - 1 freq morbid (3) - 3 freq touched (3) - 75 freq perched (3) - 20 freq soched (3) - 1 freq lowped (3) - 64 freq lurched (3) - 2 freq worked (3) - 149 freq mapped (3) - 4 freq oped (3) - 1 freq forced (3) - 73 freq |
morphed (0) - 1 freq mumphed (3) - 1 freq merched (3) - 10 freq morpheus (3) - 1 freq morph (3) - 1 freq marched (3) - 15 freq morpheme (3) - 10 freq murphy (4) - 31 freq morphine (4) - 2 freq mairched (4) - 48 freq rephed (4) - 1 freq mooched (4) - 3 freq mopped (4) - 3 freq moped (4) - 1 freq mouthed (4) - 1 freq moothed (4) - 5 freq mcphee (5) - 12 freq murtherd (5) - 1 freq orphir (5) - 3 freq murther (5) - 28 freq marple (5) - 2 freq morpeth (5) - 2 freq forehead (5) - 5 freq mushed (5) - 1 freq mirled (5) - 2 freq |
SoundEx code - M613 morbid - 3 freq muirfit - 1 freq meirbattle - 1 freq morpeth's - 1 freq morpeth - 2 freq muirbattle - 1 freq morebattle - 1 freq morphed - 1 freq mrpeterandre - 1 freq |
MetaPhone code - MRFT muirfit - 1 freq morphed - 1 freq |
MORPHED |
| Time to execute Levenshtein function - 0.218469 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.425289 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.027181 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.037525 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.000891 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. |