| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| snorers (0) - 2 freq scorers (1) - 1 freq snores (1) - 6 freq sobers (2) - 1 freq snookers (2) - 1 freq spores (2) - 2 freq showers (2) - 8 freq scores (2) - 15 freq storeys (2) - 3 freq snorts (2) - 5 freq sores (2) - 3 freq snokes (2) - 1 freq sookers (2) - 2 freq snpers (2) - 2 freq snotters (2) - 8 freq stores (2) - 30 freq shooers (2) - 17 freq storer (2) - 1 freq snored (2) - 7 freq sneers (2) - 2 freq smokers (2) - 8 freq snore (2) - 6 freq sojers (2) - 54 freq snorls (2) - 3 freq sorners (2) - 2 freq |
snorers (0) - 2 freq snores (2) - 6 freq scorers (2) - 1 freq sneers (3) - 2 freq snpers (3) - 2 freq snorls (3) - 3 freq snares (3) - 4 freq snorts (3) - 5 freq snorry (3) - 1 freq snorks (3) - 1 freq snookers (3) - 1 freq shearers (4) - 1 freq snarls (4) - 7 freq sterrs (4) - 7 freq snooerry (4) - 1 freq steerers (4) - 1 freq snurts (4) - 1 freq smirrs (4) - 1 freq sores (4) - 3 freq sonorous (4) - 2 freq snorri's (4) - 1 freq sinders (4) - 4 freq norris (4) - 1 freq sorras (4) - 6 freq sanners (4) - 2 freq |
SoundEx code - S566 snorers - 2 freq |
MetaPhone code - SNRRS snorers - 2 freq |
SNORERS |
| Time to execute Levenshtein function - 0.633787 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.888509 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.082475 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.100804 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.002125 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. |