| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| snorled (0) - 2 freq snored (1) - 7 freq snarled (1) - 13 freq snirled (1) - 2 freq snorked (1) - 1 freq snorted (1) - 7 freq snortled (1) - 1 freq scowled (2) - 3 freq snortet (2) - 1 freq snorkle (2) - 1 freq scorned (2) - 3 freq snared (2) - 5 freq stormed (2) - 17 freq gnarled (2) - 4 freq snorkles (2) - 4 freq sported (2) - 1 freq shooled (2) - 1 freq snore (2) - 6 freq snorl't (2) - 1 freq spoiled (2) - 7 freq scored (2) - 41 freq swirled (2) - 3 freq skirled (2) - 101 freq knarled (2) - 1 freq snorlie (2) - 1 freq |
snorled (0) - 2 freq snarled (1) - 13 freq snirled (1) - 2 freq snyurled (2) - 1 freq snored (2) - 7 freq snortled (2) - 1 freq snorted (2) - 7 freq snorked (2) - 1 freq snorl (3) - 21 freq skirled (3) - 101 freq snirtled (3) - 1 freq smirled (3) - 2 freq insnorled (3) - 1 freq snorls (3) - 3 freq knarled (3) - 1 freq snorlie (3) - 1 freq spurled (3) - 1 freq swirled (3) - 3 freq snared (3) - 5 freq snorlt (3) - 2 freq gnarled (3) - 4 freq smored (4) - 4 freq snooved (4) - 3 freq soiled (4) - 2 freq snores (4) - 6 freq |
SoundEx code - S564 snorled - 2 freq snorls - 3 freq snarl - 9 freq snarled - 13 freq snorl - 21 freq summarily - 1 freq snarlit - 1 freq summarlid - 3 freq snarlin' - 1 freq snarlin - 9 freq summerled - 1 freq smirled - 2 freq smirlin - 1 freq snarls - 7 freq summerhilla - 1 freq snorlie - 1 freq snaar-like - 1 freq snorl't - 1 freq snorlt - 2 freq snorrel - 3 freq snyurled - 1 freq snarlt - 1 freq smirlt - 1 freq snirled - 2 freq snarlene - 1 freq summerhallery - 1 freq smyril - 1 freq summerlee - 1 freq summerleemuseum - 2 freq |
MetaPhone code - SNRLT snorled - 2 freq snarled - 13 freq snarlit - 1 freq snorl't - 1 freq snorlt - 2 freq snarlt - 1 freq snirled - 2 freq |
SNORLED |
| Time to execute Levenshtein function - 0.227265 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.373413 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.037049 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.037300 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.000874 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. |