Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
knowan (0) - 2 freq known (1) - 67 freq knowin (1) - 56 freq know-an (1) - 1 freq snowman (2) - 2 freq bowan (2) - 1 freq anywan (2) - 28 freq knowin' (2) - 2 freq knowe (2) - 56 freq know (2) - 1205 freq gowan (2) - 16 freq howan (2) - 1 freq slowan (2) - 1 freq knawn (2) - 6 freq showan (2) - 5 freq koran (2) - 1 freq stowan (2) - 1 freq onywan (2) - 19 freq knows (2) - 168 freq chowan (2) - 2 freq knockan (2) - 3 freq snowin (2) - 4 freq erowan (2) - 1 freq blowan (2) - 5 freq rowan (2) - 18 freq |
knowan (0) - 2 freq knowin (1) - 56 freq known (1) - 67 freq knawin (2) - 3 freq knawn (2) - 6 freq know-an (2) - 1 freq know' (3) - 1 freq snowin (3) - 4 freq knowing (3) - 5 freq knowes (3) - 25 freq knowed (3) - 64 freq onywan (3) - 19 freq knowte (3) - 1 freq knifan (3) - 1 freq knows (3) - 168 freq knowe (3) - 56 freq know (3) - 1205 freq anywan (3) - 28 freq knowin' (3) - 2 freq unknown (4) - 8 freq knypin (4) - 4 freq ranown (4) - 1 freq snawin (4) - 6 freq knaws (4) - 4 freq newin (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 |
KNOWAN |
Time to execute Levenshtein function - 0.237503 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.495465 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.029474 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.046931 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.001223 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. |