| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| snarled (0) - 13 freq gnarled (1) - 4 freq snared (1) - 5 freq knarled (1) - 1 freq snirled (1) - 2 freq snorled (1) - 2 freq marled (2) - 2 freq spurled (2) - 1 freq stared (2) - 69 freq unarmed (2) - 5 freq shawled (2) - 1 freq snorked (2) - 1 freq snarls (2) - 7 freq enabled (2) - 1 freq stalled (2) - 2 freq soarted (2) - 1 freq snashed (2) - 11 freq scarred (2) - 15 freq snaed (2) - 1 freq scaled (2) - 7 freq scartled (2) - 1 freq starred (2) - 2 freq swirled (2) - 3 freq snorted (2) - 7 freq swarmed (2) - 1 freq |
snarled (0) - 13 freq snorled (1) - 2 freq snirled (1) - 2 freq snyurled (2) - 1 freq knarled (2) - 1 freq gnarled (2) - 4 freq snared (2) - 5 freq smirled (3) - 2 freq snarlt (3) - 1 freq snarlene (3) - 1 freq snortled (3) - 1 freq snorted (3) - 7 freq swirled (3) - 3 freq snarlit (3) - 1 freq skirled (3) - 101 freq snirtled (3) - 1 freq snarl (3) - 9 freq spurled (3) - 1 freq snored (3) - 7 freq snarlin (3) - 9 freq snarls (3) - 7 freq snorked (3) - 1 freq snaiked (4) - 1 freq snaaed (4) - 1 freq harled (4) - 6 freq |
SoundEx code - S564 snorled - 2 freq snorls - 3 freq snarl - 9 freq snarled - 13 freq snorl - 20 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 |
SNARLED |
| Time to execute Levenshtein function - 0.191472 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.342292 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.031592 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.036767 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.000829 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. |