Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
knawledge (0) - 42 freq knowledge (1) - 85 freq knawlege (1) - 5 freq acknawledge (2) - 3 freq acknawledges (3) - 1 freq knawed (3) - 1 freq acknawledged (3) - 4 freq acknawlege (3) - 1 freq knarled (3) - 1 freq acknowledge (3) - 22 freq nailed (4) - 16 freq snarlene (4) - 1 freq acknowledged (4) - 13 freq challenge (4) - 79 freq manawdge (4) - 2 freq kneeled (4) - 3 freq knacketie (4) - 2 freq colledge (4) - 1 freq acknowledges (4) - 4 freq shawled (4) - 1 freq acknaulege (4) - 1 freq aedge (4) - 8 freq allege (4) - 1 freq snawed (4) - 6 freq snawline (4) - 1 freq |
knawledge (0) - 42 freq knowledge (1) - 85 freq knawlege (2) - 5 freq acknawledge (3) - 3 freq acknowledge (4) - 22 freq knarled (5) - 1 freq acknawlege (5) - 1 freq acknawledged (5) - 4 freq acknawledges (5) - 1 freq knawed (5) - 1 freq acknowledges (6) - 4 freq acknawledgit (6) - 1 freq knowed (6) - 64 freq kneeled (6) - 3 freq knowledgable (6) - 1 freq manawdge (6) - 2 freq acknowledged (6) - 13 freq knidge (6) - 2 freq trawled (7) - 3 freq gledge (7) - 1 freq fledge (7) - 1 freq sledge (7) - 6 freq knowing (7) - 5 freq gnawed (7) - 5 freq acknowledgin (7) - 4 freq |
SoundEx code - K543 knelt - 21 freq knowledge - 85 freq knawledge - 42 freq knowledgable - 1 freq kneeled - 3 freq kneelt - 3 freq kinnelt - 3 freq kennled - 2 freq kinnlt - 1 freq knelit - 1 freq kummelled - 1 freq kennelt - 1 freq kneeld - 1 freq kinnilt - 1 freq kinleydesmond - 1 freq knowledgeable - 1 freq |
MetaPhone code - NLJ knowledge - 85 freq knawledge - 42 freq knawlege - 5 freq |
KNAWLEDGE |
Time to execute Levenshtein function - 0.206586 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.355792 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.027415 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.036978 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.000965 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. |