| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| knowin (0) - 56 freq knowing (1) - 5 freq knawin (1) - 3 freq snowin (1) - 4 freq known (1) - 67 freq knowan (1) - 2 freq knowin' (1) - 2 freq snorin (2) - 19 freq kowkin (2) - 1 freq mowin (2) - 2 freq notin (2) - 6 freq nogin (2) - 1 freq snowing (2) - 4 freq hyowin (2) - 2 freq newin (2) - 1 freq nohin (2) - 1 freq knawn (2) - 6 freq 'lowin (2) - 1 freq rowin (2) - 30 freq chowin (2) - 16 freq snawin (2) - 6 freq snokin (2) - 2 freq stowin (2) - 6 freq gnawin (2) - 2 freq nonin (2) - 1 freq |
knowin (0) - 56 freq known (1) - 67 freq knowan (1) - 2 freq knawin (1) - 3 freq knawn (2) - 6 freq snowin (2) - 4 freq knowin' (2) - 2 freq knowing (2) - 5 freq know-an (3) - 1 freq knowe (3) - 56 freq know' (3) - 1 freq knowte (3) - 1 freq knows (3) - 168 freq know (3) - 1205 freq snawin (3) - 6 freq knowes (3) - 25 freq knypin (3) - 4 freq knowed (3) - 64 freq gnawin (3) - 2 freq newin (3) - 1 freq slowin (4) - 14 freq knawed (4) - 1 freq cowin (4) - 1 freq knifan (4) - 1 freq komin (4) - 1 freq |
SoundEx code - K550 kennin - 297 freq known - 67 freq knowin - 56 freq know-an - 1 freq ken-an - 3 freq kinema - 8 freq keenin - 10 freq kennen - 2 freq 'kennin' - 1 freq kennin' - 1 freq kiemon - 1 freq kenyon - 1 freq ken'an - 1 freq kennan - 14 freq kenan - 3 freq knowin' - 2 freq kinnen - 4 freq kenin - 2 freq knawin - 3 freq kaenin - 2 freq knowan - 2 freq keneen - 2 freq ken-me-na - 1 freq knawn - 6 freq kanani - 1 freq kanin - 1 freq komin - 1 freq kemonn - 1 freq kinnon - 12 freq |
MetaPhone code - NWN newin - 1 freq knowin - 56 freq naewan - 22 freq gnawin - 2 freq knowin' - 2 freq knawin - 3 freq knowan - 2 freq |
KNOWIN |
| Time to execute Levenshtein function - 0.181088 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.377855 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.028489 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.036856 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.000978 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. |