| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| malversautioun (0) - 1 freq conversaetion (5) - 2 freq sensautioun (5) - 1 freq compensautioun (5) - 1 freq alteration (5) - 1 freq eonversation (5) - 2 freq conversation (5) - 144 freq narrautioun (5) - 1 freq moderation (6) - 4 freq palmerston (6) - 2 freq mautioun (6) - 1 freq alterations (6) - 1 freq habitautioun (6) - 2 freq toleration (6) - 2 freq operatioun (6) - 1 freq malediction (6) - 2 freq salvation (6) - 17 freq imaiginautioun (6) - 1 freq bulderation (6) - 1 freq generatioun (6) - 1 freq aberration (6) - 2 freq variautiouns (6) - 1 freq assertioun (6) - 2 freq maturation (6) - 1 freq celebratioun (6) - 1 freq |
malversautioun (0) - 1 freq malversit (7) - 1 freq conversation (7) - 144 freq eonversation (7) - 2 freq conversaetion (7) - 2 freq alteration (8) - 1 freq convirsation (8) - 12 freq palmerston (8) - 2 freq celebratioun (9) - 1 freq diversioun (9) - 1 freq maturation (9) - 1 freq moaderation (9) - 2 freq aversion (9) - 4 freq malverse (9) - 2 freq molestin (9) - 1 freq memorisation (9) - 1 freq versioun (9) - 1 freq alternatin (9) - 1 freq conversations (9) - 27 freq toleration (9) - 2 freq sensautioun (9) - 1 freq narrautioun (9) - 1 freq moderation (9) - 4 freq salvation (9) - 17 freq malediction (9) - 2 freq |
SoundEx code - M416 millburn - 2 freq maelbrighte - 8 freq moulboord - 1 freq millport - 1 freq mulberry - 4 freq malversit - 1 freq malfranteaux - 1 freq millbrex - 1 freq malverse - 2 freq malversautioun - 1 freq melbourne - 2 freq maelebir - 2 freq |
MetaPhone code - MLFRSXN malversautioun - 1 freq |
MALVERSAUTIOUN |
| Time to execute Levenshtein function - 0.241465 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.394902 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.030354 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.039894 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.001073 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. |