| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| geoffrey (0) - 14 freq geofrey (1) - 1 freq jeffrey (2) - 2 freq effray (3) - 1 freq toffey (3) - 1 freq geoff (3) - 2 freq coffey (3) - 3 freq rjeffrey (3) - 1 freq pomfrey (3) - 1 freq grocery (4) - 4 freq jeopardy (4) - 2 freq geffin (4) - 1 freq chorey (4) - 1 freq before' (4) - 1 freq gowfer (4) - 1 freq geekery (4) - 1 freq coffen (4) - 2 freq befare (4) - 2 freq goosey (4) - 6 freq soarey (4) - 1 freq reffel (4) - 2 freq gentry (4) - 15 freq gestures (4) - 24 freq gaffed (4) - 13 freq geofftulley (4) - 1 freq |
geoffrey (0) - 14 freq geofrey (2) - 1 freq jeffrey (3) - 2 freq geoff (4) - 2 freq gaffer (4) - 35 freq effray (4) - 1 freq gunfre (5) - 1 freq heffer (5) - 2 freq gunfire (5) - 3 freq guffed (5) - 4 freq offer (5) - 177 freq gaffered (5) - 1 freq guffy (5) - 2 freq suffre (5) - 1 freq guffie (5) - 3 freq gaffed (5) - 13 freq gaffe (5) - 1 freq gowfer (5) - 1 freq pomfrey (5) - 1 freq rjeffrey (5) - 1 freq coffey (5) - 3 freq toffey (5) - 1 freq deiffer (5) - 2 freq geff (5) - 1 freq seffer (5) - 1 freq |
SoundEx code - G160 gaffer - 35 freq gyper - 1 freq geoffrey - 14 freq giffar - 1 freq gfur - 1 freq gowfer - 1 freq geofrey - 1 freq |
MetaPhone code - JFR jvver - 1 freq geoffrey - 14 freq giffar - 1 freq jeffrey - 2 freq geofrey - 1 freq |
GEOFFREY |
| Time to execute Levenshtein function - 0.201496 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.333782 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.027392 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.036727 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.000919 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. |