| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sensible (0) - 33 freq sensibly (1) - 2 freq sinsible (1) - 1 freq veesible (2) - 4 freq senile (2) - 1 freq ansible (2) - 2 freq feasible (2) - 1 freq veisible (2) - 1 freq gentile (3) - 3 freq servile (3) - 1 freq sentle (3) - 1 freq faisible (3) - 3 freq sessione (3) - 2 freq risible (3) - 1 freq ostensibly (3) - 4 freq terrible (3) - 129 freq edible (3) - 3 freq senzie (3) - 1 freq tangible (3) - 3 freq ensemble (3) - 4 freq legible (3) - 3 freq pensie (3) - 3 freq benside (3) - 1 freq seeable (3) - 1 freq sensing (3) - 1 freq |
sensible (0) - 33 freq sensibly (1) - 2 freq sinsible (1) - 1 freq ansible (3) - 2 freq esponsible (4) - 1 freq ostensibly (4) - 4 freq veisible (4) - 1 freq feasible (4) - 1 freq senile (4) - 1 freq veesible (4) - 4 freq sensitive (5) - 16 freq sensethe (5) - 1 freq visible (5) - 22 freq kennable (5) - 3 freq kenable (5) - 19 freq poasible (5) - 1 freq enable (5) - 4 freq sensyne (5) - 7 freq sense (5) - 513 freq possible (5) - 172 freq snaile (5) - 1 freq sonsie (5) - 53 freq snsbi (5) - 1 freq enviable (5) - 1 freq tenable (5) - 1 freq |
SoundEx code - S521 sensible - 33 freq smoke-blackened - 1 freq singapore - 9 freq swingpark - 1 freq songbirds - 2 freq semi-quavers - 1 freq shinsplints - 2 freq sangbuik - 1 freq songbook - 1 freq snackbar - 1 freq sinsible - 1 freq songbird - 1 freq sunspots - 1 freq snakebake - 2 freq sangbeuks - 1 freq sinkfae - 1 freq snaa-covered - 1 freq sainsbury - 1 freq sensibly - 2 freq sainsbury's - 1 freq scenesofulster - 1 freq shanksybraniel - 1 freq snxvusgkj - 1 freq simchafisher - 2 freq swansofficial - 1 freq sneekyboy - 1 freq sensibeilities - 1 freq sangobeg - 1 freq snsbi - 1 freq smqscjpxza - 2 freq sonzyb - 2 freq |
MetaPhone code - SNSBL sensible - 33 freq sinsible - 1 freq sensibly - 2 freq |
SENSIBLE |
| Time to execute Levenshtein function - 0.189875 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.378841 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.027840 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.037067 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.000827 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. |