| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| snares (0) - 4 freq shares (1) - 27 freq snores (1) - 6 freq snared (1) - 5 freq spares (1) - 1 freq snakes (1) - 32 freq stares (1) - 41 freq snare (1) - 13 freq snarls (1) - 7 freq scares (1) - 5 freq snaked (2) - 2 freq shires (2) - 1 freq soars (2) - 5 freq hares (2) - 14 freq snacks (2) - 4 freq skames (2) - 2 freq snake (2) - 75 freq sales (2) - 31 freq ares (2) - 3 freq snaws (2) - 15 freq snorls (2) - 3 freq snakey (2) - 1 freq snipes (2) - 3 freq starts (2) - 156 freq shargs (2) - 1 freq |
snares (0) - 4 freq snores (1) - 6 freq snarls (2) - 7 freq scares (2) - 5 freq shares (2) - 27 freq stares (2) - 41 freq snare (2) - 13 freq snared (2) - 5 freq spares (2) - 1 freq snakes (2) - 32 freq spars (3) - 6 freq sabres (3) - 1 freq staris (3) - 1 freq snags (3) - 1 freq scores (3) - 15 freq snurts (3) - 1 freq sars (3) - 1 freq sores (3) - 3 freq shores (3) - 21 freq spores (3) - 2 freq snails (3) - 13 freq stars (3) - 104 freq stores (3) - 30 freq snorts (3) - 5 freq snored (3) - 7 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 - SNRS seniors - 1 freq sunrise - 14 freq scenarios - 6 freq snores - 6 freq cinners - 4 freq sneers - 1 freq sinners - 8 freq sïnners - 6 freq snares - 4 freq sunrays - 2 freq sinrise - 1 freq sonorous - 2 freq snorri's - 1 freq sanners - 2 freq |
SNARES |
| Time to execute Levenshtein function - 0.200504 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.347852 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.027515 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.037745 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.000863 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. |