| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| verteego (0) - 1 freq vertigo (2) - 1 freq perteign (3) - 2 freq vertie (3) - 1 freq vertew (3) - 1 freq vertue's (3) - 1 freq vertewis (3) - 1 freq verneer (3) - 5 freq vertue (3) - 2 freq curteen (4) - 1 freq meeteen (4) - 5 freq pertners (4) - 1 freq vetoed (4) - 1 freq pertner (4) - 2 freq tertio (4) - 1 freq setee (4) - 1 freq virtue (4) - 15 freq enteer (4) - 2 freq hertie's (4) - 2 freq certie (4) - 4 freq hertened (4) - 1 freq versie (4) - 1 freq vertish (4) - 1 freq everyeen (4) - 4 freq everee (4) - 1 freq |
verteego (0) - 1 freq vertigo (2) - 1 freq vertew (4) - 1 freq vertie (4) - 1 freq vertue (4) - 2 freq verge (5) - 9 freq vreet (5) - 1 freq virtue (5) - 15 freq veritie (5) - 3 freq vert (5) - 1 freq vortex (5) - 2 freq vestige (5) - 1 freq cortege (5) - 1 freq vertue's (5) - 1 freq perteign (5) - 2 freq vertewis (5) - 1 freq verneer (5) - 5 freq virtues (5) - 7 freq virgo (5) - 1 freq kertie (6) - 2 freq bertie (6) - 28 freq overseen (6) - 1 freq pertie (6) - 6 freq ergo (6) - 1 freq kerted (6) - 1 freq |
SoundEx code - V632 verdict - 30 freq vratch - 26 freq vertical - 21 freq varieties - 43 freq vratches - 5 freq virtuous - 3 freq verdick - 1 freq virtues - 7 freq verdigris - 2 freq vertiginous - 1 freq varday's - 1 freq virtuosity - 1 freq vratched - 2 freq vertue's - 1 freq vreits - 1 freq vortex - 2 freq veridical - 1 freq vratchies - 1 freq vratchie - 1 freq vertical-striped - 1 freq verdicchio - 1 freq verticals - 1 freq vertigo - 1 freq vertewis - 1 freq verteego - 1 freq veritas - 1 freq vertish - 1 freq |
MetaPhone code - FRTK feart-hke - 2 freq verdick - 1 freq fortig - 1 freq vertigo - 1 freq verteego - 1 freq |
VERTEEGO |
| Time to execute Levenshtein function - 0.221995 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.431972 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.028918 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.040979 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.001082 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. |