| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| morpheme (0) - 10 freq morphemes (1) - 13 freq morpheus (2) - 1 freq morphine (2) - 2 freq morphed (2) - 1 freq morph (3) - 1 freq macphee (3) - 3 freq grapheme (3) - 5 freq orpheus (3) - 4 freq mortem (3) - 1 freq mcphee (3) - 12 freq mooreme (3) - 1 freq morpeth (3) - 2 freq morecambe (4) - 1 freq foreheed (4) - 1 freq sphere (4) - 14 freq modere (4) - 1 freq houpee (4) - 3 freq rhyme (4) - 63 freq moothie (4) - 4 freq mornen (4) - 9 freq northern (4) - 63 freq murphy (4) - 27 freq porkheid (4) - 1 freq more-' (4) - 1 freq |
morpheme (0) - 10 freq morphemes (2) - 13 freq morphine (3) - 2 freq morphed (3) - 1 freq morpheus (3) - 1 freq grapheme (4) - 5 freq morph (4) - 1 freq murphy (5) - 27 freq amorphous (5) - 2 freq mooreme (5) - 1 freq morpeth (5) - 2 freq orpheus (5) - 4 freq mcphee (5) - 12 freq macphee (5) - 3 freq mortem (5) - 1 freq rhome (6) - 4 freq maritime (6) - 3 freq graphemes (6) - 3 freq phemie (6) - 2 freq merched (6) - 10 freq mayhem (6) - 5 freq marple (6) - 2 freq murther (6) - 28 freq merches (6) - 2 freq mumphed (6) - 1 freq |
SoundEx code - M615 marra-banes - 1 freq marvin - 7 freq morphine - 2 freq moribund - 2 freq morphemes - 13 freq morpheme - 10 freq morven - 2 freq morven's - 1 freq mervyn - 2 freq morvin - 2 freq €™marvin - 3 freq mairifaeinsch - 7 freq moirafin - 1 freq |
MetaPhone code - MRFM morpheme - 10 freq |
MORPHEME |
| Time to execute Levenshtein function - 0.256037 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.391688 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.027533 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.038640 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.000899 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. |