Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
gangotri (0) - 1 freq bangor (3) - 9 freq gangsta (3) - 1 freq gangsters (3) - 11 freq gangers (3) - 2 freq gangt (3) - 1 freq tandoori (3) - 1 freq gantry (3) - 6 freq gangster (3) - 7 freq gantrie (3) - 1 freq bangstry (3) - 4 freq ganger (3) - 1 freq bangstrie (3) - 3 freq sangria (4) - 2 freq antoni (4) - 1 freq ganged (4) - 22 freq langth (4) - 1 freq tantra (4) - 1 freq yangtze (4) - 1 freq tantric (4) - 2 freq gentrie (4) - 5 freq langoch (4) - 1 freq manger (4) - 11 freq mango (4) - 4 freq gange (4) - 3 freq |
gangotri (0) - 1 freq gangster (4) - 7 freq gantrie (4) - 1 freq gantry (4) - 6 freq ganger (4) - 1 freq gangt (4) - 1 freq gentry (5) - 15 freq gingit (5) - 12 freq gintry (5) - 1 freq ginger (5) - 121 freq bangstrie (5) - 3 freq fingtr (5) - 1 freq gentrie (5) - 5 freq gangsters (5) - 11 freq bangor (5) - 9 freq gangers (5) - 2 freq gangsta (5) - 1 freq bangstry (5) - 4 freq gngirs (6) - 1 freq gangway (6) - 1 freq gantries (6) - 1 freq gangwey (6) - 6 freq ganzits (6) - 1 freq ganfer (6) - 2 freq gangie (6) - 3 freq |
SoundEx code - G523 gainst - 3 freq ganged - 22 freq gangsters - 11 freq gingit - 12 freq gemstones - 1 freq gainstaunin - 1 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 - KNKTR gangotri - 1 freq |
GANGOTRI |
Time to execute Levenshtein function - 0.245871 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.425568 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.037162 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.050042 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.001267 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. |