| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| snashers (0) - 1 freq nashers (1) - 2 freq gnashers (1) - 1 freq snashes (1) - 2 freq snushes (2) - 2 freq washers (2) - 1 freq gnashes (2) - 1 freq snashed (2) - 11 freq knashes (2) - 1 freq sassers (2) - 6 freq crashers (2) - 2 freq snatters (2) - 1 freq stashes (2) - 1 freq snatchers (2) - 1 freq smashes (2) - 1 freq rashers (2) - 1 freq sashes (2) - 3 freq saasers (2) - 1 freq snappers (2) - 2 freq smasher (2) - 4 freq stachert (3) - 4 freq hasher (3) - 1 freq feathers (3) - 67 freq smashet (3) - 1 freq slather (3) - 2 freq |
snashers (0) - 1 freq snashes (2) - 2 freq gnashers (2) - 1 freq nashers (2) - 2 freq snushes (3) - 2 freq saasers (4) - 1 freq snappers (4) - 2 freq sashes (4) - 3 freq rashers (4) - 1 freq sneysters (4) - 5 freq punishers (4) - 1 freq smashes (4) - 1 freq sneesters (4) - 1 freq skooshers (4) - 1 freq smasher (4) - 4 freq gnashes (4) - 1 freq knashes (4) - 1 freq snatchers (4) - 1 freq snashed (4) - 11 freq washers (4) - 1 freq sassers (4) - 6 freq stashes (4) - 1 freq snatters (4) - 1 freq crashers (4) - 2 freq snitchers (5) - 1 freq |
SoundEx code - S526 snickerin - 5 freq smacher - 2 freq singers - 55 freq singer - 47 freq singer's - 2 freq snocherin - 7 freq smokers' - 4 freq sincerely - 8 freq sincere - 13 freq sneegart - 1 freq sneegert - 1 freq sniggerin - 6 freq sincerity - 3 freq snochert - 1 freq snickert - 1 freq smoker - 2 freq smasher - 4 freq sanquhar - 9 freq semi-circles - 1 freq smickered - 1 freq smickert - 1 freq snicheren - 2 freq smokers - 8 freq sing-greet - 1 freq sniggers - 5 freq smugger - 1 freq smickerin - 2 freq sangria - 2 freq snichered - 2 freq snicher - 3 freq skincare - 1 freq smachrie - 2 freq sniggered - 4 freq singers' - 2 freq sniggern - 9 freq sniggert - 5 freq smoker's - 2 freq snooker - 16 freq synchronised - 1 freq snocher - 6 freq snochered - 1 freq smackaroonies - 2 freq snicker - 1 freq shae-makker - 1 freq shae-maakers - 1 freq smaikrie - 1 freq sensory-seutid - 1 freq sneegired - 1 freq sneegirs - 1 freq sanger - 1 freq sheanchara - 1 freq snicheran - 1 freq snicherin - 1 freq snickered - 1 freq snigger' - 1 freq snichert - 2 freq sanchar - 1 freq smacker - 3 freq syncretism - 1 freq snashers - 1 freq snickerin' - 1 freq shoemaker-levy - 1 freq smacherie - 1 freq synchronise - 1 freq snookert - 1 freq sensoryattachmentintervention - 1 freq sensory - 4 freq snochrie - 12 freq singer-sangwriters - 1 freq sanskrit - 1 freq semi-circle - 1 freq somequhaar - 1 freq smicker - 1 freq €œsincerely - 1 freq synchronically - 1 freq smacherry - 2 freq sunscreem - 6 freq smokiered - 16 freq samcornwell - 1 freq skinnycortado - 1 freq sincerest - 1 freq shingaurds - 1 freq smoocher - 3 freq shaunwkearney - 1 freq sunnygradio - 1 freq sensored - 1 freq sonjahern - 1 freq sinker - 1 freq samgray - 29 freq seanmccrory - 1 freq snookers - 1 freq sensors - 1 freq snickers - 1 freq sammgreer - 14 freq suncream - 1 freq |
MetaPhone code - SNXRS snitchers - 1 freq snashers - 1 freq snatchers - 1 freq |
SNASHERS |
| Time to execute Levenshtein function - 0.194075 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.394444 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.028241 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.040101 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.000948 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. |