| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vernear (0) - 8 freq ver-near (1) - 1 freq verneer (1) - 5 freq ver'near (1) - 1 freq werner (2) - 1 freq verdean (2) - 3 freq geynear (2) - 2 freq vernal (2) - 3 freq veinegar (2) - 1 freq veenegar (2) - 1 freq veneer (2) - 1 freq fernyear (2) - 5 freq herned (3) - 1 freq denar (3) - 1 freq bermeal (3) - 1 freq verges (3) - 5 freq werna (3) - 13 freq 'near (3) - 1 freq burner (3) - 3 freq verdur (3) - 1 freq cereal (3) - 15 freq verie (3) - 23 freq terzer (3) - 1 freq drear (3) - 10 freq fernyeir (3) - 1 freq |
vernear (0) - 8 freq verneer (1) - 5 freq ver-near (2) - 1 freq ver'near (2) - 1 freq veneer (3) - 1 freq vernal (3) - 3 freq fernyear (3) - 5 freq werner (3) - 1 freq warner (4) - 1 freq veranda (4) - 5 freq girner (4) - 1 freq verrier (4) - 1 freq horner (4) - 2 freq venera (4) - 2 freq guverner (4) - 1 freq learner (4) - 8 freq corner (4) - 324 freq verra (4) - 436 freq sorner (4) - 3 freq fernyeir (4) - 1 freq earner (4) - 2 freq vernix (4) - 1 freq verray (4) - 1 freq overseer (4) - 2 freq verandae (4) - 1 freq |
SoundEx code - V656 ver-near - 1 freq verneer - 5 freq vernear - 8 freq ver'near - 1 freq |
MetaPhone code - FRNR ver-near - 1 freq verneer - 5 freq vernear - 8 freq forin'er - 1 freq ver'near - 1 freq furriner - 1 freq furrener - 1 freq |
VERNEAR |
| Time to execute Levenshtein function - 0.316234 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.774703 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.083545 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.038398 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.001008 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. |