| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| slurrin (0) - 1 freq slurring (1) - 1 freq slurpin (1) - 6 freq blurrin (1) - 1 freq spurrin (1) - 3 freq slurred (2) - 7 freq seurrit (2) - 1 freq serrin (2) - 5 freq saurin (2) - 1 freq scarrin (2) - 1 freq skurrie (2) - 1 freq scurrie (2) - 3 freq siurring (2) - 1 freq lurkin (2) - 13 freq skirrin (2) - 2 freq purrin (2) - 20 freq slumpin (2) - 3 freq slurry (2) - 5 freq squarin (2) - 1 freq stirrin (2) - 17 freq scurryin (2) - 7 freq scurrian (2) - 1 freq sterrin (2) - 1 freq spurtin (2) - 2 freq slorpin (2) - 2 freq |
slurrin (0) - 1 freq blurrin (2) - 1 freq spurrin (2) - 3 freq slurring (2) - 1 freq slurpin (2) - 6 freq stirrin (3) - 17 freq slorpin (3) - 2 freq skirrin (3) - 2 freq scurryin (3) - 7 freq starrin (3) - 3 freq serrin (3) - 5 freq slurred (3) - 7 freq sterrin (3) - 1 freq slurry (3) - 5 freq scurrian (3) - 1 freq scarrin (3) - 1 freq gurrin (4) - 1 freq surgin (4) - 2 freq smuirin (4) - 5 freq sluppin (4) - 3 freq slarry (4) - 1 freq murrin (4) - 1 freq scurrit (4) - 2 freq sleverin (4) - 3 freq slaverin (4) - 11 freq |
SoundEx code - S465 schuilroom - 7 freq slurrin - 1 freq slurring - 1 freq siller-makkin - 1 freq schuil-room - 1 freq schölroom - 1 freq sillerin - 4 freq schuilruim - 1 freq siller-mounted - 1 freq saleroom - 1 freq schuleroom - 4 freq sailor-men - 1 freq |
MetaPhone code - SLRN slurrin - 1 freq sillerin - 4 freq |
SLURRIN |
| Time to execute Levenshtein function - 0.236679 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.409959 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.028216 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.040117 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.000920 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. |