| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gypit (0) - 20 freq sypit (1) - 2 freq gypin (1) - 3 freq wypit (1) - 1 freq typit (1) - 3 freq rypit (1) - 4 freq gyit (1) - 2 freq gydit (1) - 3 freq gapit (1) - 1 freq impit (2) - 1 freq gieit (2) - 1 freq lykit (2) - 5 freq pynit (2) - 3 freq kypie (2) - 1 freq wycit (2) - 1 freq pipit (2) - 6 freq gymkit (2) - 1 freq skypit (2) - 1 freq govit (2) - 1 freq jynit (2) - 3 freq gymin (2) - 1 freq 'pit (2) - 15 freq goit (2) - 3 freq gyet (2) - 1 freq gyt (2) - 1 freq |
gypit (0) - 20 freq gapit (1) - 1 freq gypin (2) - 3 freq sypit (2) - 2 freq egypt (2) - 27 freq giepit (2) - 5 freq gydit (2) - 3 freq gyit (2) - 2 freq wypit (2) - 1 freq typit (2) - 3 freq rypit (2) - 4 freq gytie (3) - 1 freq grit (3) - 25 freq onpit (3) - 1 freq gait (3) - 137 freq glit (3) - 1 freq gulpit (3) - 3 freq gype (3) - 47 freq gawpit (3) - 10 freq spit (3) - 69 freq pypet (3) - 2 freq geit (3) - 3 freq gupta (3) - 1 freq gypsy (3) - 2 freq git (3) - 1244 freq |
SoundEx code - G130 gawped - 32 freq gift - 121 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 giftie - 9 freq gubbed - 10 freq geppetto - 1 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 - JPT gypit - 20 freq gyped - 1 freq geppetto - 1 freq jappt - 1 freq jaupit - 1 freq japped - 2 freq giepit - 5 freq |
GYPIT |
| Time to execute Levenshtein function - 0.214459 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.536407 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.070405 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.037851 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.000922 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. |