| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| slurred (0) - 7 freq scurred (1) - 2 freq blurred (1) - 6 freq lurred (1) - 1 freq spurred (1) - 4 freq slurped (1) - 1 freq surrey (2) - 2 freq spurned (2) - 2 freq sterred (2) - 1 freq whurred (2) - 1 freq surged (2) - 1 freq taurred (2) - 1 freq soured (2) - 1 freq scurried (2) - 5 freq serred (2) - 9 freq starred (2) - 2 freq scursed (2) - 1 freq skurrel (2) - 1 freq spurled (2) - 1 freq purred (2) - 8 freq smuired (2) - 13 freq lured (2) - 2 freq blurted (2) - 6 freq slumped (2) - 13 freq lurked (2) - 4 freq |
slurred (0) - 7 freq scurred (2) - 2 freq spurred (2) - 4 freq slurped (2) - 1 freq blurred (2) - 6 freq lurred (2) - 1 freq slerped (3) - 2 freq skurried (3) - 1 freq starred (3) - 2 freq scarred (3) - 15 freq slurrin (3) - 1 freq serred (3) - 9 freq stirred (3) - 12 freq slurry (3) - 5 freq flurried (3) - 1 freq scurried (3) - 5 freq sterred (3) - 1 freq clarried (4) - 3 freq spurned (4) - 2 freq squared (4) - 6 freq whurred (4) - 1 freq serried (4) - 1 freq slavered (4) - 3 freq silvered (4) - 1 freq salaried (4) - 2 freq |
SoundEx code - S463 siller-reid - 1 freq slairt - 1 freq scholard - 2 freq slairit - 2 freq sillert - 1 freq schuilyairds - 1 freq shouler-taeshouler - 1 freq scholards - 3 freq scholarts - 1 freq sclarriet - 1 freq slurred - 7 freq sillerweed - 1 freq schuilyaird - 1 freq slawards - 1 freq sillered - 1 freq scullerty-hungerties - 1 freq salyerites - 1 freq salaried - 2 freq |
MetaPhone code - SLRT slairt - 1 freq slairit - 2 freq sillert - 1 freq slurred - 7 freq sillered - 1 freq salaried - 2 freq |
SLURRED |
| Time to execute Levenshtein function - 0.310936 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.581303 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.063209 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.037614 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.000927 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. |