| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gift (0) - 116 freq giff (1) - 1 freq gif (1) - 207 freq aift (1) - 14 freq gilt (1) - 2 freq rift (1) - 12 freq gibt (1) - 3 freq gifts (1) - 32 freq tift (1) - 4 freq git (1) - 1232 freq lift (1) - 490 freq gist (1) - 13 freq sift (1) - 6 freq fift (1) - 14 freq gind (2) - 1 freq tit (2) - 23 freq nint (2) - 4 freq rist (2) - 15 freq fifth (2) - 28 freq eit (2) - 644 freq fiet (2) - 2 freq gight (2) - 3 freq gaet (2) - 22 freq galt (2) - 6 freq govt (2) - 7 freq |
gift (0) - 116 freq lift (2) - 490 freq git (2) - 1232 freq gist (2) - 13 freq sift (2) - 6 freq fift (2) - 14 freq tift (2) - 4 freq giftie (2) - 8 freq gif (2) - 207 freq giff (2) - 1 freq gifts (2) - 32 freq aift (2) - 14 freq gilt (2) - 2 freq rift (2) - 12 freq gibt (2) - 3 freq gat (3) - 367 freq gieit (3) - 1 freq glut (3) - 5 freq gust (3) - 17 freq bifot (3) - 1 freq giest (3) - 1 freq nifty (3) - 3 freq afft (3) - 1 freq guilt (3) - 36 freq geff (3) - 1 freq |
SoundEx code - G130 gawped - 32 freq gift - 116 freq goaved - 7 freq gawpit - 10 freq gowped - 5 freq gowpit - 10 freq gowpt - 1 freq gawpt - 1 freq gypit - 20 freq giveth - 2 freq gyped - 1 freq gobbit - 1 freq gibbet - 5 freq gauped - 2 freq gubbed - 10 freq geppetto - 1 freq giftie - 8 freq guffawed - 2 freq gïft - 1 freq gobbed - 3 freq gupta - 1 freq guffed - 4 freq gooped - 1 freq gaffed - 13 freq goved - 2 freq gaeped - 1 freq gabbit - 3 freq gibt - 3 freq govit - 1 freq gavotte - 1 freq gaped - 3 freq €œgift - 1 freq gapit - 1 freq giepit - 5 freq govt - 7 freq gbuta - 1 freq gypehied - 1 freq gvht - 1 freq |
MetaPhone code - JFT gift - 116 freq giftie - 8 freq €œgift - 1 freq jeft - 1 freq gight - 3 freq |
GIFT |
| Time to execute Levenshtein function - 0.214308 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.338680 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.027173 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.036439 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.000747 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. |