| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| skerls (0) - 3 freq skerla (1) - 1 freq skerl (1) - 1 freq skerrs (1) - 2 freq skeils (1) - 1 freq skirls (1) - 16 freq skeels (1) - 48 freq sterrs (2) - 7 freq skeily (2) - 1 freq skirts (2) - 26 freq skuils (2) - 6 freq sels (2) - 7 freq kerds (2) - 1 freq skulls (2) - 6 freq sters (2) - 1 freq keels (2) - 4 freq kerrs (2) - 9 freq skelp (2) - 137 freq skails (2) - 12 freq seerly (2) - 13 freq spirls (2) - 3 freq serks (2) - 1 freq sterns (2) - 26 freq sterts (2) - 65 freq skelfs (2) - 19 freq |
skerls (0) - 3 freq skirls (1) - 16 freq skeels (2) - 48 freq skerl (2) - 1 freq skerla (2) - 1 freq skeils (2) - 1 freq skerrs (2) - 2 freq skroils (3) - 1 freq skweels (3) - 10 freq skools (3) - 1 freq skirly (3) - 19 freq skiers (3) - 2 freq skeerly (3) - 1 freq skills (3) - 60 freq skeills (3) - 6 freq snarls (3) - 7 freq skirl (3) - 47 freq swirls (3) - 7 freq skirlt (3) - 1 freq snorls (3) - 3 freq scurls (3) - 1 freq spirls (3) - 3 freq skuils (3) - 6 freq skirps (3) - 3 freq skulls (3) - 6 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 |
SKERLS |
| Time to execute Levenshtein function - 0.179676 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.331842 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.027510 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.036719 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.000893 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. |