| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vehicles (0) - 14 freq vehicle (1) - 15 freq vehichle (2) - 2 freq cemicles (2) - 1 freq iceicles (3) - 1 freq cubicles (3) - 5 freq vices (3) - 12 freq pendicles (3) - 1 freq whiles (3) - 478 freq achilles (3) - 5 freq ehicken (3) - 1 freq vwehacle (3) - 1 freq venice (3) - 11 freq icicles (3) - 6 freq ventricles (3) - 1 freq resiles (3) - 1 freq quhiles (3) - 3 freq veice (3) - 2 freq articles (3) - 23 freq exiles (3) - 4 freq 'whiles (3) - 2 freq veiled (3) - 3 freq testicles (3) - 1 freq sevices (3) - 1 freq voices (3) - 110 freq |
vehicles (0) - 14 freq vehicle (2) - 15 freq vehicul (4) - 1 freq cemicles (4) - 1 freq vehichle (4) - 2 freq voices (5) - 110 freq articles (5) - 23 freq quhiles (5) - 3 freq eccles (5) - 1 freq chices (5) - 1 freq icicles (5) - 6 freq veils (5) - 3 freq iceicles (5) - 1 freq whiles (5) - 478 freq vices (5) - 12 freq cubicles (5) - 5 freq achilles (5) - 5 freq vwehacle (5) - 1 freq chiels (6) - 110 freq hanles (6) - 1 freq vyces (6) - 61 freq choices (6) - 26 freq chimleys (6) - 1 freq hailes (6) - 3 freq huckles (6) - 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 - FHKLS vehicles - 14 freq |
VEHICLES |
| Time to execute Levenshtein function - 0.183807 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.345835 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.027635 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.037136 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.000813 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. |