Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
vegetable (0) - 15 freq vegetables (1) - 23 freq veritable (2) - 2 freq venerable (2) - 1 freq vejitable (2) - 1 freq renewable (3) - 3 freq delectable (3) - 1 freq deeable (3) - 1 freq relatable (3) - 3 freq vegetative (3) - 2 freq tea-table (3) - 1 freq detectable (3) - 2 freq peetiable (3) - 2 freq timetable (3) - 13 freq debatable (3) - 1 freq regrettable (3) - 1 freq heritable (3) - 4 freq vegetable-or (3) - 1 freq reperable (3) - 1 freq veluable (3) - 3 freq seeable (3) - 1 freq repeatable (3) - 1 freq reputable (3) - 3 freq veesible (3) - 4 freq peaceable (4) - 2 freq |
vegetable (0) - 15 freq vegetables (2) - 23 freq vejitable (3) - 1 freq veritable (3) - 2 freq venerable (4) - 1 freq heritable (5) - 4 freq debatable (5) - 1 freq vegetable-or (5) - 1 freq veesible (5) - 4 freq timetable (5) - 13 freq repeatable (5) - 1 freq veluable (5) - 3 freq reputable (5) - 3 freq relatable (5) - 3 freq vestibule (5) - 3 freq vegetative (5) - 2 freq peetiable (5) - 2 freq tea-table (5) - 1 freq stable (6) - 71 freq suitable (6) - 13 freq vegetation (6) - 6 freq i'table (6) - 1 freq greeable (6) - 4 freq teeble (6) - 6 freq sitable (6) - 2 freq |
SoundEx code - V231 vegetable - 15 freq vegetables - 23 freq vestibule - 3 freq vejitable - 1 freq vegitabil's - 1 freq vocative - 1 freq vegetable-or - 1 freq visitabdn - 11 freq visitabdnbt - 6 freq vwxdpfeedq - 1 freq visitportrush - 1 freq vstwfcebt - 1 freq |
MetaPhone code - FJTBL vegetable - 15 freq vejitable - 1 freq |
VEGETABLE |
Time to execute Levenshtein function - 0.210944 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.352768 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.028524 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.038178 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.000871 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. |