| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jgv (0) - 1 freq jv (1) - 2 freq jgw (1) - 1 freq jgvo (1) - 1 freq juv (1) - 1 freq jgz (1) - 1 freq hgv (1) - 3 freq jg (1) - 3 freq jgvh (1) - 1 freq ygv (1) - 1 freq jfv (1) - 1 freq agv (1) - 1 freq mgv (1) - 1 freq gv (1) - 11 freq kgv (1) - 1 freq ig (2) - 16 freq mv (2) - 2 freq jgzn (2) - 1 freq mov (2) - 3 freq ngo (2) - 2 freq hv (2) - 4 freq jo' (2) - 1 freq hgi (2) - 1 freq cg (2) - 3 freq vlv (2) - 1 freq |
jgv (0) - 1 freq jgvo (1) - 1 freq jfv (2) - 1 freq ygv (2) - 1 freq agv (2) - 1 freq mgv (2) - 1 freq jgvh (2) - 1 freq kgv (2) - 1 freq gv (2) - 11 freq jgw (2) - 1 freq jg (2) - 3 freq juv (2) - 1 freq jv (2) - 2 freq hgv (2) - 3 freq jgz (2) - 1 freq jeg (3) - 3 freq jive (3) - 1 freq juve (3) - 2 freq gva (3) - 1 freq jug (3) - 26 freq jegs (3) - 1 freq jarv (3) - 15 freq gvu (3) - 1 freq jovi (3) - 1 freq jojv (3) - 1 freq |
SoundEx code - J100 joab - 119 freq job - 522 freq jp - 7 freq jiffy - 4 freq jaup - 3 freq 'job - 1 freq jobbie - 17 freq joyfu - 10 freq jawb - 2 freq jip - 4 freq joyfoo' - 1 freq joyfoo - 5 freq jobie - 1 freq jib - 11 freq jcb - 2 freq jab - 21 freq jobby - 13 freq jeeve - 1 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 |
JGV |
| Time to execute Levenshtein function - 0.171792 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.308631 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.029232 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.036969 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.000921 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. |