| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| scunnèr (0) - 1 freq scunnèrt (1) - 1 freq scunner (2) - 97 freq hunnèr (2) - 24 freq unnèr (2) - 27 freq scunnért (2) - 5 freq wunnèr (2) - 1 freq scunn (3) - 1 freq plunnér (3) - 1 freq shunner (3) - 2 freq scunder (3) - 1 freq hunnèrs (3) - 8 freq skunner (3) - 3 freq scattèr (3) - 1 freq wunnér (3) - 2 freq dennèr (3) - 4 freq scunnert (3) - 79 freq hunnér (3) - 3 freq scunnerd (3) - 5 freq hinnèr (3) - 1 freq scunners (3) - 12 freq stannèrt (3) - 7 freq scootèr (3) - 1 freq wunnèrt (3) - 2 freq scanner (3) - 1 freq |
scunnèr (0) - 1 freq scunnèrt (2) - 1 freq scunnért (4) - 5 freq unnèr (4) - 27 freq wunnèr (4) - 1 freq hunnèr (4) - 24 freq scunner (4) - 97 freq dennèr (5) - 4 freq scattèr (5) - 1 freq scootèr (5) - 1 freq hinnèr (5) - 1 freq stannèrt (5) - 7 freq scanner (5) - 1 freq scunners (6) - 12 freq coontèr (6) - 1 freq squannèrin (6) - 1 freq cunnar (6) - 1 freq unnér (6) - 5 freq stunner (6) - 9 freq wunnèrt (6) - 2 freq scunder (6) - 1 freq shunner (6) - 2 freq scunnerd (6) - 5 freq scunn (6) - 1 freq hunnèrs (6) - 8 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 - SKNR scunner - 97 freq skunner - 3 freq scunnèr - 1 freq skinnier - 1 freq seigneur - 1 freq sickener - 1 freq scanner - 1 freq skinner - 1 freq €œscunner - 1 freq €˜scunner - 1 freq signer - 2 freq 'skunnyr' - 1 freq sconir - 1 freq séigneur - 1 freq |
SCUNNÈR |
| Time to execute Levenshtein function - 0.361568 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.691625 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.048721 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.061587 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.001118 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. |