| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gasps (0) - 7 freq gaups (1) - 2 freq gaps (1) - 9 freq gass (1) - 4 freq gawps (1) - 1 freq gases (1) - 6 freq gasts (1) - 1 freq wasps (1) - 4 freq rasps (1) - 11 freq gasp (1) - 37 freq gas (2) - 1 freq raspy (2) - 2 freq games (2) - 247 freq gaels (2) - 17 freq gawks (2) - 6 freq ramps (2) - 2 freq wasp' (2) - 1 freq gaap (2) - 1 freq wasp (2) - 5 freq ga's (2) - 1 freq gams (2) - 1 freq haps (2) - 31 freq japs (2) - 12 freq haeps (2) - 4 freq raips (2) - 7 freq |
gasps (0) - 7 freq gasts (2) - 1 freq wasps (2) - 4 freq rasps (2) - 11 freq gases (2) - 6 freq gasp (2) - 37 freq gaups (2) - 2 freq gawps (2) - 1 freq gaps (2) - 9 freq gass (2) - 4 freq gulps (3) - 6 freq gimps (3) - 4 freq gaspan (3) - 1 freq gaists (3) - 1 freq gaspit (3) - 5 freq gapes (3) - 1 freq gests (3) - 2 freq waasps (3) - 1 freq gaspin (3) - 13 freq gasped (3) - 21 freq graips (3) - 3 freq gusts (3) - 5 freq esps (3) - 2 freq wisps (3) - 3 freq gausp (3) - 2 freq |
SoundEx code - G212 gasps - 7 freq guiss-gabs - 1 freq gossip's - 1 freq gossips - 1 freq gazpacho - 1 freq gasbag - 1 freq gijgpxxnhj - 1 freq ghgvaexl - 1 freq gukbzihywd - 1 freq ggijbc - 1 freq |
MetaPhone code - KSPS gasps - 7 freq gossip's - 1 freq gossips - 1 freq csps - 1 freq hxwps - 1 freq |
GASPS |
| Time to execute Levenshtein function - 0.996241 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 - 1.782742 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.107120 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.192838 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.001109 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. |