| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| geppetto (0) - 1 freq ghetto (3) - 2 freq peppert (3) - 1 freq heppent (3) - 7 freq keppet (3) - 1 freq gemmelt (4) - 1 freq 'pretty (4) - 1 freq repents (4) - 2 freq emmett (4) - 2 freq repetit (4) - 1 freq despert (4) - 4 freq poppets (4) - 1 freq serpents (4) - 18 freq serpent (4) - 56 freq gethert (4) - 41 freq geelt (4) - 2 freq gazette (4) - 3 freq geetin (4) - 1 freq genert (4) - 1 freq gippct (4) - 1 freq pretty (4) - 132 freq nippet (4) - 10 freq getts (4) - 7 freq repent (4) - 17 freq gett (4) - 11 freq |
geppetto (0) - 1 freq appetite (5) - 19 freq gippct (5) - 1 freq keppet (5) - 1 freq eppatite (5) - 1 freq ghetto (5) - 2 freq heppent (5) - 7 freq peppert (5) - 1 freq temptt (6) - 1 freq puppets (6) - 2 freq gtto (6) - 3 freq grett (6) - 34 freq petty (6) - 16 freq puppetry (6) - 2 freq keppit (6) - 17 freq wuppet (6) - 2 freq dappelt (6) - 1 freq lippent (6) - 13 freq poppet (6) - 8 freq appert (6) - 1 freq depletit (6) - 1 freq lippert (6) - 1 freq muppets (6) - 5 freq gappen (6) - 2 freq tippets (6) - 1 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 |
GEPPETTO |
| Time to execute Levenshtein function - 0.215893 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.399477 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.032438 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.039179 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.000960 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. |