| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gnev (0) - 1 freq gnef (1) - 1 freq nev (1) - 6 freq geev (1) - 1 freq grevy (2) - 1 freq geen (2) - 77 freq geo (2) - 19 freq znv (2) - 1 freq gyed (2) - 6 freq gey (2) - 1312 freq gied (2) - 1350 freq dev (2) - 4 freq nei (2) - 1 freq ges (2) - 1 freq nee (2) - 14 freq anew (2) - 14 freq gae (2) - 501 freq genes (2) - 10 freq fnek (2) - 1 freq gsv (2) - 2 freq gleg (2) - 127 freq grv (2) - 1 freq nne (2) - 1 freq ev (2) - 3 freq gret (2) - 146 freq |
gnev (0) - 1 freq gnef (2) - 1 freq geev (2) - 1 freq geneva (2) - 16 freq nev (2) - 6 freq goner (3) - 4 freq gune (3) - 1 freq agnes (3) - 29 freq tnv (3) - 1 freq inov (3) - 1 freq gnar (3) - 1 freq gen (3) - 11 freq gnu (3) - 1 freq gaen (3) - 190 freq gnd (3) - 1 freq gene (3) - 2 freq gnom (3) - 2 freq nv (3) - 5 freq agnew (3) - 1 freq goen (3) - 1 freq gliv (3) - 1 freq niv (3) - 5 freq geve (3) - 1 freq gn (3) - 8 freq qnv (3) - 1 freq |
SoundEx code - G510 gimp - 3 freq geneva - 16 freq gnef - 1 freq gumph - 1 freq geneva' - 2 freq gnap - 1 freq gameboy - 1 freq gmb - 4 freq gmpe - 1 freq gambo - 1 freq gnev - 1 freq gump - 1 freq |
MetaPhone code - NF knife - 102 freq nieve - 29 freq neive - 21 freq knave - 48 freq navy - 45 freq 'nuff - 1 freq nephew - 27 freq nfu - 1 freq nigh - 18 freq gnef - 1 freq nov - 4 freq naive - 10 freq nova - 7 freq 'knife - 1 freq nove - 1 freq naïve - 5 freq gnough - 1 freq neave - 3 freq no've - 2 freq neigh - 4 freq knif - 1 freq naff - 2 freq nev - 6 freq nav - 3 freq naïf - 1 freq niff - 1 freq niv - 5 freq nevoy - 7 freq €˜knifey - 1 freq hyne-aff - 1 freq nava - 30 freq €™nyf - 1 freq nouveau - 3 freq nave - 1 freq naffu - 1 freq navvy - 1 freq new-faa - 1 freq nv - 5 freq nf - 2 freq nvw - 1 freq nva - 2 freq nuf - 1 freq gnev - 1 freq wnvh - 1 freq noyfea - 1 freq nhv - 1 freq ngho - 1 freq pnfw - 1 freq naafi - 1 freq |
GNEV |
| Time to execute Levenshtein function - 0.209476 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.333342 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.027776 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.038025 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.000811 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. |