| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gangster (0) - 7 freq bangster (1) - 4 freq gangsters (1) - 11 freq sangster (1) - 24 freq canister (2) - 3 freq banister (2) - 2 freq gaavster (2) - 1 freq sangsters (2) - 13 freq bangsters (2) - 3 freq gangsta (2) - 1 freq ganger (2) - 1 freq havester (3) - 1 freq munster (3) - 7 freq ganner (3) - 1 freq mayster (3) - 1 freq gangt (3) - 1 freq aster (3) - 1 freq easter (3) - 41 freq faster (3) - 77 freq laughter (3) - 51 freq ginger (3) - 113 freq ganges (3) - 1 freq panser (3) - 26 freq gunnister (3) - 1 freq hansper (3) - 1 freq |
gangster (0) - 7 freq gangsters (2) - 11 freq sangster (2) - 24 freq bangster (2) - 4 freq gangsta (3) - 1 freq ganger (4) - 1 freq bangstry (4) - 4 freq gangotri (4) - 1 freq gunnister (4) - 1 freq youngster (4) - 2 freq sangsters (4) - 13 freq bangsters (4) - 3 freq gaavster (4) - 1 freq banister (4) - 2 freq canister (4) - 3 freq cannister (5) - 1 freq enster (5) - 2 freq mingsters (5) - 1 freq gangs (5) - 147 freq inkster (5) - 1 freq mangst (5) - 2 freq gester (5) - 2 freq lancaster (5) - 3 freq gouster (5) - 5 freq sinister (5) - 10 freq |
SoundEx code - G523 gainst - 3 freq ganged - 22 freq gangsters - 11 freq gingit - 12 freq genocide - 3 freq gangster - 7 freq gymnastic - 1 freq gunkt - 2 freq gameskids - 2 freq gymnastics - 3 freq gum-streetchin - 1 freq gunked - 1 freq ghunched - 1 freq gemstone - 1 freq gunnister - 1 freq gangsta - 1 freq gunshot - 2 freq gemstane - 2 freq gainstaund - 1 freq gumsh't - 2 freq gemstanes - 1 freq gainstuid - 1 freq gainstaunnin - 1 freq gainstaun - 1 freq gymkit - 1 freq ganzits - 1 freq gangotri - 1 freq gangt - 1 freq gym-kits - 1 freq gunkit - 1 freq gmkjdb - 1 freq ginsydooda - 150 freq |
MetaPhone code - KNKSTR gangster - 7 freq |
GANGSTER |
| Time to execute Levenshtein function - 0.210164 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.413747 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.028165 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.038030 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.000838 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. |