Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
xvdh (0) - 1 freq uydh (2) - 1 freq dh (2) - 1 freq hvd (2) - 1 freq xdc (2) - 1 freq mvsh (2) - 1 freq hvhh (2) - 1 freq xv (2) - 6 freq vvh (2) - 1 freq vdb (2) - 3 freq xvud (2) - 1 freq ahdh (2) - 1 freq tvah (2) - 1 freq evdy (2) - 7 freq vd (2) - 2 freq tvh (2) - 1 freq xkd (2) - 1 freq svph (2) - 1 freq mvd (2) - 1 freq dvds (2) - 3 freq xmd (2) - 1 freq xh (2) - 6 freq nvch (2) - 1 freq gdh (2) - 2 freq dvd (2) - 11 freq |
xvdh (0) - 1 freq xvud (3) - 1 freq xvk (4) - 1 freq wwdh (4) - 1 freq jdh (4) - 1 freq vwdh (4) - 1 freq cvh (4) - 1 freq cvda (4) - 1 freq dvd' (4) - 1 freq xvq (4) - 1 freq vdr (4) - 1 freq vuh (4) - 1 freq xvii (4) - 1 freq xnvah (4) - 1 freq xvo (4) - 1 freq xvi (4) - 3 freq xd (4) - 4 freq aidh (4) - 1 freq vjh (4) - 1 freq xmds (4) - 1 freq vh (4) - 4 freq dvh (4) - 1 freq xcd (4) - 1 freq ovd (4) - 3 freq yvh (4) - 1 freq |
SoundEx code - X130 xvdh - 1 freq xwvt - 1 freq xvud - 1 freq |
MetaPhone code - SFT saft - 293 freq sought - 10 freq sight - 134 freq soaft - 2 freq sighed - 115 freq safety - 62 freq 'saftie' - 1 freq sauftie - 4 freq saved - 87 freq saufty - 3 freq seevety - 1 freq saufed - 6 freq soft - 52 freq sauved - 4 freq soughit - 3 freq sauvit - 1 freq saughit - 1 freq saiftay - 1 freq seafood - 6 freq soviet - 14 freq sughut - 2 freq 'soviet' - 1 freq savit - 6 freq sea-höved - 1 freq sift - 6 freq saefty - 1 freq softie - 3 freq saaft - 5 freq 'saft - 3 freq sowff't - 1 freq saught - 1 freq saufit - 1 freq savitie - 2 freq savetie - 2 freq saftey - 1 freq soughed - 1 freq sauft - 1 freq sieved - 1 freq €˜saft - 1 freq sauftey - 2 freq saftie - 2 freq xvdh - 1 freq yyysvdi - 1 freq xwvt - 1 freq xvud - 1 freq |
XVDH |
Time to execute Levenshtein function - 0.245370 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.340665 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.027478 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.041880 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.000939 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. |