| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| slrc (0) - 15 freq src (1) - 1 freq slc (1) - 19 freq lrc (1) - 1 freq stic (2) - 1 freq slop (2) - 2 freq slaw (2) - 96 freq slick (2) - 9 freq slum (2) - 5 freq sirch (2) - 1 freq slut (2) - 5 freq sprp (2) - 1 freq luc (2) - 28 freq slot (2) - 12 freq slip (2) - 65 freq elc (2) - 5 freq sllq (2) - 1 freq sare (2) - 30 freq sles (2) - 1 freq 'lac (2) - 3 freq slrc's (2) - 2 freq srv (2) - 1 freq ssc (2) - 7 freq elic (2) - 2 freq sars (2) - 1 freq |
slrc (0) - 15 freq slc (2) - 19 freq lrc (2) - 1 freq src (2) - 1 freq slurs (3) - 3 freq slorp (3) - 3 freq slice (3) - 63 freq slurp (3) - 1 freq slur (3) - 4 freq sruc (3) - 1 freq slit (4) - 9 freq serk (4) - 3 freq syc (4) - 1 freq rc (4) - 3 freq sorr (4) - 1 freq herc (4) - 1 freq merc (4) - 2 freq ilc (4) - 1 freq frc (4) - 1 freq slew (4) - 2 freq lr (4) - 5 freq sor- (4) - 1 freq werc (4) - 1 freq sarx (4) - 1 freq sere (4) - 3 freq |
SoundEx code - S462 scullery's - 1 freq sculleries - 1 freq scholars - 35 freq siller's - 4 freq schoolwork - 2 freq sel-richtous - 1 freq shoulers - 6 freq sailors - 17 freq slurs - 3 freq seller's - 1 freq slorach - 1 freq sailor's - 2 freq scholarship - 9 freq slrc - 15 freq slrc's - 2 freq schullars - 1 freq siller-secks - 1 freq 'sailor's - 1 freq skylark's - 1 freq sauler's - 1 freq sellars - 1 freq saulers - 1 freq slayers - 2 freq salaries - 3 freq siller-glaurin - 1 freq sillerknowes - 2 freq shell-wark - 1 freq scholarship' - 1 freq sailors' - 2 freq skülwark - 1 freq siller-grey - 1 freq sellers - 2 freq sellers' - 1 freq slairgy - 1 freq sillars - 2 freq skylark - 2 freq sjclark - 1 freq skylarks - 2 freq ssalyers - 11 freq solwayrecycling - 1 freq |
MetaPhone code - SLRK slrc - 15 freq |
SLRC |
| Time to execute Levenshtein function - 0.183715 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.370449 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.034441 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.039357 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.000842 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. |