| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jgvo (0) - 1 freq jgzo (1) - 1 freq jvo (1) - 1 freq jgvh (1) - 1 freq jgv (1) - 1 freq gv (2) - 11 freq gvu (2) - 1 freq jive (2) - 1 freq gpo (2) - 4 freq mgv (2) - 1 freq jg (2) - 3 freq joo (2) - 3 freq 'go (2) - 11 freq gio (2) - 1 freq go (2) - 1980 freq ervo (2) - 2 freq gyo (2) - 6 freq joao (2) - 38 freq devo (2) - 2 freq agno (2) - 1 freq kgv (2) - 1 freq gjo (2) - 2 freq rgo (2) - 1 freq jgw (2) - 1 freq juno (2) - 2 freq |
jgvo (0) - 1 freq jgv (1) - 1 freq jgzo (2) - 1 freq jvo (2) - 1 freq jgvh (2) - 1 freq juve (3) - 2 freq jgz (3) - 1 freq jovi (3) - 1 freq hgv (3) - 3 freq jgw (3) - 1 freq jfv (3) - 1 freq juv (3) - 1 freq agv (3) - 1 freq java (3) - 1 freq kgv (3) - 1 freq gva (3) - 1 freq ygv (3) - 1 freq jove (3) - 5 freq jv (3) - 2 freq gv (3) - 11 freq jive (3) - 1 freq gvu (3) - 1 freq mgv (3) - 1 freq jg (3) - 3 freq jegs (4) - 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 |
JGVO |
| Time to execute Levenshtein function - 0.195333 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.347544 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.028062 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.040482 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.000928 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. |