| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| knackert (0) - 1 freq knackers (1) - 2 freq knackerit (1) - 1 freq knacker (1) - 4 freq knockers (2) - 2 freq knackt (2) - 1 freq knicker (2) - 2 freq snickert (2) - 1 freq knocker (2) - 2 freq knackerin (2) - 1 freq knackered (2) - 16 freq knickers (2) - 42 freq knocket (2) - 1 freq knackeroso (3) - 1 freq poacket (3) - 34 freq knack (3) - 12 freq backet (3) - 8 freq smacker (3) - 3 freq whacker (3) - 1 freq packet (3) - 59 freq cackelt (3) - 1 freq knapper (3) - 2 freq snookert (3) - 1 freq hankert (3) - 1 freq knackie (3) - 10 freq |
knackert (0) - 1 freq knackerit (1) - 1 freq knacker (2) - 4 freq knackers (2) - 2 freq knackered (3) - 16 freq knickers (3) - 42 freq knocket (3) - 1 freq knackerin (3) - 1 freq snickert (3) - 1 freq knocker (3) - 2 freq knackt (3) - 1 freq knockers (3) - 2 freq knicker (3) - 2 freq knockout (4) - 2 freq knockt (4) - 4 freq knockit (4) - 13 freq knacketie (4) - 2 freq nickerit (4) - 1 freq knackeroso (4) - 1 freq knacky (5) - 3 freq snicker (5) - 1 freq nickers (5) - 1 freq uncankert (5) - 3 freq snichert (5) - 2 freq knocked (5) - 62 freq |
SoundEx code - K526 knickers - 42 freq knackered - 16 freq knacker - 4 freq knackerin - 1 freq knackerit - 1 freq kingriks - 1 freq knockroe - 1 freq knocker - 2 freq knicker - 2 freq knockers - 2 freq kincardine - 5 freq kangaroos - 1 freq kangaroo - 2 freq kïngrick - 5 freq keingryke - 5 freq kincorth - 2 freq kangrick - 6 freq kongir - 1 freq kingrip - 1 freq kincardineshire - 1 freq knackers - 2 freq kin-carers - 1 freq €œkeingryke - 1 freq knackeroso - 1 freq kinkardine - 1 freq konservative - 1 freq knackert - 1 freq konzrbzyuw - 1 freq kingrick - 2 freq kimmycricket - 1 freq kennacraig - 1 freq kanachrine - 1 freq kinochers - 2 freq kymqr - 1 freq kmcharg - 13 freq kennygrainger - 1 freq |
MetaPhone code - NKRT knackered - 16 freq nickerit - 1 freq knackerit - 1 freq knackert - 1 freq |
KNACKERT |
| Time to execute Levenshtein function - 0.203999 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.399688 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.027414 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.037450 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.000846 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. |