| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| qlv (0) - 1 freq qlf (1) - 1 freq lv (1) - 6 freq qnv (1) - 1 freq qhv (1) - 1 freq qlc (1) - 1 freq qlw (1) - 1 freq qv (1) - 3 freq vlv (1) - 1 freq qzv (1) - 1 freq hlv (1) - 1 freq lvl (2) - 1 freq hev (2) - 139 freq jslv (2) - 1 freq viv (2) - 1 freq znv (2) - 1 freq li (2) - 21 freq qzw (2) - 1 freq qfw (2) - 1 freq dl (2) - 2 freq lev (2) - 1 freq yav (2) - 1 freq lh (2) - 1 freq qhi (2) - 1 freq qq (2) - 4 freq |
qlv (0) - 1 freq qv (2) - 3 freq vlv (2) - 1 freq hlv (2) - 1 freq qlw (2) - 1 freq qzv (2) - 1 freq qlc (2) - 1 freq qlf (2) - 1 freq lv (2) - 6 freq qhv (2) - 1 freq qnv (2) - 1 freq quhv (3) - 1 freq lvu (3) - 1 freq plav (3) - 1 freq ilve (3) - 1 freq liv (3) - 12 freq luv (3) - 183 freq alva (3) - 2 freq ilev (3) - 1 freq cliv (3) - 1 freq flav (3) - 1 freq olav (3) - 1 freq sylv (3) - 3 freq qvi (3) - 1 freq tulv (3) - 1 freq |
SoundEx code - Q410 qualify - 6 freq qualiefy - 1 freq qualifee - 2 freq qlf - 1 freq qlv - 1 freq qxaylup - 1 freq |
MetaPhone code - KLF gliff - 35 freq cliff - 28 freq qualify - 6 freq golf - 63 freq golfy - 2 freq clive - 9 freq gluffy - 2 freq caulf - 2 freq glove - 11 freq goliev - 1 freq gulf - 9 freq calf - 12 freq clova - 2 freq calfie - 8 freq gluve - 1 freq gluff - 19 freq qualiefy - 1 freq cullivoe - 1 freq gliv - 1 freq cliv - 1 freq qualifee - 2 freq clave - 1 freq clove - 1 freq guelph - 1 freq cleave - 3 freq guelfo - 1 freq €œgolf - 1 freq glif - 1 freq gliffie - 1 freq clava - 2 freq qlf - 1 freq cliffy - 1 freq cullough - 1 freq qlv - 1 freq kayleigh - 2 freq |
QLV |
| Time to execute Levenshtein function - 0.177516 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.324660 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.031334 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.036916 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.000904 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. |