| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gifties (0) - 4 freq giftie (1) - 8 freq fifties (1) - 20 freq titties (2) - 1 freq bitties (2) - 29 freq giftin (2) - 2 freq cities (2) - 42 freq gingies (2) - 1 freq wiffies (2) - 1 freq softies (2) - 2 freq minties (2) - 10 freq gifted (2) - 8 freq ditties (2) - 1 freq dafties (2) - 17 freq wifies (2) - 57 freq gillies (2) - 7 freq gites (2) - 1 freq giftit's (2) - 1 freq kisties (2) - 8 freq lilties (2) - 2 freq giftit (2) - 5 freq fiftiet (2) - 1 freq fiftie (2) - 12 freq fifities (2) - 1 freq safties (2) - 6 freq |
gifties (0) - 4 freq gifts (2) - 32 freq fifties (2) - 20 freq giftie (2) - 8 freq dafties (3) - 17 freq fifities (3) - 1 freq gites (3) - 1 freq gifted (3) - 8 freq safties (3) - 6 freq softies (3) - 2 freq giftid (3) - 1 freq gutties (3) - 11 freq giftin (3) - 2 freq giftit (3) - 5 freq foaties (4) - 1 freq gytes (4) - 1 freq gaetes (4) - 1 freq feeties (4) - 5 freq lifts (4) - 40 freq groaties (4) - 2 freq foties (4) - 6 freq eighties (4) - 8 freq dafities (4) - 1 freq gentis (4) - 1 freq rifts (4) - 6 freq |
SoundEx code - G132 gifts - 32 freq gifties - 4 freq gibt's - 1 freq goviedick - 1 freq govts - 1 freq gypeheidgendies - 1 freq gfeadjrd - 1 freq gqvfdoka - 1 freq |
MetaPhone code - JFTS gifts - 32 freq gifties - 4 freq |
GIFTIES |
| Time to execute Levenshtein function - 0.230546 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.422159 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.034269 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.036845 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. |