| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| skirls (0) - 16 freq spirls (1) - 3 freq skirts (1) - 26 freq skirl (1) - 47 freq skirlt (1) - 1 freq skirps (1) - 3 freq swirls (1) - 7 freq skirly (1) - 19 freq skills (1) - 60 freq skerls (1) - 3 freq spiels (2) - 2 freq skills' (2) - 1 freq spirals (2) - 2 freq skiers (2) - 2 freq spirl (2) - 4 freq skools (2) - 1 freq kirns (2) - 2 freq skirlan (2) - 1 freq skips (2) - 6 freq sairs (2) - 8 freq skairs (2) - 2 freq skim's (2) - 2 freq shirts (2) - 21 freq skirled (2) - 101 freq smirlt (2) - 1 freq |
skirls (0) - 16 freq skerls (1) - 3 freq swirls (2) - 7 freq skirly (2) - 19 freq skirps (2) - 3 freq skills (2) - 60 freq skirlt (2) - 1 freq spirls (2) - 3 freq skirts (2) - 26 freq skirl (2) - 47 freq skeels (3) - 48 freq skeils (3) - 1 freq skirlin (3) - 48 freq scurls (3) - 1 freq skarts (3) - 3 freq skroils (3) - 1 freq skails (3) - 12 freq skerl (3) - 1 freq skulls (3) - 6 freq snarls (3) - 7 freq skirlit (3) - 1 freq skerrs (3) - 2 freq skuills (3) - 1 freq skuils (3) - 6 freq skirlie (3) - 10 freq |
SoundEx code - S642 skirls - 16 freq square-lookin - 1 freq sherlock - 7 freq squirrels - 20 freq scrolls - 6 freq scurrilous - 2 freq sair-leukin - 1 freq soar-lik - 1 freq soorlike - 1 freq 'squirrels - 1 freq swirls - 7 freq surrealism - 2 freq sairless - 1 freq square-lickly - 1 freq scurls - 1 freq soor-lukkan - 1 freq skerls - 3 freq serialise - 1 freq surrealist - 1 freq sweir-like - 1 freq skirls'll - 1 freq skroils - 1 freq surreywallcreep - 1 freq |
MetaPhone code - SKRLS skirls - 16 freq squirrels - 20 freq scrolls - 6 freq scurrilous - 2 freq 'squirrels - 1 freq scurls - 1 freq skerls - 3 freq skroils - 1 freq |
SKIRLS |
| Time to execute Levenshtein function - 0.211806 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.379195 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.032086 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.037746 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.000889 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. |