| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| veshels (0) - 2 freq vessels (1) - 6 freq veshel (1) - 1 freq vessel (2) - 7 freq vennels (2) - 12 freq feshes (2) - 1 freq bushels (2) - 1 freq feshers (2) - 1 freq eshes (2) - 6 freq benshees (3) - 2 freq coshes (3) - 1 freq venues (3) - 19 freq jeels (3) - 3 freq bennels (3) - 1 freq eeses (3) - 1 freq pushes (3) - 8 freq weeshes (3) - 1 freq sequels (3) - 2 freq hessel (3) - 9 freq 'esel' (3) - 2 freq penels (3) - 7 freq bevels (3) - 1 freq gushes (3) - 5 freq jewels (3) - 20 freq neshed (3) - 1 freq |
veshels (0) - 2 freq veshel (2) - 1 freq vessels (2) - 6 freq bushels (3) - 1 freq reishils (4) - 1 freq shiels (4) - 4 freq vassals (4) - 2 freq eshes (4) - 6 freq vessel (4) - 7 freq vennels (4) - 12 freq feshes (4) - 1 freq feshers (4) - 1 freq washes (5) - 10 freq ashets (5) - 14 freq washers (5) - 1 freq bushes (5) - 41 freq nashers (5) - 2 freq mesha's (5) - 1 freq shelfs (5) - 8 freq bushel (5) - 5 freq sheds (5) - 13 freq shews (5) - 5 freq bashes (5) - 1 freq dyshes (5) - 1 freq vessil (5) - 1 freq |
SoundEx code - V242 vehicles - 14 freq visualise - 1 freq vigils - 1 freq vocalized - 1 freq veshels - 2 freq vessels - 6 freq voiceless - 19 freq vassals - 2 freq visualises - 1 freq vyaachles - 1 freq vocalism - 1 freq |
MetaPhone code - FXLS facials - 2 freq veshels - 2 freq |
VESHELS |
| Time to execute Levenshtein function - 0.261448 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.564494 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.036114 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.042012 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.000879 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. |