| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| igf (0) - 1 freq imf (1) - 2 freq if (1) - 5844 freq wgf (1) - 1 freq gf (1) - 5 freq egf (1) - 1 freq ig (1) - 16 freq igs (1) - 1 freq igg (1) - 1 freq igc (1) - 1 freq iof (1) - 1 freq isp (2) - 3 freq tigs (2) - 2 freq gs (2) - 3 freq iugw (2) - 1 freq cigs (2) - 1 freq gr (2) - 4 freq ingy (2) - 14 freq icu (2) - 3 freq ij (2) - 2 freq go (2) - 1915 freq ine (2) - 3 freq oigj (2) - 1 freq ivv (2) - 1 freq aif (2) - 6 freq |
igf (0) - 1 freq gf (1) - 5 freq egf (1) - 1 freq iof (2) - 1 freq igc (2) - 1 freq gif (2) - 207 freq gyf (2) - 1 freq igg (2) - 1 freq if (2) - 5844 freq wgf (2) - 1 freq imf (2) - 2 freq ig (2) - 16 freq igs (2) - 1 freq gd (3) - 12 freq haf (3) - 9 freq gb (3) - 2 freq gl (3) - 2 freq zf (3) - 2 freq infy (3) - 1 freq jf (3) - 1 freq af (3) - 14 freq gx (3) - 4 freq zif (3) - 13 freq gk (3) - 2 freq ”f (3) - 4 freq |
SoundEx code - I210 is-'be - 2 freq i'shoop - 1 freq is'be - 1 freq igwv - 1 freq iqkjb - 1 freq ixqv - 1 freq iagp - 1 freq igf - 1 freq isp - 3 freq iehjzb - 1 freq isaboy - 1 freq iogsjf - 1 freq ijzcb - 1 freq |
MetaPhone code - IKF igwv - 1 freq igf - 1 freq |
IGF |
| Time to execute Levenshtein function - 0.173125 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.450048 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.031378 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.042768 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.000759 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. |