Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
gantit (0) - 10 freq antit (1) - 1 freq mantit (1) - 2 freq cantit (1) - 1 freq wantit (1) - 279 freq santit (1) - 2 freq lantit (1) - 1 freq hantit (1) - 3 freq pantit (1) - 2 freq gantin (1) - 23 freq grantit (1) - 30 freq rantit (1) - 1 freq haitit (2) - 1 freq yankit (2) - 1 freq bankit (2) - 1 freq gantry (2) - 6 freq gangt (2) - 1 freq ganie (2) - 6 freq bandit (2) - 7 freq haltit (2) - 3 freq lastit (2) - 13 freq muntit (2) - 3 freq gawpit (2) - 10 freq dautit (2) - 1 freq haantit (2) - 1 freq |
gantit (0) - 10 freq hantit (2) - 3 freq pantit (2) - 2 freq rantit (2) - 1 freq lantit (2) - 1 freq grantit (2) - 30 freq gantin (2) - 23 freq antit (2) - 1 freq santit (2) - 2 freq cantit (2) - 1 freq mantit (2) - 2 freq wantit (2) - 279 freq gantae (3) - 6 freq myntit (3) - 3 freq rentit (3) - 6 freq gunkit (3) - 1 freq ignitit (3) - 1 freq gannet (3) - 10 freq pyntit (3) - 97 freq paintit (3) - 22 freq duntit (3) - 25 freq tentit (3) - 8 freq gingit (3) - 12 freq jintit (3) - 1 freq dintit (3) - 3 freq |
SoundEx code - G533 gantit - 10 freq gjauntida - 1 freq ganted - 2 freq |
MetaPhone code - KNTT coonted - 16 freq coontit - 30 freq countit - 3 freq gantit - 10 freq counted - 13 freq g-and-t - 1 freq countet - 1 freq can-edit - 1 freq k'nittit - 1 freq quantitie - 1 freq candid - 1 freq quantity - 8 freq cantit - 1 freq ganted - 2 freq cantata - 1 freq conduit - 1 freq connotit - 1 freq |
GANTIT |
Time to execute Levenshtein function - 0.402164 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.823386 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.088180 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.103674 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.000802 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. |