| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kinches (0) - 8 freq finches (1) - 1 freq inches (1) - 97 freq pinches (1) - 2 freq riches (2) - 23 freq lenches (2) - 1 freq pinchers (2) - 2 freq witches (2) - 35 freq winched (2) - 4 freq hitches (2) - 2 freq pinched (2) - 19 freq painches (2) - 1 freq kinshen (2) - 1 freq pincher (2) - 2 freq inched (2) - 2 freq cinched (2) - 1 freq flinches (2) - 1 freq wenches (2) - 2 freq kitchens (2) - 6 freq kinochers (2) - 2 freq benches (2) - 13 freq ditches (2) - 8 freq bunches (2) - 6 freq kinchie (2) - 5 freq pitches (2) - 14 freq |
kinches (0) - 8 freq finches (2) - 1 freq pinches (2) - 2 freq inches (2) - 97 freq kinchie (3) - 5 freq bunches (3) - 6 freq lunches (3) - 7 freq kinochers (3) - 2 freq benches (3) - 13 freq kinch (3) - 19 freq niches (3) - 1 freq wenches (3) - 2 freq punches (3) - 5 freq inchis (3) - 1 freq dunches (3) - 1 freq lenches (3) - 1 freq painches (3) - 1 freq cinched (4) - 1 freq bitches (4) - 6 freq pinchers (4) - 2 freq witches (4) - 35 freq inehes (4) - 1 freq finces (4) - 1 freq keechs (4) - 1 freq kechs (4) - 1 freq |
SoundEx code - K522 kinches - 8 freq knockha's - 1 freq kenzie's - 11 freq kenzies - 1 freq kink-hoast - 3 freq knockshuggie - 1 freq kingsize - 1 freq kamikazee - 1 freq kanga's - 11 freq kangas - 2 freq kingis - 2 freq knaggies - 2 freq kynges - 1 freq konshislee - 1 freq konshis - 1 freq konsistint - 1 freq kmxeoswftr - 1 freq kamuqwxccl - 1 freq kenziechurch - 3 freq kingkeg - 2 freq knashes - 1 freq |
MetaPhone code - KNXS kinches - 8 freq ganshes - 11 freq connachs - 1 freq konshis - 1 freq conshis - 1 freq |
KINCHES |
| Time to execute Levenshtein function - 0.206460 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.381270 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.029648 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.037558 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.000838 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. |