| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vuzcfm (0) - 1 freq vuajf (3) - 1 freq cuzco (3) - 1 freq outcam (3) - 1 freq uxfm (3) - 1 freq zczofm (3) - 1 freq vaccum (3) - 1 freq upcum (3) - 2 freq wuzf (3) - 1 freq vcm (3) - 1 freq outcum (3) - 1 freq cfm (3) - 1 freq vgcf (3) - 1 freq vzvfy (3) - 1 freq vhfm (3) - 1 freq fuckt (4) - 2 freq mutch (4) - 1 freq humpf (4) - 1 freq quiche (4) - 3 freq autism (4) - 3 freq lzfwfm (4) - 1 freq wurc (4) - 1 freq huffs (4) - 2 freq cfp (4) - 2 freq ducts (4) - 4 freq |
vuzcfm (0) - 1 freq vcm (5) - 1 freq vgcf (5) - 1 freq vhfm (5) - 1 freq vaccum (5) - 1 freq vzvfy (5) - 1 freq cfm (5) - 1 freq zczofm (5) - 1 freq vacuum (6) - 5 freq upcum (6) - 2 freq victim (6) - 29 freq veictim (6) - 1 freq vuajf (6) - 1 freq cuzco (6) - 1 freq outcam (6) - 1 freq wuzf (6) - 1 freq outcum (6) - 1 freq vaccuum (6) - 1 freq uxfm (6) - 1 freq veectim (6) - 3 freq vice (7) - 66 freq urzum (7) - 1 freq kucmam (7) - 1 freq qvzca (7) - 1 freq walcum (7) - 31 freq |
SoundEx code - V215 vagabond - 2 freq vagaboond - 1 freq vocbnlfbx - 1 freq vihazbm - 1 freq vxyivwumt - 1 freq vuzcfm - 1 freq vecbmr - 1 freq vagabondvoices - 4 freq |
MetaPhone code - FSKFM vuzcfm - 1 freq |
VUZCFM |
| Time to execute Levenshtein function - 0.225848 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.354029 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.033554 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.047453 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.001184 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. |