| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vehicles (0) - 14 freq vehicle (1) - 15 freq cemicles (2) - 1 freq vehichle (2) - 2 freq quhiles (3) - 3 freq pendicles (3) - 1 freq ventricles (3) - 1 freq veice (3) - 2 freq eccles (3) - 1 freq cubicles (3) - 5 freq 'whiles (3) - 2 freq vwehacle (3) - 1 freq devices (3) - 8 freq veils (3) - 3 freq vehicul (3) - 1 freq whiles (3) - 479 freq icicles (3) - 6 freq voicees (3) - 1 freq achilles (3) - 5 freq articles (3) - 24 freq chices (3) - 1 freq venice (3) - 11 freq testicles (3) - 1 freq iceicles (3) - 1 freq voices (3) - 113 freq |
vehicles (0) - 14 freq vehicle (2) - 15 freq vehichle (4) - 2 freq vehicul (4) - 1 freq cemicles (4) - 1 freq voicees (5) - 1 freq icicles (5) - 6 freq achilles (5) - 5 freq whiles (5) - 479 freq articles (5) - 24 freq iceicles (5) - 1 freq chices (5) - 1 freq voices (5) - 113 freq vices (5) - 12 freq eccles (5) - 1 freq quhiles (5) - 3 freq cubicles (5) - 5 freq veils (5) - 3 freq vwehacle (5) - 1 freq chiels (6) - 112 freq vigils (6) - 1 freq hales (6) - 1 freq chuckles (6) - 5 freq nicoles (6) - 1 freq whirlies (6) - 2 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.480700 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.893814 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.095586 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.104863 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.001411 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. |