| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sinsible (0) - 1 freq sensible (1) - 34 freq visible (2) - 25 freq ansible (2) - 2 freq sensibly (2) - 2 freq risible (2) - 1 freq veesible (3) - 4 freq inside (3) - 569 freq visable (3) - 1 freq dinsdale (3) - 1 freq sinnie (3) - 1 freq possible (3) - 179 freq sinnle (3) - 1 freq missile (3) - 6 freq snaile (3) - 1 freq faisible (3) - 3 freq veisible (3) - 1 freq sinsyne (3) - 30 freq singil (3) - 34 freq single (3) - 245 freq sinshene (3) - 1 freq sissie (3) - 1 freq sinkhole (3) - 2 freq visibly (3) - 9 freq sitable (3) - 2 freq |
sinsible (0) - 1 freq sensible (1) - 34 freq sensibly (2) - 2 freq ansible (3) - 2 freq visible (4) - 25 freq esponsible (4) - 1 freq risible (4) - 1 freq feasible (5) - 2 freq tangible (5) - 4 freq sonsie (5) - 54 freq poasible (5) - 1 freq sinse (5) - 20 freq sibble (5) - 1 freq sindle (5) - 1 freq sinngle (5) - 8 freq sinse'll (5) - 1 freq senile (5) - 1 freq disable (5) - 1 freq snsbi (5) - 1 freq sizeable (5) - 4 freq invisible (5) - 44 freq sinshine (5) - 10 freq insole (5) - 1 freq ostensibly (5) - 4 freq winnable (5) - 1 freq |
SoundEx code - S521 sensible - 34 freq smoke-blackened - 1 freq singapore - 9 freq swingpark - 1 freq songbirds - 2 freq semi-quavers - 1 freq shinsplints - 1 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 - 34 freq sinsible - 1 freq sensibly - 2 freq |
SINSIBLE |
| Time to execute Levenshtein function - 0.212323 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.404396 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.027631 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.038968 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.000990 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. |