| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| valediction (0) - 1 freq malediction (1) - 2 freq maledictions (2) - 1 freq benediction (3) - 4 freq prediction (3) - 6 freq €˜malediction (3) - 3 freq addiction (3) - 9 freq validation (3) - 2 freq valedictory (3) - 2 freq mediation (4) - 4 freq election (4) - 87 freq predication (4) - 4 freq abduction (4) - 1 freq predictions (4) - 3 freq eviction (4) - 2 freq diction (4) - 9 freq audition (4) - 8 freq sedition (4) - 7 freq radiation (4) - 3 freq dedication (4) - 8 freq eriction (4) - 1 freq affliction (4) - 6 freq expedition (4) - 3 freq addictions (4) - 4 freq variation (4) - 18 freq |
valediction (0) - 1 freq malediction (2) - 2 freq valedictory (4) - 2 freq maledictions (4) - 1 freq validation (4) - 2 freq validatin (5) - 1 freq vindication (5) - 4 freq addiction (5) - 9 freq prediction (5) - 6 freq benediction (5) - 4 freq seduction (6) - 2 freq medication (6) - 8 freq volition (6) - 2 freq valencian (6) - 6 freq abdication (6) - 1 freq predictin (6) - 2 freq selection (6) - 28 freq reduction (6) - 3 freq edication (6) - 3 freq eaceducation (6) - 17 freq valedeictorie (6) - 1 freq abduction (6) - 1 freq predication (6) - 4 freq election (6) - 87 freq €˜malediction (6) - 3 freq |
SoundEx code - V432 volts - 3 freq vaults - 2 freq violet's - 19 freq violets - 16 freq valedictory - 2 freq violets' - 1 freq 'violets - 1 freq voltage - 2 freq valediction - 1 freq vaults' - 1 freq valedeictorie - 1 freq vilots - 1 freq |
MetaPhone code - FLTKXN valediction - 1 freq |
VALEDICTION |
| Time to execute Levenshtein function - 0.259560 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.442366 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.029514 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.043861 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.005837 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. |