| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| skroils (0) - 1 freq scrolls (2) - 6 freq skrogs (2) - 1 freq skails (2) - 12 freq skroos (2) - 3 freq scroil (2) - 1 freq skools (2) - 1 freq skuils (2) - 6 freq spoils (2) - 2 freq skraiks (2) - 1 freq strolls (2) - 4 freq skoits (2) - 1 freq skreids (2) - 6 freq skeils (2) - 1 freq snails (3) - 13 freq skirtins (3) - 1 freq skool (3) - 3 freq skraichs (3) - 5 freq smuils (3) - 1 freq proil (3) - 1 freq sprouts (3) - 8 freq streits (3) - 2 freq browls (3) - 2 freq speils (3) - 1 freq shuils (3) - 5 freq |
skroils (0) - 1 freq skraiks (3) - 1 freq skreids (3) - 6 freq skeils (3) - 1 freq skerls (3) - 3 freq skirls (3) - 16 freq skuils (3) - 6 freq skails (3) - 12 freq skools (3) - 1 freq skroos (3) - 3 freq skrogs (3) - 1 freq skreives (4) - 1 freq skerries (4) - 10 freq skuills (4) - 1 freq skills (4) - 60 freq skaills (4) - 1 freq snorls (4) - 3 freq skeills (4) - 6 freq skulls (4) - 6 freq skeels (4) - 48 freq skurries (4) - 2 freq skreks (4) - 2 freq skrieds (4) - 1 freq spoils (4) - 2 freq strolls (4) - 4 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 |
SKROILS |
| Time to execute Levenshtein function - 0.228657 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.369290 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.028152 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.037250 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.000838 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. |