| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kneb (0) - 1 freq knew (1) - 218 freq knee (1) - 125 freq neb (1) - 274 freq keb (1) - 2 freq knob (1) - 12 freq knei (1) - 1 freq kane (2) - 31 freq oney (2) - 15 freq kni (2) - 1 freq nab (2) - 10 freq kb (2) - 4 freq kte (2) - 1 freq uner (2) - 2 freq knot (2) - 27 freq kre (2) - 1 freq onee (2) - 2 freq onyb (2) - 1 freq beb (2) - 1 freq gdeb (2) - 1 freq knoab (2) - 1 freq nfb (2) - 1 freq heb (2) - 1 freq knap (2) - 9 freq keep (2) - 1525 freq |
kneb (0) - 1 freq knob (1) - 12 freq knew (2) - 218 freq knoab (2) - 1 freq knee (2) - 125 freq knei (2) - 1 freq neb (2) - 274 freq keb (2) - 2 freq snab (3) - 1 freq snb (3) - 2 freq knj (3) - 1 freq hnb (3) - 1 freq knobs (3) - 7 freq nebe (3) - 4 freq kynes (3) - 11 freq kenobi (3) - 1 freq knox (3) - 34 freq snib (3) - 5 freq nebo (3) - 1 freq kneel (3) - 15 freq koen (3) - 2 freq knee' (3) - 1 freq ken (3) - 5053 freq kirb (3) - 1 freq kines (3) - 21 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 |
KNEB |
| Time to execute Levenshtein function - 0.296635 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.417213 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.027359 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.039619 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.000835 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. |