| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| verdict (0) - 30 freq verdick (1) - 1 freq herdit (2) - 8 freq edict (2) - 2 freq verdant (2) - 7 freq verdi (2) - 1 freq wirdit (3) - 1 freq weirdich (3) - 5 freq servit (3) - 8 freq beardit (3) - 2 freq beirdit (3) - 1 freq sendit (3) - 1 freq lerrit (3) - 2 freq verity (3) - 2 freq vertical (3) - 21 freq verish (3) - 1 freq herkint (3) - 1 freq heroic (3) - 8 freq derelict (3) - 2 freq yerkit (3) - 3 freq versity (3) - 11 freq herrit (3) - 1 freq merkit (3) - 31 freq erica (3) - 1 freq ferriet (3) - 1 freq |
verdict (0) - 30 freq verdick (2) - 1 freq verdant (3) - 7 freq veridical (4) - 1 freq edict (4) - 2 freq predict (4) - 4 freq verdi (4) - 1 freq herdit (4) - 8 freq yirdit (5) - 29 freq vricht (5) - 6 freq product (5) - 37 freq varit (5) - 1 freq erect (5) - 3 freq readit (5) - 3 freq verucca (5) - 2 freq verdure (5) - 1 freq vorlich (5) - 1 freq perfect (5) - 170 freq geordic (5) - 1 freq versant (5) - 2 freq weirdit (5) - 5 freq verde (5) - 2 freq bordit (5) - 1 freq veronica (5) - 3 freq verdur (5) - 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 - FRTKT verdict - 30 freq |
VERDICT |
| Time to execute Levenshtein function - 0.205077 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.400462 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.027284 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.040784 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.001028 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. |