Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
smaaer (0) - 7 freq smaar (1) - 2 freq smawer (1) - 9 freq sma'er (1) - 2 freq sma-er (1) - 1 freq smaer (1) - 3 freq smaa-er (1) - 2 freq smaert (2) - 1 freq smasher (2) - 4 freq draaer (2) - 2 freq smear (2) - 2 freq mater (2) - 16 freq smoar (2) - 1 freq spaker (2) - 3 freq swaver (2) - 1 freq soajer (2) - 1 freq smaa (2) - 123 freq smatter (2) - 2 freq slawer (2) - 2 freq safer (2) - 18 freq maker (2) - 18 freq smale (2) - 1 freq smoker (2) - 2 freq smaller (2) - 13 freq spacer (2) - 2 freq |
smaaer (0) - 7 freq smaer (1) - 3 freq smaar (1) - 2 freq smear (2) - 2 freq smawer (2) - 9 freq smaa-er (2) - 2 freq smoar (2) - 1 freq sma'er (2) - 2 freq sma-er (2) - 1 freq smiler (3) - 1 freq maer (3) - 3 freq scaar (3) - 20 freq smaas (3) - 1 freq smael (3) - 3 freq seater (3) - 1 freq sumer (3) - 1 freq smur (3) - 3 freq smoor (3) - 28 freq smuir (3) - 4 freq smore (3) - 7 freq snaar (3) - 1 freq skaar (3) - 1 freq swaar (3) - 1 freq mayer (3) - 1 freq smale (3) - 1 freq |
SoundEx code - S560 smirr - 39 freq scunner - 97 freq simmer - 314 freq somewhaur - 72 freq smoor - 28 freq sumwhaur - 6 freq somewhere - 74 freq sooner - 29 freq summer - 202 freq skimmer - 7 freq suiner - 27 freq smear - 2 freq sonar - 1 freq senior - 40 freq scenario - 6 freq shuiner - 6 freq smaa-er - 2 freq skunner - 3 freq smore - 7 freq sneer - 9 freq shimmer - 4 freq sinner - 10 freq sumwhere - 6 freq senir - 1 freq seener - 14 freq smaaer - 7 freq somewhar - 7 freq somewherr - 2 freq shaner - 3 freq siner - 1 freq samurai - 7 freq snare - 13 freq sumwhar - 1 freq scenery - 16 freq somewhur - 4 freq sweemer - 1 freq somwhaur - 1 freq swimmer - 3 freq 'simmer - 1 freq sinnerie - 1 freq scunnèr - 1 freq samaria - 7 freq sïnner - 1 freq smawer - 9 freq shiner - 3 freq sumer - 1 freq smirry - 1 freq 'somewhaur - 1 freq shöner - 2 freq shoner - 1 freq summarie - 3 freq skinnier - 1 freq shuner - 1 freq snaar - 1 freq snorry - 1 freq summur - 1 freq snore - 6 freq simmir - 1 freq smuir - 4 freq smora - 1 freq sma'er - 2 freq smur - 3 freq summer' - 1 freq smoar - 1 freq summ'ry - 1 freq smaer - 3 freq suner - 3 freq somewhaar - 5 freq summary - 3 freq sma-er - 1 freq schooner - 2 freq smaar - 2 freq suimmer - 1 freq sheener - 1 freq sumwher - 1 freq scanner - 1 freq €˜simmer - 1 freq sumwhair - 1 freq skinner - 1 freq €œscunner - 1 freq €˜scunner - 1 freq €œsmirr - 1 freq shunner - 2 freq smaÂ’er - 1 freq shinner - 1 freq 'skunnyr' - 1 freq sconir - 1 freq senario - 1 freq seanair - 1 freq snooerry - 1 freq shanner - 1 freq |
MetaPhone code - SMR smirr - 39 freq simmer - 314 freq smoor - 28 freq summer - 202 freq smear - 2 freq smaa-er - 2 freq cymru - 5 freq smore - 7 freq zimmer - 3 freq sombre - 6 freq smaaer - 7 freq zoomer - 3 freq samurai - 7 freq 'simmer - 1 freq samaria - 7 freq sumer - 1 freq smirry - 1 freq summarie - 3 freq sumburgh - 16 freq summur - 1 freq simmir - 1 freq smuir - 4 freq smora - 1 freq sma'er - 2 freq smur - 3 freq summer' - 1 freq smoar - 1 freq summ'ry - 1 freq smaer - 3 freq summary - 3 freq sma-er - 1 freq smaar - 2 freq suimmer - 1 freq €˜simmer - 1 freq €œsmirr - 1 freq smaÂ’er - 1 freq xmur - 1 freq |
SMAAER |
Time to execute Levenshtein function - 0.186675 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.332304 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.027564 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.038521 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.000898 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. |