| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| knob (0) - 12 freq snob (1) - 10 freq kno (1) - 16 freq knot (1) - 27 freq knox (1) - 34 freq kneb (1) - 1 freq knobs (1) - 7 freq nob (1) - 1 freq knos (1) - 1 freq know (1) - 1123 freq knoab (1) - 1 freq kabb (2) - 1 freq cnoc (2) - 1 freq lob (2) - 5 freq slob (2) - 1 freq kgb (2) - 3 freq kso (2) - 2 freq kyo (2) - 2 freq kuo (2) - 3 freq nab (2) - 10 freq kjow (2) - 1 freq kop (2) - 2 freq ino (2) - 2 freq noo (2) - 5660 freq knock (2) - 111 freq |
knob (0) - 12 freq kneb (1) - 1 freq knoab (1) - 1 freq know (2) - 1123 freq knot (2) - 27 freq kenobi (2) - 1 freq knos (2) - 1 freq snob (2) - 10 freq kno (2) - 16 freq nob (2) - 1 freq knox (2) - 34 freq knobs (2) - 7 freq hnb (3) - 1 freq kano (3) - 1 freq knoax (3) - 1 freq snab (3) - 1 freq kerb (3) - 6 freq kirb (3) - 1 freq aknow (3) - 1 freq nub (3) - 5 freq keb (3) - 2 freq ktb (3) - 1 freq snb (3) - 2 freq snub (3) - 2 freq bnb (3) - 1 freq |
SoundEx code - K510 knife - 102 freq knave - 48 freq kinnefa - 1 freq kemp - 46 freq 'knife - 1 freq kempie - 1 freq kempe - 3 freq knapp - 2 freq knob - 12 freq knif - 1 freq knap - 9 freq knappy - 1 freq kneb - 1 freq kinneff - 1 freq knoab - 1 freq knap-hie - 1 freq knabbie - 4 freq kempy - 2 freq kyemp - 1 freq €˜knifey - 1 freq €˜k-nife - 1 freq kumbh - 3 freq kmf - 1 freq kenobi - 1 freq kennef - 1 freq kqmv - 1 freq |
MetaPhone code - NB neb - 274 freq nebbie - 9 freq nabbie - 7 freq nab - 10 freq nebby - 2 freq newbie - 2 freq nub - 5 freq nubbie - 1 freq nib - 10 freq knob - 12 freq nob - 1 freq neib - 1 freq kneb - 1 freq nebe - 4 freq knoab - 1 freq neeb - 2 freq knabbie - 4 freq naeb - 8 freq nibbie - 1 freq nb - 4 freq nebo - 1 freq ynbiw - 1 freq hnb - 1 freq nobby - 1 freq |
KNOB |
| Time to execute Levenshtein function - 0.194877 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.326938 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.029615 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.037212 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.000769 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. |