| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| knabbie (0) - 4 freq nabbie (1) - 7 freq nebbie (2) - 9 freq nibbie (2) - 1 freq nabbit (2) - 2 freq rabbie (2) - 63 freq knaggie (2) - 5 freq knobbies (2) - 2 freq mabbie (2) - 1 freq babbie (2) - 34 freq fabbie (2) - 2 freq gabbie (2) - 1 freq scabbie (2) - 2 freq grabbie (2) - 3 freq habbie (2) - 9 freq nubbie (2) - 1 freq tabbie (2) - 1 freq crabbie (2) - 2 freq skabbie (2) - 1 freq cabbie (2) - 3 freq knobble (2) - 4 freq abbie (2) - 59 freq knobbit (2) - 1 freq nabbin (2) - 2 freq knackie (2) - 10 freq |
knabbie (0) - 4 freq nabbie (2) - 7 freq knobble (3) - 4 freq nubbie (3) - 1 freq knobbit (3) - 1 freq knobbies (3) - 2 freq nibbie (3) - 1 freq nebbie (3) - 9 freq cabbie (4) - 3 freq skabbie (4) - 1 freq kabb (4) - 1 freq nabbin (4) - 2 freq crabbie (4) - 2 freq kenable (4) - 19 freq knackie (4) - 10 freq knobbly (4) - 4 freq abbie (4) - 59 freq rabbie (4) - 63 freq babbie (4) - 34 freq tabbie (4) - 1 freq mabbie (4) - 1 freq knaggie (4) - 5 freq fabbie (4) - 2 freq nabbit (4) - 2 freq gabbie (4) - 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 |
KNABBIE |
| Time to execute Levenshtein function - 0.167752 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.326949 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.027640 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.037026 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. |