| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| scurrilous (0) - 2 freq scrious (3) - 1 freq scurries (3) - 5 freq cuirious (3) - 3 freq spurious (3) - 2 freq scurrie's (3) - 1 freq curious (3) - 75 freq spiritous (4) - 1 freq scurrian (4) - 1 freq sairious (4) - 34 freq curroos (4) - 2 freq sarious (4) - 1 freq saerious (4) - 1 freq sayrious (4) - 1 freq curries (4) - 7 freq surplus (4) - 2 freq querious (4) - 2 freq currie's (4) - 2 freq corridors (4) - 22 freq subdolous (4) - 1 freq cuprous (4) - 1 freq scurry's (4) - 1 freq studious (4) - 2 freq furious (4) - 12 freq scurls (4) - 1 freq |
scurrilous (0) - 2 freq scurries (4) - 5 freq scurrie's (4) - 1 freq scurry's (5) - 1 freq scarrows (5) - 1 freq scrious (5) - 1 freq scurls (5) - 1 freq scurrit (6) - 2 freq skurries (6) - 2 freq scrolls (6) - 6 freq garrulous (6) - 1 freq scurrie (6) - 3 freq scandalous (6) - 1 freq currots (6) - 1 freq currie's (6) - 2 freq surrouns (6) - 3 freq scotriots (6) - 7 freq surplus (6) - 2 freq scurrian (6) - 1 freq scorpions (6) - 3 freq squirrels (6) - 20 freq curious (6) - 75 freq cuirious (6) - 3 freq spurious (6) - 2 freq curroos (6) - 2 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 |
SCURRILOUS |
| Time to execute Levenshtein function - 0.196512 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.383318 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.036615 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.044301 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.001070 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. |