| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| newspaipers (0) - 2 freq newspapers (1) - 38 freq newspaper (2) - 63 freq i'newspapers (3) - 1 freq news-paper (3) - 1 freq newspepper (3) - 2 freq newspages (3) - 1 freq nyowspeypers (4) - 1 freq neipers (4) - 2 freq newspapermen (4) - 3 freq newsreaders (4) - 2 freq paipers (4) - 5 freq i'newspaper (4) - 1 freq newscaster (4) - 1 freq newskesters (4) - 1 freq paupers (5) - 3 freq spoilers (5) - 2 freq paiper (5) - 7 freq despaired (5) - 2 freq 'waiters (5) - 1 freq leipers (5) - 2 freq spiders (5) - 6 freq stappers (5) - 1 freq spammers (5) - 2 freq spiers (5) - 15 freq |
newspaipers (0) - 2 freq newspapers (1) - 38 freq newspaper (3) - 63 freq nyowspeypers (4) - 1 freq i'newspapers (4) - 1 freq news-paper (5) - 1 freq newspages (5) - 1 freq newspepper (5) - 2 freq newsreaders (6) - 2 freq i'newspaper (6) - 1 freq newspapermen (6) - 3 freq nippers (7) - 2 freq mienewspaper (7) - 1 freq wrappers (7) - 8 freq sappers (7) - 2 freq nappers (7) - 6 freq newskesters (7) - 1 freq neipers (7) - 2 freq paipers (7) - 5 freq snappers (8) - 2 freq speikers (8) - 46 freq newcomers (8) - 6 freq naysayers (8) - 1 freq papers (8) - 137 freq slappers (8) - 2 freq |
SoundEx code - N211 newspapers - 38 freq newspaper - 63 freq newspepper - 2 freq newspaper-wrapped - 1 freq newspapermen - 3 freq newspaipers - 2 freq nyowspeypers - 1 freq news-paper - 1 freq njbivoub - 1 freq |
MetaPhone code - NSPPRS newspapers - 38 freq newspaipers - 2 freq |
NEWSPAIPERS |
| Time to execute Levenshtein function - 0.308375 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.677429 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.060676 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.049886 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.001294 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. |