| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gnawin (0) - 2 freq gawin (1) - 25 freq gnawing (1) - 1 freq snawin (1) - 6 freq gnawit (1) - 1 freq knawin (1) - 3 freq grawin (1) - 13 freq glawin (1) - 2 freq cawin (2) - 60 freq gain (2) - 53 freq gawn (2) - 34 freq gaain (2) - 2 freq drawin (2) - 113 freq snarin (2) - 2 freq gawkin (2) - 13 freq swawin (2) - 2 freq grazin (2) - 11 freq gavin (2) - 42 freq snaain (2) - 2 freq glowin (2) - 28 freq gntwvn (2) - 1 freq gawpin (2) - 33 freq gvaain (2) - 1 freq hawin (2) - 2 freq goavin (2) - 1 freq |
gnawin (0) - 2 freq knawin (2) - 3 freq glawin (2) - 2 freq gnawit (2) - 1 freq grawin (2) - 13 freq gawin (2) - 25 freq snawin (2) - 6 freq gnawing (2) - 1 freq gawain (3) - 1 freq gruwin (3) - 3 freq grawn (3) - 4 freq newin (3) - 1 freq knawn (3) - 6 freq snowin (3) - 4 freq gnaw (3) - 6 freq glowin (3) - 28 freq gaanin (3) - 3 freq growin (3) - 237 freq knowin (3) - 46 freq gnawed (3) - 5 freq gawn (3) - 34 freq gown (4) - 2 freq gaapin (4) - 1 freq nasin (4) - 1 freq gantin (4) - 23 freq |
SoundEx code - G550 ginin - 1 freq gainin - 11 freq gnome - 2 freq genuine - 32 freq gamyn - 1 freq gnawin - 2 freq gammon - 5 freq gimin - 2 freq gemini - 2 freq gaanin - 3 freq gannan - 1 freq gummin - 1 freq gainan - 1 freq gomin - 21 freq genome - 2 freq gamin - 3 freq gymin - 1 freq gameon - 1 freq gnom - 2 freq gemmin - 1 freq genuine - 1 freq genuine - 1 freq |
MetaPhone code - NWN newin - 1 freq knowin - 46 freq naewan - 13 freq gnawin - 2 freq knowin' - 2 freq knawin - 3 freq knowan - 2 freq |
GNAWIN |
| Time to execute Levenshtein function - 0.309943 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.505852 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.065710 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.037372 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.000804 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. |