| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gazing (0) - 6 freq grazing (1) - 3 freq gaming (1) - 3 freq gazin (1) - 18 freq dating (2) - 8 freq making (2) - 57 freq haeing (2) - 4 freq yasing (2) - 2 freq laying (2) - 8 freq gavin (2) - 42 freq giving (2) - 25 freq glazin (2) - 2 freq gain (2) - 53 freq gaig (2) - 1 freq waning (2) - 1 freq raving (2) - 2 freq yazin (2) - 3 freq gyping (2) - 1 freq mating (2) - 1 freq gawin (2) - 25 freq eating (2) - 18 freq gamin (2) - 3 freq daeing (2) - 2 freq gaeng (2) - 10 freq saving (2) - 4 freq |
gazing (0) - 6 freq grazing (2) - 3 freq gazin (2) - 18 freq gaming (2) - 3 freq geeing (3) - 1 freq going (3) - 234 freq gang (3) - 1098 freq gaining (3) - 2 freq ging (3) - 343 freq gjing (3) - 2 freq gaung (3) - 5 freq gazan (3) - 2 freq geing (3) - 1 freq amazing (3) - 30 freq gaeng (3) - 10 freq gying (3) - 38 freq goading (3) - 1 freq zing (3) - 3 freq giving (3) - 25 freq gyping (3) - 1 freq gains (4) - 8 freq haeing (4) - 4 freq yasing (4) - 2 freq saying (4) - 107 freq cawing (4) - 3 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 - KSNK casing - 1 freq gazing - 6 freq guessing - 7 freq causing - 8 freq kissing - 2 freq gassing - 1 freq |
GAZING |
| Time to execute Levenshtein function - 0.191973 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.384392 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.027817 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.040643 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.001019 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. |