| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| snarlt (0) - 1 freq snarls (1) - 7 freq snarlit (1) - 1 freq snarl (1) - 9 freq snorlt (1) - 2 freq skailt (2) - 32 freq sailt (2) - 2 freq snorl't (2) - 1 freq scart (2) - 23 freq snort (2) - 8 freq swallt (2) - 15 freq snares (2) - 4 freq snorl (2) - 21 freq knurlt (2) - 1 freq smart (2) - 41 freq jnarlp (2) - 1 freq saylt (2) - 1 freq nirlt (2) - 1 freq snare (2) - 13 freq snakit (2) - 3 freq start (2) - 592 freq saalt (2) - 5 freq sealt (2) - 2 freq shalt (2) - 6 freq swaalt (2) - 1 freq |
snarlt (0) - 1 freq snarlit (1) - 1 freq snorlt (1) - 2 freq snarls (2) - 7 freq snarl (2) - 9 freq snarlin (3) - 9 freq nirlt (3) - 1 freq smirlt (3) - 1 freq scarlet (3) - 22 freq swirlt (3) - 2 freq skirlt (3) - 1 freq starlit (3) - 1 freq snirt (3) - 3 freq knurlt (3) - 1 freq snorls (3) - 3 freq snorl't (3) - 1 freq snort (3) - 8 freq snor't (3) - 1 freq snorl (3) - 21 freq snarled (3) - 13 freq skart (4) - 2 freq sparkt (4) - 1 freq snared (4) - 5 freq sparet (4) - 1 freq snirtlet (4) - 3 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 |
SNARLT |
| Time to execute Levenshtein function - 0.194157 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.379441 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.029847 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.044043 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.001186 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. |