| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| variation (0) - 18 freq variations (1) - 16 freq narration (2) - 1 freq radiation (2) - 3 freq validation (2) - 2 freq vacation (2) - 2 freq carnation (2) - 3 freq duration (3) - 5 freq vibration (3) - 4 freq oration (3) - 1 freq variautiouns (3) - 1 freq partition (3) - 4 freq vaccination (3) - 1 freq irrigation (3) - 1 freq validatin (3) - 1 freq mediation (3) - 4 freq sanitation (3) - 4 freq salvation (3) - 17 freq vairsion (3) - 20 freq evacuation (3) - 1 freq radiatin (3) - 3 freq norration (3) - 1 freq fantation (3) - 2 freq irritation (3) - 4 freq taxation (3) - 3 freq |
variation (0) - 18 freq variations (2) - 16 freq vacation (3) - 2 freq creation (4) - 25 freq vreitin (4) - 1 freq evacuation (4) - 1 freq varieties (4) - 43 freq volition (4) - 2 freq vairsion (4) - 20 freq vexation (4) - 5 freq ration (4) - 5 freq vocation (4) - 2 freq evaluation (4) - 3 freq vreetin (4) - 2 freq validation (4) - 2 freq carnation (4) - 3 freq duration (4) - 5 freq oration (4) - 1 freq radiation (4) - 3 freq narration (4) - 1 freq vibration (4) - 4 freq variautiouns (4) - 1 freq pairtin (5) - 19 freq britian (5) - 1 freq veritie (5) - 3 freq |
SoundEx code - V635 variations - 16 freq variation - 18 freq verdean - 3 freq verdant - 7 freq vreetin' - 1 freq vreetin - 2 freq vritten - 3 freq variautiouns - 1 freq vvreitin - 1 freq vreitin - 1 freq vreiten - 1 freq vrutten - 5 freq vrythin - 1 freq vreetins - 1 freq virtanen - 1 freq |
MetaPhone code - FRXN frisian - 29 freq version - 145 freq vairsioun - 17 freq variation - 18 freq freshen - 3 freq feerichin - 1 freq fresian - 4 freq versioun - 1 freq fruition - 2 freq vershun - 2 freq vairsion - 20 freq varshini - 16 freq friesian - 1 freq |
VARIATION |
| Time to execute Levenshtein function - 0.208560 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.387980 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.028556 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.038990 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.000926 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. |