| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| veridical (0) - 1 freq vertical (2) - 21 freq periodical (2) - 3 freq radical (3) - 63 freq veronica (3) - 3 freq verdict (3) - 30 freq verdick (3) - 1 freq critical (3) - 19 freq teipical (3) - 4 freq medical (3) - 67 freq meridian (3) - 1 freq verticals (3) - 1 freq €˜radical (3) - 1 freq melodical (3) - 1 freq periodicals (3) - 2 freq virginal (4) - 2 freq creitical (4) - 5 freq bridal (4) - 4 freq vehicul (4) - 1 freq trivial (4) - 3 freq meinimal (4) - 1 freq metrical (4) - 1 freq lyrical (4) - 5 freq germinal (4) - 2 freq verucca (4) - 2 freq |
veridical (0) - 1 freq periodical (3) - 3 freq vertical (3) - 21 freq verdick (4) - 1 freq verdict (4) - 30 freq radical (4) - 63 freq melodical (5) - 1 freq €˜radical (5) - 1 freq ridicule (5) - 7 freq verticals (5) - 1 freq periodicals (5) - 2 freq veronica (5) - 3 freq radiecal (5) - 1 freq critical (5) - 19 freq medical (5) - 67 freq tropical (6) - 6 freq farcical (6) - 2 freq veruca (6) - 39 freq prodigal (6) - 3 freq piratical (6) - 1 freq vairdal (6) - 2 freq periodically (6) - 3 freq verbal (6) - 28 freq vernal (6) - 3 freq cardinal (6) - 6 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 - FRTKL vertical - 21 freq veridical - 1 freq |
VERIDICAL |
| Time to execute Levenshtein function - 0.191420 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.412898 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.027326 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.037348 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.001013 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. |