| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gngirs (0) - 1 freq lingirs (2) - 1 freq angirt (2) - 3 freq girs (2) - 4 freq fngers (2) - 1 freq angils (2) - 1 freq fingirs (2) - 58 freq nyirs (2) - 1 freq gairs (2) - 1 freq gengis (2) - 1 freq gingies (2) - 1 freq geirs (2) - 1 freq ingins (2) - 15 freq gangers (2) - 2 freq guids (3) - 24 freq goins (3) - 2 freq vigurs (3) - 1 freq ungert (3) - 1 freq ingens (3) - 1 freq mangers (3) - 1 freq girst (3) - 2 freq ritirs (3) - 1 freq hungir (3) - 3 freq ansir (3) - 1 freq feirs (3) - 4 freq |
gngirs (0) - 1 freq gangers (2) - 2 freq lingirs (3) - 1 freq gingies (3) - 1 freq fingirs (3) - 58 freq gengis (3) - 1 freq fngers (3) - 1 freq hingers (4) - 5 freq singers (4) - 55 freq gengs (4) - 15 freq ganger (4) - 1 freq ginger (4) - 121 freq bangers (4) - 3 freq fingrs (4) - 1 freq grungers (4) - 1 freq fingers (4) - 255 freq wingers (4) - 1 freq dangers (4) - 11 freq ingyres (4) - 1 freq dungers (4) - 3 freq sneegirs (4) - 1 freq fingars (4) - 1 freq genghis (4) - 2 freq rangers (4) - 55 freq gangs (4) - 150 freq |
SoundEx code - G526 ginger - 121 freq 'gangrel - 1 freq gangrel - 11 freq ganger - 1 freq 'ginger' - 1 freq gangers - 2 freq gennesaret - 1 freq genessaretb - 1 freq gum-chawer - 1 freq gngirs - 1 freq gnashers - 1 freq gingerly - 2 freq gangrels - 1 freq gingerbread - 4 freq gangrel's - 1 freq gang-roond - 14 freq gingerbried - 15 freq gznqrduu - 1 freq gingertotty - 3 freq gingerboab - 5 freq gingergeekcraig - 1 freq |
MetaPhone code - NJRS gngirs - 1 freq ngers - 1 freq |
GNGIRS |
| Time to execute Levenshtein function - 0.234644 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.386815 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.028005 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.037276 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.000923 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. |