| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gasbag (0) - 1 freq garbage (2) - 9 freq hanbag (2) - 1 freq galba (2) - 1 freq bawbag (2) - 13 freq taybag (2) - 2 freq garbeg (2) - 2 freq ratbag (2) - 2 freq gaspan (2) - 1 freq gobban (3) - 1 freq barbar (3) - 29 freq maebae (3) - 2 freq gaga (3) - 1 freq galla (3) - 2 freq asia (3) - 12 freq raag (3) - 3 freq giban (3) - 1 freq gassy (3) - 1 freq gaskit (3) - 1 freq haslam (3) - 1 freq castan (3) - 1 freq gaspin (3) - 13 freq gustav (3) - 2 freq gainan (3) - 1 freq greba (3) - 8 freq |
gasbag (0) - 1 freq garbeg (3) - 2 freq garbage (3) - 9 freq hanbag (4) - 1 freq gaspan (4) - 1 freq essibag (4) - 2 freq ratbag (4) - 2 freq taybag (4) - 2 freq galba (4) - 1 freq bawbag (4) - 13 freq gaspit (5) - 5 freq cabbage (5) - 15 freq saag (5) - 1 freq gatsby (5) - 1 freq skag (5) - 3 freq shag (5) - 14 freq gaub (5) - 1 freq gasped (5) - 21 freq glasgaa (5) - 1 freq basebaa (5) - 1 freq gaeg (5) - 1 freq gpsg (5) - 1 freq gases (5) - 6 freq deasbad (5) - 2 freq gaisge (5) - 1 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 - KSBK gasbag - 1 freq |
GASBAG |
| Time to execute Levenshtein function - 0.183114 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.346217 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.029151 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.037935 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.000791 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. |