| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| malversit (0) - 1 freq ramversit (2) - 1 freq malverse (2) - 2 freq alertit (3) - 2 freq adversity (3) - 7 freq versity (4) - 11 freq manderson (4) - 1 freq avengit (4) - 2 freq aiverie (4) - 3 freq faltert (4) - 1 freq salveific (4) - 1 freq taiver't (4) - 1 freq talentit (4) - 6 freq deleerit (4) - 8 freq mairkit (4) - 4 freq apperit (4) - 3 freq lerrit (4) - 2 freq favorit (4) - 2 freq aalest (4) - 4 freq walterson (4) - 1 freq saeperit (4) - 6 freq reveesit (4) - 1 freq deliverit (4) - 4 freq mairrit (4) - 59 freq aversion (4) - 4 freq |
malversit (0) - 1 freq malverse (3) - 2 freq ramversit (4) - 1 freq adversity (5) - 7 freq marst (6) - 1 freq mailers (6) - 1 freq diversity (6) - 73 freq silverside (6) - 1 freq university (6) - 130 freq cleverest (6) - 4 freq alertit (6) - 2 freq versity (6) - 11 freq deliverit (6) - 4 freq pulverisin (6) - 1 freq aaldest (7) - 8 freq walkers' (7) - 1 freq pleasit (7) - 5 freq malayasia (7) - 1 freq marlit (7) - 1 freq margit (7) - 32 freq adverse (7) - 1 freq harvest (7) - 16 freq maves (7) - 8 freq maddest (7) - 3 freq cavers (7) - 6 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 - MLFRST malversit - 1 freq |
MALVERSIT |
| Time to execute Levenshtein function - 0.203426 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.381887 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.030236 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.037458 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.000863 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. |