| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jqhup (0) - 1 freq €˜hup (2) - 1 freq hup (2) - 5 freq whup (2) - 8 freq jaup (2) - 3 freq shui (3) - 36 freq rhum (3) - 2 freq juk (3) - 2 freq 'huv (3) - 8 freq qnu (3) - 1 freq whap (3) - 2 freq jhsh (3) - 1 freq quo (3) - 181 freq eyup (3) - 1 freq cqhod (3) - 1 freq jasus (3) - 1 freq juv (3) - 1 freq chum (3) - 21 freq roup (3) - 24 freq hum (3) - 44 freq thut (3) - 29 freq thug (3) - 6 freq maup (3) - 1 freq jamp (3) - 34 freq huv (3) - 1162 freq |
jqhup (0) - 1 freq kuqhip (4) - 1 freq whup (4) - 8 freq jaup (4) - 3 freq €˜hup (4) - 1 freq hup (4) - 5 freq jql (5) - 1 freq jhx (5) - 1 freq schep (5) - 2 freq xqp (5) - 1 freq qh (5) - 4 freq qht (5) - 38 freq hop (5) - 13 freq jqn (5) - 1 freq qhv (5) - 1 freq ohp (5) - 1 freq rqh (5) - 1 freq wqhab (5) - 1 freq zqhos (5) - 1 freq houp (5) - 3 freq jap (5) - 2 freq jpu (5) - 1 freq jxvp (5) - 1 freq qzp (5) - 1 freq rqp (5) - 1 freq |
SoundEx code - J100 joab - 111 freq job - 519 freq jp - 7 freq jiffy - 4 freq jaup - 3 freq 'job - 1 freq jobbie - 17 freq joyfu - 9 freq jawb - 2 freq jip - 4 freq joyfoo' - 1 freq joyfoo - 5 freq jobie - 1 freq jib - 11 freq jcb - 2 freq jab - 20 freq jeeve - 1 freq jobby - 10 freq 'jovee - 1 freq javvie - 1 freq joppa - 3 freq jeep - 4 freq jive - 1 freq jeff - 32 freq jap - 2 freq java - 1 freq jove - 5 freq jaffa - 5 freq jehovah - 1 freq jibe - 1 freq jb - 2 freq joopie - 1 freq jv - 2 freq jape - 6 freq jfa - 1 freq jgv - 1 freq jjkb - 1 freq jxvp - 1 freq joop - 1 freq jfi - 1 freq jabba - 1 freq jxauvi - 1 freq juve - 2 freq jvo - 1 freq jovi - 1 freq jf - 1 freq jxzfh - 1 freq javvb - 1 freq jqhup - 1 freq jof - 1 freq jfv - 1 freq jeifi - 1 freq jkp - 1 freq jgvh - 1 freq jpu - 1 freq jgvo - 1 freq juv - 1 freq jjb - 1 freq jgkib - 1 freq |
MetaPhone code - JKHP jqhup - 1 freq |
JQHUP |
| Time to execute Levenshtein function - 0.473326 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.645829 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.031764 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.044804 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.000852 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. |