Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
sainsbury (0) - 1 freq sainsbury's (2) - 1 freq sinburn (3) - 2 freq gainsbourg (3) - 1 freq lisburn (4) - 1 freq cadbury (4) - 3 freq queensbury (4) - 1 freq sanitary (4) - 6 freq scantlbury (4) - 1 freq sindry (4) - 131 freq edinburg (4) - 1 freq hairtburn (4) - 1 freq salzburg (4) - 1 freq ainswert (4) - 1 freq sanctuary (4) - 11 freq maisure (4) - 1 freq sains (4) - 4 freq injury (4) - 16 freq edinburry (4) - 1 freq sensory (4) - 4 freq hapsburg (4) - 1 freq gainstuid (4) - 1 freq spinster (4) - 4 freq saundbaurs (4) - 1 freq ainster (4) - 2 freq |
sainsbury (0) - 1 freq sainsbury's (4) - 1 freq sensory (5) - 4 freq queensbury (5) - 1 freq gainsbourg (5) - 1 freq sinburn (5) - 2 freq ainster (6) - 2 freq sinsible (6) - 1 freq spinster (6) - 4 freq insure (6) - 2 freq snobbery (6) - 9 freq saundbaurs (6) - 1 freq sistur (6) - 2 freq sneistery (6) - 1 freq snsbi (6) - 1 freq sensibly (6) - 2 freq slaistery (6) - 4 freq mainser (6) - 2 freq seinister (6) - 3 freq sangbuik (6) - 1 freq sindry (6) - 131 freq sanctuary (6) - 11 freq sanitary (6) - 6 freq sains (6) - 4 freq sinister (6) - 10 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 - SNSBR sainsbury - 1 freq |
SAINSBURY |
Time to execute Levenshtein function - 0.225149 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.366482 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.028143 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.037801 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.000843 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. |