| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| verily (0) - 2 freq eerily (1) - 1 freq verity (1) - 2 freq verify (1) - 2 freq jerkily (2) - 1 freq drily (2) - 1 freq wrily (2) - 1 freq veiny (2) - 2 freq versify (2) - 1 freq perils (2) - 2 freq wearily (2) - 1 freq aprily (2) - 2 freq hertily (2) - 2 freq emily (2) - 11 freq verish (2) - 1 freq warily (2) - 3 freq femily (2) - 21 freq verray (2) - 1 freq aerly (2) - 19 freq veiry (2) - 1 freq merely (2) - 12 freq veroli (2) - 5 freq ferrly (2) - 28 freq verie (2) - 23 freq ferly (2) - 20 freq |
verily (0) - 2 freq everly (2) - 1 freq veroli (2) - 5 freq overly (2) - 6 freq verify (2) - 2 freq verity (2) - 2 freq eerily (2) - 1 freq everilk (3) - 1 freq very (3) - 698 freq erly (3) - 3 freq ferly (3) - 20 freq verie (3) - 23 freq veil (3) - 25 freq peril (3) - 7 freq varl (3) - 1 freq viral (3) - 3 freq merely (3) - 12 freq versy (3) - 1 freq eraly (3) - 1 freq averill (3) - 1 freq overtly (3) - 1 freq wearily (3) - 1 freq wrily (3) - 1 freq drily (3) - 1 freq aprily (3) - 2 freq |
SoundEx code - V640 veroli - 5 freq viral' - 1 freq verily - 2 freq viral - 3 freq varl - 1 freq vrlh - 1 freq |
MetaPhone code - FRL ferlie - 96 freq far'll - 3 freq feirlie - 1 freq fairly - 235 freq freely - 28 freq 'fairly - 2 freq fairlie - 19 freq farel - 1 freq veroli - 5 freq frail - 18 freq ferly - 20 freq farl - 5 freq frilly - 8 freq fire'll - 2 freq viral' - 1 freq feral - 6 freq freelie - 3 freq verily - 2 freq viral - 3 freq furl - 6 freq ferrly - 28 freq 'far'll - 1 freq fairley - 1 freq farrell - 1 freq furly - 10 freq ferlee - 2 freq varl - 1 freq vrlh - 1 freq |
VERILY |
| Time to execute Levenshtein function - 0.183721 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.341898 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.027096 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.037738 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.000894 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. |