| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sumwhere (0) - 6 freq sumwher (1) - 1 freq sumwheres (1) - 1 freq sumwhar (2) - 1 freq somewhere (2) - 68 freq erywhere (3) - 1 freq €˜where (3) - 15 freq sumthein (3) - 4 freq samphire (3) - 1 freq sumwhair (3) - 1 freq 'where (3) - 15 freq sumphie (3) - 1 freq “where (3) - 1 freq sumwhaurs (3) - 1 freq €™where (3) - 2 freq sphere (3) - 14 freq sumwhaur (3) - 6 freq sumtheen (3) - 2 freq humphers (3) - 1 freq sumbdee (3) - 1 freq sumer (3) - 1 freq where (3) - 706 freq summer' (3) - 1 freq tamhere (3) - 1 freq onywhere (3) - 27 freq |
sumwhere (0) - 6 freq sumwher (1) - 1 freq somewhere (2) - 68 freq sumwheres (2) - 1 freq sumwhar (2) - 1 freq sumwhair (3) - 1 freq sumwhaur (3) - 6 freq sumwhaurs (4) - 1 freq somewheres (4) - 1 freq somwhaur (4) - 1 freq samwhyte (4) - 1 freq samphire (4) - 1 freq somewhur (4) - 4 freq somewhar (4) - 7 freq anywhere (5) - 30 freq sumwey (5) - 1 freq oniwhere (5) - 1 freq summer (5) - 196 freq nowhere (5) - 9 freq sumwie (5) - 1 freq smacher (5) - 2 freq smasher (5) - 4 freq somewhaar (5) - 5 freq somewhen (5) - 1 freq smawer (5) - 9 freq |
SoundEx code - S560 smirr - 39 freq scunner - 97 freq simmer - 309 freq somewhaur - 72 freq smoor - 28 freq sumwhaur - 6 freq somewhere - 68 freq sooner - 29 freq summer - 196 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 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 - SMHR somewhaur - 72 freq sumwhaur - 6 freq somewhere - 68 freq sumwhere - 6 freq somewhar - 7 freq sumwhar - 1 freq somewhur - 4 freq somwhaur - 1 freq 'somewhaur - 1 freq somewhaar - 5 freq sumwher - 1 freq sumwhair - 1 freq |
SUMWHERE |
| Time to execute Levenshtein function - 0.186170 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.376100 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.027575 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.038488 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.000787 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. |