Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
qxaylup (0) - 1 freq taycup (3) - 4 freq brak-up (4) - 1 freq dial-up (4) - 2 freq rxau (4) - 1 freq wak-up (4) - 1 freq hayur (4) - 2 freq scalp (4) - 6 freq quay (4) - 19 freq eyup (4) - 1 freq qbal (4) - 1 freq callum (4) - 81 freq shaddup (4) - 3 freq thayur (4) - 1 freq xyyu (4) - 1 freq dtaylor (4) - 7 freq flayvur (4) - 1 freq bayou (4) - 1 freq ayl (4) - 1 freq qxypr (4) - 1 freq palus (4) - 1 freq a'luv (4) - 1 freq scaup (4) - 5 freq mxyu (4) - 1 freq peasoup (4) - 1 freq |
qxaylup (0) - 1 freq sxlp (5) - 1 freq yalp (6) - 2 freq qalye (6) - 1 freq mixy-up (6) - 1 freq qually (6) - 1 freq gallop (6) - 12 freq wallop (6) - 11 freq whalp (6) - 11 freq lup (6) - 1 freq halp (6) - 54 freq qakpu (6) - 1 freq alp (6) - 1 freq tlup (6) - 1 freq quail (6) - 5 freq walop (6) - 1 freq qualm (6) - 2 freq waallop (6) - 1 freq jallop (6) - 1 freq clup (6) - 1 freq qxyk (6) - 1 freq glup (6) - 2 freq zmalp (6) - 1 freq hylop (6) - 1 freq qual (6) - 3 freq |
SoundEx code - Q410 qualify - 6 freq qualiefy - 1 freq qualifee - 2 freq qlf - 1 freq qlv - 1 freq qxaylup - 1 freq |
MetaPhone code - KKSLP qxaylup - 1 freq |
QXAYLUP |
Time to execute Levenshtein function - 0.255164 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.594389 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.062449 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.038048 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.000874 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. |