| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| snirled (0) - 2 freq smirled (1) - 2 freq swirled (1) - 3 freq snirtled (1) - 1 freq snorled (1) - 2 freq snarled (1) - 13 freq skirled (1) - 101 freq snortled (2) - 1 freq sniffed (2) - 16 freq stirred (2) - 12 freq sidled (2) - 2 freq sailed (2) - 32 freq sirpled (2) - 1 freq tirled (2) - 6 freq snorked (2) - 1 freq mirled (2) - 2 freq soiled (2) - 2 freq pirled (2) - 3 freq spiled (2) - 7 freq knarled (2) - 1 freq smiled (2) - 238 freq sairved (2) - 4 freq thirled (2) - 20 freq spieled (2) - 1 freq mniled (2) - 1 freq |
snirled (0) - 2 freq snorled (1) - 2 freq snarled (1) - 13 freq snyurled (2) - 1 freq skirled (2) - 101 freq snirtled (2) - 1 freq smirled (2) - 2 freq swirled (2) - 3 freq knarled (3) - 1 freq snorted (3) - 7 freq snared (3) - 5 freq snorked (3) - 1 freq snored (3) - 7 freq spurled (3) - 1 freq gnarled (3) - 4 freq snortled (3) - 1 freq struled (4) - 1 freq snirtlet (4) - 3 freq snarlt (4) - 1 freq snarl (4) - 9 freq swilled (4) - 1 freq snorlie (4) - 1 freq snirket (4) - 1 freq smirked (4) - 18 freq saired (4) - 7 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 |
SNIRLED |
| Time to execute Levenshtein function - 0.210633 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.391446 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.028977 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.037350 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.000882 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. |