| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gjgaussbv (0) - 1 freq gauss (4) - 2 freq jauss (4) - 7 freq jjgass (4) - 1 freq degaussed (4) - 1 freq gaurs (5) - 2 freq gawjuss (5) - 3 freq grasses (5) - 8 freq glaess (5) - 1 freq gauls (5) - 2 freq gusset (5) - 1 freq grassed (5) - 5 freq gassy (5) - 1 freq grassy (5) - 7 freq ongauns (5) - 63 freq gauns (5) - 30 freq jaurs (5) - 15 freq fauss (5) - 14 freq bauss (5) - 1 freq grasse (5) - 1 freq glaisses (5) - 22 freq grassin (5) - 2 freq grass (5) - 106 freq pegassus (5) - 1 freq 'aussie (5) - 1 freq |
gjgaussbv (0) - 1 freq jjgass (7) - 1 freq degaussed (8) - 1 freq jauss (8) - 7 freq gauss (8) - 2 freq glaisscs (9) - 1 freq glaiss (9) - 65 freq glassa (9) - 1 freq glassy (9) - 2 freq gallusses (9) - 1 freq gustav (9) - 2 freq massiv (9) - 1 freq glass (9) - 2 freq glassfu (9) - 1 freq grasser (9) - 1 freq glass (9) - 80 freq glasses (9) - 24 freq oigfsasbvc (9) - 1 freq aggressive (9) - 9 freq grayssed (9) - 1 freq jassie (9) - 3 freq grassic (9) - 8 freq glaissy (9) - 1 freq gass (9) - 4 freq gassed (9) - 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 - KJKSBF gjgaussbv - 1 freq |
GJGAUSSBV |
| Time to execute Levenshtein function - 0.225571 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.407664 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.033726 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.038870 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.000858 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. |