| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vernal (0) - 3 freq verbal (1) - 28 freq girnal (2) - 5 freq derval (2) - 17 freq bernam (2) - 1 freq jurnal (2) - 1 freq vernix (2) - 1 freq aerial (2) - 5 freq werna (2) - 13 freq herbal (2) - 5 freq wernae (2) - 13 freq ferfal (2) - 8 freq verball (2) - 1 freq verray (2) - 1 freq serial (2) - 3 freq veal (2) - 2 freq feral (2) - 5 freq fergal (2) - 1 freq yernan (2) - 1 freq cereal (2) - 15 freq vernon (2) - 1 freq kernel (2) - 1 freq verra (2) - 434 freq eternal (2) - 25 freq governal (2) - 3 freq |
vernal (0) - 3 freq verbal (2) - 28 freq vennel (3) - 16 freq eternal (3) - 25 freq viral (3) - 3 freq kernel (3) - 1 freq vernix (3) - 1 freq vernon (3) - 1 freq vernear (3) - 8 freq governal (3) - 3 freq jurnal (3) - 1 freq girnal (3) - 5 freq verily (4) - 2 freq veranda (4) - 5 freq vinyl (4) - 1 freq curnel (4) - 1 freq diurnal (4) - 1 freq varyan (4) - 1 freq virgil (4) - 1 freq verneer (4) - 5 freq varl (4) - 1 freq averill (4) - 1 freq virginal (4) - 2 freq veroli (4) - 5 freq vairdal (4) - 2 freq |
SoundEx code - V654 vermillion - 1 freq vernal - 3 freq |
MetaPhone code - FRNL freenly - 22 freq vernal - 3 freq fernlie - 1 freq frienly - 5 freq freinlie - 5 freq fernielea - 1 freq freenlie - 2 freq freinly - 3 freq |
VERNAL |
| Time to execute Levenshtein function - 0.200727 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.339896 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.027247 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.039258 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.000864 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. |