Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
snirk (0) - 1 freq smirk (1) - 63 freq shirk (1) - 2 freq stirk (1) - 7 freq snirt (1) - 3 freq spirk (1) - 3 freq saire (2) - 4 freq slick (2) - 10 freq sir- (2) - 4 freq sir (2) - 358 freq nir (2) - 49 freq soir (2) - 1 freq snaik (2) - 2 freq sperk (2) - 3 freq sairt (2) - 2 freq nark (2) - 1 freq stirks (2) - 15 freq stikk (2) - 1 freq smirks (2) - 14 freq spark (2) - 37 freq nick (2) - 133 freq sherk (2) - 1 freq sick (2) - 150 freq swik (2) - 1 freq saick (2) - 1 freq |
snirk (0) - 1 freq spirk (2) - 3 freq stirk (2) - 7 freq snirt (2) - 3 freq shirk (2) - 2 freq smirk (2) - 63 freq shark (3) - 21 freq sink (3) - 100 freq sneak (3) - 23 freq snook (3) - 2 freq snorl (3) - 21 freq stark (3) - 32 freq snek (3) - 11 freq sark (3) - 124 freq snuck (3) - 3 freq sneuk (3) - 2 freq snare (3) - 13 freq snarl (3) - 9 freq snort (3) - 8 freq snirket (3) - 1 freq stork (3) - 3 freq senir (3) - 1 freq snirkin (3) - 1 freq stairk (3) - 4 freq sneck (3) - 42 freq |
SoundEx code - S562 simmers - 16 freq scunnersome - 54 freq snirket - 1 freq scunners - 12 freq smirkin - 11 freq skunnersum - 3 freq somersault - 6 freq summer's - 15 freq smuirichs - 2 freq smuirich - 4 freq smirks - 14 freq seniors - 2 freq smirk - 63 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 - 2 freq summers - 13 freq shanners - 1 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 - SNRK snirk - 1 freq |
SNIRK |
Time to execute Levenshtein function - 0.237748 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.376595 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.028045 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.037851 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.000837 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. |