Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
isbimpfllr (0) - 1 freq simpler (4) - 4 freq 'simply (5) - 1 freq sempler (5) - 2 freq simple (5) - 205 freq sampler (5) - 3 freq simmilar (5) - 1 freq similar (5) - 60 freq seimilar (5) - 7 freq sempill (5) - 3 freq i'bill (5) - 2 freq 'simple (5) - 2 freq isbister (5) - 2 freq simply (5) - 123 freq simples (5) - 10 freq simpil (5) - 1 freq simplie (5) - 1 freq step'll (6) - 1 freq wimplin (6) - 6 freq still' (6) - 2 freq swipper (6) - 8 freq saumples (6) - 1 freq bumfils (6) - 1 freq intimately (6) - 1 freq billo (6) - 1 freq |
isbimpfllr (0) - 1 freq simpler (7) - 4 freq sempill (8) - 3 freq sampler (8) - 3 freq sempler (8) - 2 freq simpil (9) - 1 freq simples (9) - 10 freq simplie (9) - 1 freq shamefully (9) - 2 freq smaller (9) - 13 freq sammillar (9) - 1 freq speller (9) - 2 freq simply (9) - 123 freq simmilar (9) - 1 freq similar (9) - 60 freq seimilar (9) - 7 freq simple (9) - 205 freq spieler (10) - 1 freq skilfully (10) - 1 freq spellt (10) - 9 freq smellt (10) - 3 freq smell (10) - 271 freq implore (10) - 1 freq spills (10) - 9 freq sabill (10) - 1 freq |
SoundEx code - I215 icivin - 1 freq isbn - 23 freq ice-boond - 1 freq ixkfmpbsxq - 2 freq isbimpfllr - 1 freq |
MetaPhone code - ISBMPFLR isbimpfllr - 1 freq |
ISBIMPFLLR |
Time to execute Levenshtein function - 0.223619 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.374902 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.033807 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.037754 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.001007 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. |