| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gigging (0) - 1 freq giggling (1) - 2 freq digging (1) - 9 freq bigging (1) - 1 freq rigging (1) - 1 freq giggin (1) - 2 freq gaggin (2) - 7 freq jogging (2) - 1 freq hugging (2) - 2 freq giving (2) - 26 freq ganging (2) - 3 freq liggin (2) - 32 freq hinging (2) - 11 freq biggins (2) - 54 freq diggin' (2) - 1 freq mugging (2) - 2 freq biggin (2) - 208 freq signing (2) - 12 freq jiggin (2) - 37 freq piggin (2) - 10 freq biggings (2) - 3 freq pinging (2) - 1 freq singing (2) - 30 freq gigglin (2) - 13 freq giggilt (2) - 12 freq |
gigging (0) - 1 freq giggling (2) - 2 freq giggin (2) - 2 freq rigging (2) - 1 freq digging (2) - 9 freq bigging (2) - 1 freq mugging (3) - 2 freq lagging (3) - 2 freq ganging (3) - 3 freq bogging (3) - 2 freq gaggin (3) - 7 freq jogging (3) - 1 freq hugging (3) - 2 freq tiggin (4) - 2 freq ringing (4) - 4 freq gingin (4) - 11 freq dinging (4) - 1 freq higgins (4) - 23 freq girning (4) - 1 freq diggings (4) - 1 freq googling (4) - 1 freq engaging (4) - 4 freq minging (4) - 5 freq winging (4) - 1 freq pighing (4) - 1 freq |
SoundEx code - G252 guessin-wha's - 1 freq goshen's - 1 freq gazing - 6 freq guessing - 7 freq gizzens - 1 freq gassing - 1 freq gegenhegemonie - 1 freq gigging - 1 freq ghgmuj - 1 freq |
MetaPhone code - JKNK jogging - 1 freq jowking - 1 freq joking - 1 freq gigging - 1 freq jacking - 1 freq |
GIGGING |
| Time to execute Levenshtein function - 0.223966 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.368390 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.029040 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.037568 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.000930 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. |