| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gossipy (0) - 1 freq gossips (1) - 1 freq gossip (1) - 30 freq gossip's (2) - 1 freq gossiped (2) - 1 freq gossipan (2) - 1 freq gossipin (2) - 3 freq noisily (3) - 9 freq lossin (3) - 32 freq oossie (3) - 1 freq mossie (3) - 4 freq gassing (3) - 1 freq glossy (3) - 14 freq bossy (3) - 2 freq vossis (3) - 2 freq grossit (3) - 2 freq hossie (3) - 1 freq rossi (3) - 2 freq glossin (3) - 4 freq wossy (3) - 1 freq colspy (3) - 1 freq rossie (3) - 3 freq bossin (3) - 4 freq dossier (3) - 1 freq glassily (3) - 1 freq |
gossipy (0) - 1 freq gossip (1) - 30 freq gossips (2) - 1 freq gossipan (3) - 1 freq gossiped (3) - 1 freq gossipin (3) - 3 freq goss (4) - 1 freq gussied (4) - 1 freq gassy (4) - 1 freq gossip's (4) - 1 freq gestapo (5) - 4 freq mossis (5) - 1 freq glossay (5) - 1 freq grossly (5) - 1 freq fossil (5) - 10 freq dossin (5) - 3 freq gass (5) - 4 freq glossary (5) - 15 freq gossiping (5) - 2 freq goosey (5) - 6 freq golspie (5) - 1 freq gissed (5) - 1 freq gess (5) - 1 freq guessin (5) - 18 freq ssp (5) - 8 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 |
GOSSIPY |
| Time to execute Levenshtein function - 0.201149 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.350307 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.028879 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.036867 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.000923 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. |