| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| slashertrash (0) - 1 freq snashers (5) - 1 freq stannerts (6) - 4 freq astramash (6) - 1 freq slithert (6) - 3 freq slathered (6) - 3 freq slaetero's (6) - 6 freq larberthigh (6) - 1 freq slaters (6) - 8 freq slaigert (6) - 1 freq cash-tray (6) - 1 freq fleshers (6) - 3 freq slavert (6) - 1 freq slateit's (6) - 1 freq clashes (6) - 2 freq slaugherhoose (6) - 1 freq crashers (6) - 2 freq slater's (6) - 1 freq stashes (6) - 1 freq rashers (6) - 1 freq sashes (6) - 3 freq clish-clash (6) - 1 freq slappers (6) - 2 freq sassermaet (6) - 6 freq ashets (6) - 14 freq |
slashertrash (0) - 1 freq snashers (9) - 1 freq slachtert (10) - 3 freq flashy-dashy (10) - 1 freq smartish (10) - 2 freq clish-clash (10) - 1 freq sleshes (10) - 1 freq slauchters (10) - 2 freq plasters (10) - 1 freq solsgirth (10) - 1 freq slithers (10) - 3 freq slaithert (10) - 2 freq shirras (10) - 1 freq sherpish (10) - 1 freq clishmaclash (10) - 1 freq sashatitch (10) - 1 freq slaiters (10) - 1 freq plaisterers (10) - 1 freq blushers (10) - 1 freq slithert (10) - 3 freq ashtrays (10) - 6 freq fleshers (10) - 3 freq slaters (10) - 8 freq slateroos (10) - 2 freq slauchteris (10) - 1 freq |
SoundEx code - S426 sluggard' - 5 freq slaigert - 1 freq sel-ashuirance - 1 freq selkirk - 10 freq slessor - 4 freq silksrin'r - 1 freq shalls'r - 1 freq shilcorn - 2 freq slicer - 1 freq sluggard - 1 freq solsgirth - 1 freq slagger - 2 freq 'sheilagreen' - 1 freq saul-searchan - 1 freq shell-grittit - 1 freq slaigerin - 2 freq slogie-riddles - 2 freq selkirkshire - 1 freq siliguri - 1 freq sowel-searchin - 2 freq sel-assertin - 1 freq slaugherhoose - 1 freq schoolsreopen - 1 freq sluggerotoole - 4 freq skillsr - 1 freq slugger - 1 freq slashertrash - 1 freq selkirkalereds - 2 freq schoolsgrowingfood - 1 freq |
MetaPhone code - SLXRTRX slashertrash - 1 freq |
SLASHERTRASH |
| Time to execute Levenshtein function - 0.241840 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.420251 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.027950 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.038101 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.000938 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. |