| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ganfer (0) - 2 freq ganner (1) - 1 freq ganger (1) - 1 freq gaffer (1) - 35 freq gander (1) - 14 freq gadder (2) - 19 freq sanger (2) - 1 freq affer (2) - 2 freq panser (2) - 26 freq canner (2) - 1 freq dancer (2) - 31 freq anser (2) - 5 freq golfer (2) - 1 freq rander (2) - 2 freq gahler (2) - 1 freq ganged (2) - 22 freq canker (2) - 4 freq gowfer (2) - 1 freq banger (2) - 5 freq grander (2) - 3 freq hanger (2) - 3 freq gonner (2) - 1 freq dander (2) - 61 freq gaer (2) - 7 freq cancer (2) - 43 freq |
ganfer (0) - 2 freq ganner (2) - 1 freq gaffer (2) - 35 freq gander (2) - 14 freq ganger (2) - 1 freq infer (3) - 1 freq enfer (3) - 1 freq gonner (3) - 1 freq golfer (3) - 1 freq gowfer (3) - 1 freq ginger (3) - 121 freq gener (3) - 1 freq gunfre (3) - 1 freq confer (3) - 1 freq gender (3) - 19 freq gunfire (3) - 3 freq gunner (3) - 2 freq goner (3) - 4 freq manger (4) - 11 freq gaffe (4) - 1 freq gaffers (4) - 2 freq saufer (4) - 2 freq banter (4) - 43 freq danger (4) - 110 freq gannet (4) - 10 freq |
SoundEx code - G516 gamphrells - 1 freq ganfer - 2 freq gaamfers - 1 freq gunfire - 3 freq gunfre - 1 freq gnpryi - 1 freq gomper - 3 freq |
MetaPhone code - KNFR ganfer - 2 freq confer - 1 freq gunfire - 3 freq gunfre - 1 freq queenferry - 1 freq |
GANFER |
| Time to execute Levenshtein function - 0.589177 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 - 1.008212 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.033869 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.049853 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.001353 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. |