| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gaffer (0) - 35 freq gaffed (1) - 13 freq waffer (1) - 1 freq gaffe (1) - 1 freq oaffer (1) - 1 freq gaffers (1) - 2 freq ganfer (1) - 2 freq baffe (2) - 2 freq oaffur (2) - 1 freq giffar (2) - 1 freq gadger (2) - 1 freq gaer (2) - 7 freq affen (2) - 118 freq caffe (2) - 1 freq kaffir (2) - 2 freq ganner (2) - 1 freq after (2) - 352 freq guffed (2) - 4 freq iffer (2) - 1 freq seffer (2) - 1 freq grafter (2) - 1 freq lafter (2) - 1 freq saifer (2) - 3 freq gaffer's (2) - 2 freq garter (2) - 2 freq |
gaffer (0) - 35 freq gaffed (2) - 13 freq giffar (2) - 1 freq ganfer (2) - 2 freq gaffers (2) - 2 freq gaffe (2) - 1 freq oaffer (2) - 1 freq waffer (2) - 1 freq gaffin (3) - 5 freq siffer (3) - 3 freq niffer (3) - 7 freq buffer (3) - 2 freq puffer (3) - 1 freq gaffered (3) - 1 freq affere (3) - 1 freq daffery (3) - 2 freq differ (3) - 135 freq offer (3) - 169 freq duffer (3) - 6 freq suffer (3) - 57 freq gowfer (3) - 1 freq golfer (3) - 1 freq affeir (3) - 1 freq heffer (3) - 2 freq oaffir (3) - 5 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 - KFR cover - 148 freq quiver - 6 freq quaver - 2 freq gaffer - 35 freq kiver - 5 freq cuuver - 1 freq quiver' - 1 freq caviar - 11 freq cuiver - 4 freq 'cover - 1 freq kivver - 6 freq gfur - 1 freq caviaar - 1 freq gowfer - 1 freq caviare - 1 freq kivvver - 1 freq kaffir - 2 freq caiver - 1 freq cfar - 1 freq cuvver - 1 freq |
GAFFER |
| Time to execute Levenshtein function - 0.186805 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.339387 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.027623 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.044373 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.001069 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. |