| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vdef (0) - 1 freq def (1) - 4 freq vex (2) - 6 freq jdea (2) - 1 freq idee (2) - 17 freq hsdef (2) - 1 freq veer (2) - 1 freq det (2) - 3 freq odf (2) - 1 freq veg (2) - 17 freq idea (2) - 550 freq gdeb (2) - 1 freq vdus (2) - 1 freq ade (2) - 3 freq vader (2) - 3 freq bref (2) - 1 freq vdgp (2) - 1 freq eden (2) - 36 freq dev (2) - 4 freq deef (2) - 43 freq dzf (2) - 1 freq hef (2) - 1 freq dec (2) - 9 freq deu (2) - 40 freq dof (2) - 1 freq |
vdef (0) - 1 freq def (2) - 4 freq deif (3) - 28 freq daef (3) - 1 freq deaf (3) - 27 freq defy (3) - 6 freq pdf (3) - 37 freq vf (3) - 1 freq vdcy (3) - 1 freq ldf (3) - 1 freq 'deif (3) - 1 freq qdf (3) - 1 freq video (3) - 105 freq bidef (3) - 1 freq defo (3) - 208 freq vevf (3) - 1 freq df (3) - 2 freq vdb (3) - 3 freq vdr (3) - 1 freq dif (3) - 1 freq kdf (3) - 1 freq vd (3) - 2 freq dof (3) - 1 freq rdf (3) - 3 freq odf (3) - 1 freq |
SoundEx code - V310 vdb - 3 freq vdef - 1 freq vtv - 1 freq |
MetaPhone code - FTF fatefu' - 1 freq fatefu - 5 freq fuitfaw - 1 freq fit've - 1 freq fit-faw - 1 freq fit'v - 1 freq fitfaa - 1 freq vdef - 1 freq vtv - 1 freq |
VDEF |
| Time to execute Levenshtein function - 0.279184 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.423975 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.029454 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.077355 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.000800 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. |