| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| messager (0) - 1 freq messages (1) - 148 freq messaged (1) - 3 freq message (1) - 157 freq messmer (2) - 1 freq messagin (2) - 5 freq massages (2) - 1 freq massage (2) - 17 freq messenger (2) - 33 freq massagin (3) - 2 freq messan (3) - 5 freq eager (3) - 27 freq merrage (3) - 1 freq messaging (3) - 1 freq lesser (3) - 30 freq maager (3) - 1 freq mainager (3) - 1 freq messes (3) - 1 freq passanger (3) - 1 freq teenager (3) - 24 freq messengers (3) - 6 freq messidge (3) - 1 freq messine (3) - 1 freq messeyge (3) - 2 freq passage (3) - 60 freq |
messager (0) - 1 freq message (2) - 157 freq messaged (2) - 3 freq messages (2) - 148 freq messenger (3) - 33 freq massage (3) - 17 freq messagin (3) - 5 freq massages (3) - 1 freq messmer (3) - 1 freq messageboy (4) - 1 freq messeyge (4) - 2 freq massagin (4) - 2 freq mefsgar (4) - 1 freq uissage (5) - 3 freq sassages (5) - 4 freq messed (5) - 8 freq gossamer (5) - 4 freq yesser (5) - 1 freq sassage (5) - 5 freq ossigar (5) - 1 freq mossgiel (5) - 1 freq maisser (5) - 1 freq meissure (5) - 1 freq messans (5) - 1 freq missure (5) - 1 freq |
SoundEx code - M226 massacre - 7 freq mussa-kruppen - 1 freq mceckron - 1 freq mceckron's - 1 freq musicker - 7 freq messager - 1 freq massackert - 1 freq maussacre - 1 freq maussacker - 1 freq mezzocheryl - 1 freq |
MetaPhone code - MSJR miesjir - 1 freq messager - 1 freq |
MESSAGER |
| Time to execute Levenshtein function - 0.624496 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.887016 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.093213 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.093249 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.000930 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. |