| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gnashers (0) - 1 freq nashers (1) - 2 freq gnashes (1) - 1 freq snashers (1) - 1 freq knashes (2) - 1 freq snashes (2) - 2 freq washers (2) - 1 freq gushers (2) - 1 freq rashers (2) - 1 freq gathers (2) - 3 freq crashers (2) - 2 freq punishers (3) - 1 freq gawkers (3) - 1 freq blathers (3) - 2 freq snatters (3) - 1 freq answers (3) - 74 freq masters (3) - 10 freq gangers (3) - 2 freq fushers (3) - 1 freq smashes (3) - 1 freq gauners (3) - 1 freq poachers (3) - 4 freq gadders (3) - 4 freq roasters (3) - 8 freq grayhens (3) - 1 freq |
gnashers (0) - 1 freq gnashes (2) - 1 freq snashers (2) - 1 freq nashers (2) - 2 freq gushers (3) - 1 freq punishers (4) - 1 freq gathers (4) - 3 freq ganshes (4) - 11 freq crashers (4) - 2 freq rashers (4) - 1 freq washers (4) - 1 freq snashes (4) - 2 freq knashes (4) - 1 freq inshe's (5) - 1 freq gousters (5) - 3 freq fishers (5) - 14 freq ans'ers (5) - 1 freq fleshers (5) - 3 freq nothers (5) - 1 freq anothers (5) - 1 freq gangsters (5) - 11 freq gnashing (5) - 1 freq feshers (5) - 1 freq blushers (5) - 1 freq guisers (5) - 8 freq |
SoundEx code - G526 ginger - 121 freq 'gangrel - 1 freq gangrel - 11 freq ganger - 1 freq 'ginger' - 1 freq gangers - 2 freq gennesaret - 1 freq genessaretb - 1 freq gum-chawer - 1 freq gngirs - 1 freq gnashers - 1 freq gingerly - 2 freq gangrels - 1 freq gingerbread - 4 freq gangrel's - 1 freq gang-roond - 14 freq gingerbried - 15 freq gznqrduu - 1 freq gingertotty - 3 freq gingerboab - 5 freq gingergeekcraig - 1 freq |
MetaPhone code - NXRS gnashers - 1 freq nashers - 2 freq |
GNASHERS |
| Time to execute Levenshtein function - 0.317029 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.449832 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.029268 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.040082 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.000981 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. |