| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wvjn (0) - 1 freq wjy (2) - 1 freq wuin (2) - 3 freq wfajn (2) - 1 freq wdjj (2) - 1 freq worn (2) - 59 freq rvjo (2) - 1 freq wjp (2) - 1 freq whyn (2) - 3 freq widn (2) - 4 freq winn (2) - 1 freq wj (2) - 4 freq wij (2) - 1 freq oven (2) - 51 freq wn (2) - 7 freq wyin (2) - 2 freq wqn (2) - 1 freq wavin (2) - 83 freq svjt (2) - 1 freq wjz (2) - 2 freq jn (2) - 11 freq wqj (2) - 1 freq dvon (2) - 1 freq vj (2) - 8 freq evan (2) - 12 freq |
wvjn (0) - 1 freq wivin (3) - 1 freq woven (3) - 12 freq wiven (3) - 1 freq wavin (3) - 83 freq wavan (3) - 9 freq wyvin (3) - 15 freq wfajn (3) - 1 freq avin (4) - 2 freq wxen (4) - 1 freq wtin (4) - 1 freq hven (4) - 1 freq fvn (4) - 1 freq wwjr (4) - 1 freq evn (4) - 1 freq wain (4) - 15 freq ev'n (4) - 1 freq tvnn (4) - 1 freq whun (4) - 92 freq von (4) - 1 freq wien (4) - 1 freq wv' (4) - 1 freq whan (4) - 2757 freq vhn (4) - 1 freq pvjzn (4) - 1 freq |
SoundEx code - W125 wahabbism - 1 freq wp-content - 1 freq wab-cams - 1 freq webcomradio - 6 freq wvjn - 1 freq wfajn - 1 freq |
MetaPhone code - FJN fidgin - 13 freq vaegin - 1 freq vaigin - 4 freq vigin - 1 freq vågen - 1 freq wvjn - 1 freq fjgn - 1 freq wfajn - 1 freq |
WVJN |
| Time to execute Levenshtein function - 0.493360 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.818669 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.063744 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.050947 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.001216 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. |