| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yvj (0) - 1 freq tvj (1) - 2 freq yvh (1) - 1 freq yj (1) - 5 freq yv (1) - 1 freq vj (1) - 8 freq yvb (1) - 1 freq yyj (1) - 1 freq nj (2) - 4 freq cvh (2) - 1 freq qj (2) - 3 freq y'm (2) - 1 freq va (2) - 5 freq qyvf (2) - 1 freq yle (2) - 2 freq yf (2) - 4 freq fvl (2) - 1 freq xvq (2) - 1 freq wqj (2) - 1 freq yih (2) - 4 freq yec (2) - 1 freq vn (2) - 2 freq vx (2) - 5 freq hv (2) - 4 freq yl (2) - 4 freq |
yvj (0) - 1 freq vj (1) - 8 freq yyj (2) - 1 freq vjo (2) - 1 freq tvj (2) - 2 freq yvb (2) - 1 freq yvh (2) - 1 freq yj (2) - 5 freq yv (2) - 1 freq vs (3) - 22 freq dj (3) - 24 freq vc (3) - 8 freq hyj (3) - 1 freq vk (3) - 5 freq v (3) - 266 freq 'j (3) - 3 freq aj (3) - 6 freq hj (3) - 2 freq vg (3) - 3 freq vv (3) - 1 freq vp (3) - 4 freq yiv' (3) - 1 freq ovd (3) - 3 freq uhj (3) - 2 freq uvu (3) - 1 freq |
SoundEx code - Y120 yps - 1 freq yobs - 1 freq yaps - 1 freq yabbs - 1 freq yips - 1 freq yaffs - 1 freq yvyc - 1 freq yhybys - 1 freq yipzyw - 1 freq ypke - 1 freq yvbpygg - 1 freq yifoox - 1 freq yvj - 1 freq ypq - 1 freq yfchuuu - 1 freq ybqx - 1 freq ybees - 1 freq ybius - 1 freq yvxjx - 1 freq |
MetaPhone code - FJ fodge - 6 freq fugie - 4 freq vogie - 3 freq fidgie - 1 freq vaige - 13 freq fadge - 8 freq fudge - 18 freq fudgie - 4 freq fidge - 9 freq vaege - 3 freq veage - 9 freq fidgy - 1 freq vj - 8 freq fuji - 1 freq viage - 1 freq viage- - 1 freq veige - 2 freq feejee - 2 freq fiji - 1 freq vogey - 1 freq fogie - 1 freq fj - 2 freq vjo - 1 freq fage - 1 freq veej - 1 freq fju - 1 freq fgi - 1 freq vjh - 1 freq yvj - 1 freq fja - 1 freq |
YVJ |
| Time to execute Levenshtein function - 0.179683 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.342811 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.028985 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.037535 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.000797 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. |