| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| multipheation (0) - 1 freq multiplication (3) - 3 freq mutilation (4) - 2 freq cultivation (4) - 2 freq multiplications (4) - 1 freq mutation (5) - 1 freq justification (5) - 3 freq manipulation (5) - 2 freq mystification (5) - 3 freq multinational (5) - 3 freq mitigation (5) - 2 freq culmination (5) - 3 freq multiplyin (5) - 2 freq multigrain (5) - 2 freq multi-national (5) - 1 freq mortification (5) - 2 freq motivation (5) - 11 freq multi-million (5) - 2 freq gratification (6) - 1 freq modrification (6) - 1 freq meditaetion (6) - 1 freq certification (6) - 1 freq migration (6) - 10 freq muster-station (6) - 1 freq multiplied (6) - 2 freq |
multipheation (0) - 1 freq multiplication (5) - 3 freq multiplyin (7) - 2 freq multiplications (7) - 1 freq cultivation (7) - 2 freq mutilation (7) - 2 freq multigrain (8) - 2 freq mortification (8) - 2 freq multipliet (8) - 1 freq mleighton (8) - 2 freq motivation (8) - 11 freq multi-national (8) - 1 freq manipulation (8) - 2 freq mystification (8) - 3 freq multinational (8) - 3 freq mitigation (8) - 2 freq mutation (8) - 1 freq alanheaton (9) - 1 freq masticatin (9) - 1 freq multiplies (9) - 1 freq maturation (9) - 1 freq motivatin (9) - 2 freq multiplees (9) - 1 freq alliteration (9) - 5 freq molocation (9) - 1 freq |
SoundEx code - M431 multipheation - 1 freq multiple - 22 freq multifaceted - 1 freq multiply - 9 freq multiplication - 3 freq multiplyin - 2 freq multi-player - 4 freq multiverse - 2 freq multiversal - 1 freq molotov - 2 freq multiplies - 1 freq multiplied - 2 freq multiplications - 1 freq multiplication-table - 1 freq multipliet - 1 freq multiplees - 1 freq multi-volume - 1 freq 'multiple - 1 freq multipurpose - 1 freq moldefotball - 1 freq muldb - 1 freq |
MetaPhone code - MLTFXN multipheation - 1 freq |
MULTIPHEATION |
| Time to execute Levenshtein function - 0.224037 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.440058 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.034680 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.039380 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.001002 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. |