| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| squirrels (0) - 20 freq squirrelt (1) - 1 freq 'squirrels (1) - 1 freq squirrel (1) - 43 freq quarrels (2) - 1 freq skurrel (3) - 1 freq squirted (3) - 3 freq quarrel (3) - 4 freq brsquirrel (3) - 2 freq squarely (3) - 3 freq squire (3) - 2 freq squirts (3) - 1 freq squirmed (3) - 3 freq squares (3) - 17 freq suirely (3) - 1 freq quires (3) - 1 freq yursels (4) - 1 freq stirreen (4) - 1 freq saicrets (4) - 9 freq scurry's (4) - 1 freq square (4) - 164 freq quarrelan (4) - 2 freq wurzels (4) - 1 freq slurred (4) - 7 freq surreal (4) - 8 freq |
squirrels (0) - 20 freq 'squirrels (2) - 1 freq squirrel (2) - 43 freq squirrelt (2) - 1 freq quarrels (3) - 1 freq squares (5) - 17 freq squirts (5) - 1 freq squarely (5) - 3 freq quarrel (5) - 4 freq skurrel (5) - 1 freq squarrt (6) - 1 freq squars (6) - 1 freq squeers (6) - 1 freq squadrons (6) - 1 freq squeals (6) - 12 freq skirls (6) - 16 freq scurls (6) - 1 freq spirals (6) - 2 freq shirras (6) - 1 freq stirrups (6) - 3 freq sorrel (6) - 1 freq swirls (6) - 7 freq squiggles (6) - 4 freq scurries (6) - 5 freq squerr (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 |
SQUIRRELS |
| Time to execute Levenshtein function - 0.257995 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.354831 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.027515 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.038462 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.000873 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. |