| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gifts (0) - 33 freq rifts (1) - 6 freq gift (1) - 121 freq gits (1) - 102 freq lifts (1) - 42 freq 'its (2) - 8 freq gis (2) - 1 freq giftit (2) - 5 freq bitts (2) - 10 freq gifties (2) - 4 freq guts (2) - 73 freq geats (2) - 1 freq gasts (2) - 1 freq gid's (2) - 1 freq gif'n (2) - 5 freq hits (2) - 150 freq lists (2) - 18 freq tints (2) - 3 freq rift (2) - 12 freq raifts (2) - 1 freq dists (2) - 1 freq aits (2) - 21 freq riffs (2) - 2 freq gist (2) - 12 freq mits (2) - 3 freq |
gifts (0) - 33 freq gifties (2) - 4 freq lifts (2) - 42 freq gits (2) - 102 freq rifts (2) - 6 freq gift (2) - 121 freq gites (3) - 1 freq giftin (3) - 2 freq rafts (3) - 3 freq gants (3) - 1 freq govts (3) - 1 freq grafts (3) - 3 freq gests (3) - 2 freq gats (3) - 1 freq gaffs (3) - 4 freq hefts (3) - 39 freq wafts (3) - 8 freq giftie (3) - 9 freq gets (3) - 432 freq lofts (3) - 1 freq fits (3) - 130 freq gaets (3) - 4 freq geets (3) - 23 freq gaits (3) - 30 freq tufts (3) - 2 freq |
SoundEx code - G132 gifts - 33 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 - 33 freq gifties - 4 freq |
GIFTS |
| Time to execute Levenshtein function - 0.163795 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.308896 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.027015 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.037290 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.000910 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. |