| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jgvh (0) - 1 freq jgvo (1) - 1 freq jgv (1) - 1 freq jgjh (1) - 1 freq yvh (2) - 1 freq gvu (2) - 1 freq jovi (2) - 1 freq juh (2) - 1 freq dvh (2) - 1 freq gkh (2) - 1 freq mgv (2) - 1 freq jah (2) - 2 freq jive (2) - 1 freq gvht (2) - 1 freq jg (2) - 3 freq joh (2) - 1 freq juv (2) - 1 freq agv (2) - 1 freq tvh (2) - 1 freq josh (2) - 3 freq jove (2) - 5 freq gbh (2) - 3 freq jgz (2) - 1 freq wnvh (2) - 1 freq gvs (2) - 1 freq |
jgvh (0) - 1 freq jgv (2) - 1 freq jgjh (2) - 1 freq jgvo (2) - 1 freq lmvh (4) - 1 freq gva (4) - 1 freq ygv (4) - 1 freq jhsh (4) - 1 freq kgv (4) - 1 freq java (4) - 1 freq juve (4) - 2 freq jfv (4) - 1 freq guh (4) - 1 freq vh (4) - 4 freq gvl (4) - 1 freq jtjh (4) - 1 freq gnh (4) - 1 freq jgw (4) - 1 freq jvo (4) - 1 freq cvh (4) - 1 freq qevh (4) - 1 freq tjnvh (4) - 1 freq wgh (4) - 1 freq gv (4) - 11 freq vvh (4) - 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 - JKF joogfu - 1 freq jgv - 1 freq jgvh - 1 freq jgvo - 1 freq |
JGVH |
| Time to execute Levenshtein function - 0.192485 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.342955 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.027331 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.036225 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.000814 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. |