| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| newspapers (0) - 38 freq newspaper (1) - 63 freq newspaipers (1) - 2 freq newspages (2) - 1 freq i'newspapers (2) - 1 freq news-paper (2) - 1 freq newspapermen (3) - 3 freq newsreaders (3) - 2 freq newspepper (3) - 2 freq i'newspaper (3) - 1 freq wawpaper (4) - 6 freq peppers (4) - 7 freq escapes (4) - 4 freq mienewspaper (4) - 1 freq newsagents (4) - 4 freq keppers (4) - 1 freq spakers (4) - 4 freq newskesters (4) - 1 freq neep-perk (4) - 2 freq papers (4) - 137 freq nyowspeypers (4) - 1 freq newsagent (4) - 2 freq newscaster (4) - 1 freq newcomers (4) - 6 freq neipers (4) - 2 freq |
newspapers (0) - 38 freq newspaipers (1) - 2 freq newspaper (2) - 63 freq i'newspapers (3) - 1 freq newspages (4) - 1 freq nyowspeypers (4) - 1 freq news-paper (4) - 1 freq i'newspaper (5) - 1 freq newspapermen (5) - 3 freq newspepper (5) - 2 freq newsreaders (5) - 2 freq nappers (6) - 6 freq mienewspaper (6) - 1 freq nippers (6) - 2 freq neipers (7) - 2 freq newcomers (7) - 6 freq whoppers (7) - 1 freq spacers (7) - 2 freq newsreader (7) - 3 freq suppers (7) - 22 freq naysayers (7) - 1 freq neepers (7) - 5 freq spakers (7) - 4 freq newsagents (7) - 4 freq peppers (7) - 7 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 |
NEWSPAPERS paper - 526 freq papers - 137 freq paperin - 2 freq papering - freq newspaper - 63 freq newspapers - 38 freq newspapermen - 3 freq paperback - 25 freq paperbacker - 1 freq paperwork - 7 freq paperwirk - 2 freq wawpaper - 6 freq wallpaper - 5 freq wallpaperin - 2 freq papershop - 3 freq paper- - 2 freq waste-paper - 2 freq paper-thin - 1 freq sandpaper - 3 freq |
| Time to execute Levenshtein function - 0.203453 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.378663 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.027410 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.037485 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.001206 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. |