| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gossip (0) - 30 freq gossips (1) - 1 freq gossipy (1) - 1 freq lossie (2) - 7 freq lossin (2) - 32 freq vossis (2) - 2 freq hossie (2) - 1 freq fossil (2) - 10 freq glossin (2) - 4 freq tossin (2) - 18 freq gossipan (2) - 1 freq mossie (2) - 4 freq dossin (2) - 3 freq bossin (2) - 4 freq oossie (2) - 1 freq grossit (2) - 2 freq rossi (2) - 2 freq gossiped (2) - 1 freq gossip's (2) - 1 freq mossis (2) - 1 freq rossie (2) - 3 freq goss (2) - 1 freq gossipin (2) - 3 freq gassed (3) - 3 freq horssis (3) - 4 freq |
gossip (0) - 30 freq gossipy (1) - 1 freq gossips (2) - 1 freq gossiped (3) - 1 freq gossipin (3) - 3 freq goss (3) - 1 freq gossipan (3) - 1 freq gess (4) - 1 freq gass (4) - 4 freq gassy (4) - 1 freq golspie (4) - 1 freq grasp (4) - 28 freq gassed (4) - 3 freq gasp (4) - 39 freq gresp (4) - 2 freq guessin (4) - 18 freq gessed (4) - 1 freq gusset (4) - 1 freq ssp (4) - 8 freq gissed (4) - 1 freq gussied (4) - 1 freq gausp (4) - 2 freq hossie (4) - 1 freq lossin (4) - 32 freq dossin (4) - 3 freq |
SoundEx code - G210 gasp - 39 freq gossip - 30 freq giuseppe - 1 freq gossipy - 1 freq gausp - 2 freq gogzyboy - 1 freq gooigiboi - 1 freq gazebo - 1 freq gjgaussbv - 1 freq ghsfp - 4 freq gagzb - 1 freq |
MetaPhone code - KSP gasp - 39 freq gossip - 30 freq cusp - 3 freq gossipy - 1 freq csp - 2 freq gausp - 2 freq czp - 1 freq qzp - 1 freq |
GOSSIP |
| Time to execute Levenshtein function - 0.200277 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.367565 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.028187 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.037644 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.000965 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. |