Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
summarises (0) - 1 freq summarised (1) - 2 freq summarise (1) - 1 freq summarie (2) - 3 freq submarines (2) - 3 freq samarites (3) - 1 freq submarine (3) - 5 freq suprises (3) - 1 freq surprises (3) - 11 freq summarily (3) - 1 freq sumbarine (3) - 1 freq sunrises (3) - 2 freq sumtimes (4) - 12 freq arises (4) - 5 freq sumgates (4) - 1 freq sumtaims (4) - 6 freq summerled (4) - 1 freq surmised (4) - 2 freq luminaries (4) - 2 freq summary (4) - 3 freq surprised (4) - 152 freq surmise (4) - 3 freq rummies (4) - 1 freq sutprised (4) - 1 freq dungaries (4) - 1 freq |
summarises (0) - 1 freq summarise (2) - 1 freq summarised (2) - 2 freq submarines (4) - 3 freq summarie (4) - 3 freq sunrises (5) - 2 freq summer's (5) - 15 freq summarily (5) - 1 freq summers (5) - 13 freq surprises (5) - 11 freq suprises (5) - 1 freq samarites (5) - 1 freq sammishes (6) - 1 freq simmers' (6) - 1 freq sommies (6) - 3 freq summin's (6) - 1 freq summits (6) - 5 freq summarlid (6) - 3 freq summerlee (6) - 1 freq surpreises (6) - 1 freq simmers (6) - 16 freq simmer's (6) - 29 freq symbolises (6) - 1 freq summertime (6) - 1 freq comprises (6) - 4 freq |
SoundEx code - S562 simmers - 16 freq scunnersome - 53 freq snirket - 1 freq scunners - 11 freq smirkin - 11 freq skunnersum - 3 freq somersault - 6 freq summer's - 15 freq smuirichs - 2 freq smuirich - 4 freq smirks - 11 freq seniors - 1 freq smirk - 61 freq sunrise - 14 freq simmer's - 29 freq smuirs - 3 freq smoors - 6 freq summarise - 1 freq smirked - 18 freq smirkt - 1 freq smirkit - 11 freq somewhares - 1 freq summarised - 2 freq snorks - 1 freq skunners - 2 freq smooriken - 1 freq scenarios - 6 freq snores - 6 freq smoorichin - 2 freq shamrocks - 1 freq snorklin - 1 freq simmoersettin - 1 freq sneers - 1 freq summers - 13 freq sinners - 8 freq simmer-spreckled - 1 freq shamrock - 3 freq smarrach - 2 freq scunnersomely - 1 freq somewhaurs - 2 freq snorkles - 4 freq snorkle - 1 freq schemers - 3 freq swimmers - 2 freq shunners - 7 freq sïnners - 6 freq snares - 4 freq snirkit-up - 1 freq snorked - 1 freq smuirichin - 1 freq somersaults - 3 freq smirkan - 1 freq scunner's - 1 freq smoorich - 3 freq smoorikin - 7 freq sunrises - 2 freq sunrays - 2 freq sinrise - 1 freq somewheres - 1 freq snirkin - 1 freq sweemers - 1 freq sumwheres - 1 freq smuirach - 1 freq smoorikins - 2 freq simmers' - 1 freq smirkle - 9 freq shinners - 4 freq smirklin - 1 freq sonorous - 2 freq seòmraichean - 1 freq schmerz - 2 freq schmerzenloses - 1 freq smores - 1 freq samarkand - 1 freq scunnersum - 1 freq snorkin - 1 freq samarkan - 9 freq samarkand' - 1 freq smours - 1 freq sun-worshipper - 1 freq snorri's - 1 freq 'synergy' - 1 freq synergy - 3 freq sumwhaurs - 1 freq smouriched - 1 freq smourich - 1 freq somerset - 1 freq smirrs - 1 freq simmerhoose - 1 freq scunneris - 1 freq snirk - 1 freq sommersaults - 1 freq sanners - 2 freq semi-right - 1 freq €˜scunnersome - 1 freq smoorach - 2 freq summarises - 1 freq samericans - 1 freq simmerÂ’s - 1 freq smoorikens - 2 freq “shunners” - 1 freq scunners' - 1 freq scammers - 1 freq smirr's - 1 freq summercanfeckaff - 1 freq |
MetaPhone code - SMRSS summarises - 1 freq |
SUMMARISES |
Time to execute Levenshtein function - 0.265431 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.422864 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.027845 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.040969 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.000981 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. |