| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vievely (0) - 1 freq stievely (2) - 13 freq vieve (2) - 14 freq lively (2) - 10 freq leevels (3) - 1 freq steively (3) - 1 freq teely (3) - 1 freq widely (3) - 25 freq eely (3) - 2 freq seevety (3) - 1 freq vitally (3) - 1 freq evelyn (3) - 1 freq 'peely (3) - 1 freq reely (3) - 9 freq vaguely (3) - 7 freq lovely (3) - 165 freq bienly (3) - 7 freq vigilly (3) - 1 freq divvel (3) - 4 freq wisely (3) - 8 freq divvels (3) - 2 freq trevels (3) - 4 freq jeely (3) - 46 freq epely (3) - 1 freq everly (3) - 1 freq |
vievely (0) - 1 freq vieve (3) - 14 freq lively (3) - 10 freq lovely (4) - 165 freq vaguely (4) - 7 freq level (4) - 148 freq luvely (4) - 9 freq divvel (4) - 4 freq ivvery (4) - 74 freq veeve (4) - 5 freq verily (4) - 2 freq vievie (4) - 1 freq evenly (4) - 5 freq revel (4) - 2 freq yivvery (4) - 1 freq everly (4) - 1 freq itvel (4) - 1 freq vividly (4) - 2 freq livvel (4) - 2 freq stievely (4) - 13 freq valley (5) - 48 freq vivid (5) - 16 freq overly (5) - 6 freq vil (5) - 2 freq kevil (5) - 1 freq |
SoundEx code - V140 viable - 11 freq vievely - 1 freq |
MetaPhone code - FFL fuffle - 1 freq vievely - 1 freq fuffily - 1 freq fufil - 2 freq fuffle - 1 freq fvly - 1 freq fvl - 1 freq |
VIEVELY |
| Time to execute Levenshtein function - 0.790276 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 - 1.500873 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.100305 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.185641 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.001256 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. |