| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kidneys (0) - 6 freq kidney (1) - 10 freq ridness (2) - 1 freq kines (2) - 21 freq sidney's (2) - 4 freq widney (2) - 5 freq sidney (2) - 23 freq kindness (2) - 45 freq kinnens (2) - 4 freq linens (3) - 1 freq bairneys (3) - 1 freq kness (3) - 1 freq kinneff (3) - 1 freq minys (3) - 1 freq rodney (3) - 1 freq kirnells (3) - 1 freq idders (3) - 40 freq nipnebs (3) - 5 freq mine's (3) - 18 freq kidded (3) - 1 freq midgets (3) - 5 freq kirnel (3) - 5 freq milne's (3) - 1 freq 'sidney's (3) - 1 freq kivers (3) - 3 freq |
kidneys (0) - 6 freq kidney (2) - 10 freq kines (3) - 21 freq knees (4) - 174 freq kiddies (4) - 2 freq kneis (4) - 1 freq kanes (4) - 2 freq klines (4) - 1 freq kidnap (4) - 4 freq kilns (4) - 1 freq kidds (4) - 2 freq kyndnes (4) - 1 freq kid's (4) - 1 freq kins (4) - 15 freq kynes (4) - 11 freq sidney (4) - 23 freq kindness (4) - 45 freq widney (4) - 5 freq sidney's (4) - 4 freq ridness (4) - 1 freq kirns (4) - 2 freq kinnens (4) - 4 freq saidnes (4) - 1 freq kids (4) - 87 freq knas (5) - 1 freq |
SoundEx code - K352 kidding - 8 freq kittens - 7 freq kitten's - 1 freq kith-ens - 1 freq keating - 1 freq kyittums - 1 freq kythins - 1 freq kidneys - 6 freq kayeadams - 1 freq kiddingaroundhq - 1 freq khwdmct - 1 freq kittenish - 1 freq kthomsonacademy - 4 freq |
MetaPhone code - KTNS guidance - 42 freq goodness - 30 freq cuttins - 5 freq quateness - 8 freq cadence - 2 freq guidness - 22 freq quitance - 1 freq kittens - 7 freq goodniss - 1 freq guidiness - 1 freq quietness - 2 freq gowdens - 1 freq quaitness - 3 freq gödness - 5 freq godness - 1 freq kitten's - 1 freq cutteen's - 1 freq guidins - 1 freq cuttin's - 1 freq guid-anes - 1 freq kidneys - 6 freq quaetness - 1 freq cuttance - 7 freq quittance - 3 freq quietens - 1 freq codonas - 1 freq goodnes - 1 freq |
KIDNEYS |
| Time to execute Levenshtein function - 0.302682 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.732982 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.079582 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.086257 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.000799 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. |