| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| morphine (0) - 2 freq morpheme (2) - 10 freq lorraine (3) - 6 freq morning (3) - 239 freq morpheus (3) - 1 freq marchin (3) - 24 freq morice (3) - 1 freq mornins (3) - 35 freq machine (3) - 166 freq moothie (3) - 4 freq morphed (3) - 1 freq murine (3) - 1 freq forthink (3) - 1 freq morn'in (3) - 1 freq morphemes (3) - 13 freq mornin' (3) - 16 freq moappin (3) - 1 freq mopin (3) - 1 freq mormin (3) - 2 freq porpoise (3) - 19 freq merchin (3) - 2 freq mumphin (3) - 1 freq forthie (3) - 1 freq moralise (3) - 1 freq orphaned (3) - 5 freq |
morphine (0) - 2 freq morpheme (3) - 10 freq morph (4) - 1 freq merchin (4) - 2 freq mumphin (4) - 1 freq orphan (4) - 14 freq morpheus (4) - 1 freq marchin (4) - 24 freq morphed (4) - 1 freq moshin (5) - 1 freq morvin (5) - 2 freq mornnin (5) - 1 freq moothin (5) - 3 freq dolphin (5) - 5 freq rhine (5) - 2 freq morin (5) - 2 freq moupin (5) - 1 freq megaphone (5) - 5 freq mairchin (5) - 35 freq truphane (5) - 2 freq marchen (5) - 1 freq josephine (5) - 11 freq moonshine (5) - 1 freq marine (5) - 15 freq marching (5) - 6 freq |
SoundEx code - M615 marra-banes - 1 freq marvin - 8 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 - MRFN marvin - 8 freq morphine - 2 freq morven - 2 freq mervyn - 2 freq morvin - 2 freq €™marvin - 3 freq moirafin - 1 freq |
MORPHINE |
| Time to execute Levenshtein function - 0.238996 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.440485 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.027601 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.037951 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.000968 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. |