| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sworlin (0) - 1 freq swirlin (1) - 21 freq swurlin (1) - 1 freq swellin (2) - 4 freq skirlin (2) - 48 freq sortin (2) - 24 freq stollin (2) - 1 freq smorin (2) - 5 freq swervin (2) - 1 freq sworn (2) - 13 freq whorlin (2) - 1 freq seowlin (2) - 1 freq wordin (2) - 3 freq slorpin (2) - 2 freq sterlin (2) - 1 freq shorin (2) - 1 freq snorlie (2) - 1 freq smirlin (2) - 1 freq twirlin (2) - 5 freq swillin (2) - 2 freq swoonin (2) - 2 freq sweilin (2) - 1 freq snarlin (2) - 9 freq snortin (2) - 13 freq sooklin (2) - 1 freq |
sworlin (0) - 1 freq swurlin (1) - 1 freq swirlin (1) - 21 freq swirlan (2) - 2 freq snarlin (3) - 9 freq sweilin (3) - 1 freq swillin (3) - 2 freq spirlin (3) - 1 freq sweelin (3) - 13 freq stirlin (3) - 23 freq swarmin (3) - 6 freq swirling (3) - 2 freq swollen (3) - 12 freq twirlin (3) - 5 freq swallin (3) - 11 freq smirlin (3) - 1 freq strlin (3) - 1 freq shorelin (3) - 2 freq sworn (3) - 13 freq swervin (3) - 1 freq skirlin (3) - 48 freq surlin (3) - 1 freq swellin (3) - 4 freq swirin (3) - 1 freq sterlin (3) - 1 freq |
SoundEx code - S645 swirlin - 21 freq skirlin - 48 freq scrollin - 6 freq scrollin' - 1 freq shorelin - 2 freq surlin - 1 freq shore-line - 1 freq sworlin - 1 freq sirloin - 7 freq sheerlin - 3 freq skirlan - 1 freq shoreline - 4 freq swirlan - 2 freq shirley-anne - 2 freq skirling - 1 freq swurlin - 1 freq swirling - 2 freq scorland - 1 freq sharleen - 1 freq 'sharleen - 1 freq |
MetaPhone code - SWRLN swirlin - 21 freq sworlin - 1 freq swirlan - 2 freq swurlin - 1 freq |
SWORLIN |
| Time to execute Levenshtein function - 0.283877 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.881984 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.030560 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.081880 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.000887 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. |