Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
verdicchio (0) - 1 freq ferruccio (4) - 2 freq verdict (4) - 30 freq seriechin (4) - 1 freq jericho (4) - 9 freq verdigris (4) - 2 freq verdick (4) - 1 freq edication (5) - 3 freq dichit (5) - 1 freq skreichin (5) - 11 freq weirdich (5) - 5 freq servicemin (5) - 1 freq eriction (5) - 1 freq skraichit (5) - 1 freq crinchin (5) - 1 freq preichin (5) - 1 freq skraichin (5) - 16 freq iveriethin (5) - 13 freq oversicht (5) - 1 freq verticals (5) - 1 freq veictim (5) - 1 freq keichin (5) - 1 freq owerairchin (5) - 3 freq seirchin (5) - 1 freq scraichin (5) - 8 freq |
verdicchio (0) - 1 freq verdick (6) - 1 freq verdict (6) - 30 freq vratchie (7) - 1 freq veridical (7) - 1 freq vorlich (7) - 1 freq verucca (7) - 2 freq weirdich (7) - 5 freq redrichie (7) - 1 freq jericho (7) - 9 freq verdigris (7) - 2 freq ferruccio (7) - 2 freq reachio (8) - 1 freq richie (8) - 2 freq ritchie (8) - 2 freq vertical (8) - 21 freq seraich (8) - 1 freq aberdinho (8) - 1 freq vratch (8) - 26 freq vernaclir (8) - 1 freq oorichie (8) - 1 freq murdoch (8) - 18 freq ardoch (8) - 2 freq vindication (8) - 4 freq crichie (8) - 4 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 - FRTKX verdicchio - 1 freq |
VERDICCHIO |
Time to execute Levenshtein function - 0.226504 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.437163 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.029504 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.039309 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.000976 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. |