| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| skirlin (0) - 48 freq skirling (1) - 1 freq skilin (1) - 4 freq stirlin (1) - 23 freq smirlin (1) - 1 freq skirrin (1) - 2 freq skirvin (1) - 1 freq skirlan (1) - 1 freq swirlin (1) - 21 freq spirlin (1) - 1 freq skirlie (1) - 10 freq skirtin (1) - 12 freq skirlit (1) - 1 freq skirpin (1) - 1 freq shillin (2) - 29 freq stiflin (2) - 4 freq skirtins (2) - 1 freq dirlin (2) - 45 freq stirling (2) - 28 freq spillin (2) - 10 freq pirlin (2) - 8 freq swirlan (2) - 2 freq shielin (2) - 1 freq shilin (2) - 1 freq skinkin (2) - 1 freq |
skirlin (0) - 48 freq skirlan (1) - 1 freq spirlin (2) - 1 freq skirlie (2) - 10 freq skirtin (2) - 12 freq skirling (2) - 1 freq skirpin (2) - 1 freq swirlin (2) - 21 freq skirlit (2) - 1 freq skilin (2) - 4 freq skirvin (2) - 1 freq stirlin (2) - 23 freq smirlin (2) - 1 freq skirrin (2) - 2 freq skailin (3) - 39 freq stirlen (3) - 2 freq skairin (3) - 1 freq skirled (3) - 101 freq sirloin (3) - 7 freq skirls (3) - 16 freq skirl (3) - 47 freq sterlin (3) - 1 freq skalin (3) - 1 freq spiralin (3) - 2 freq skirpan (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 - SKRLN skirlin - 48 freq scrollin - 6 freq scrollin' - 1 freq skirlan - 1 freq |
SKIRLIN |
| Time to execute Levenshtein function - 0.207752 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.358103 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.033284 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.037180 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.000972 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. |