| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| paperback (0) - 25 freq paperbacks (1) - 1 freq paper-back (1) - 1 freq paperbacker (2) - 1 freq paperwirk (3) - 2 freq paperwork (3) - 7 freq cheerback (3) - 1 freq paperboay (3) - 1 freq daberlack (3) - 2 freq peyback (3) - 1 freq payback (3) - 1 freq haversack (3) - 1 freq sate-back (3) - 1 freq tarbuck (4) - 1 freq parenthack (4) - 1 freq perfick (4) - 2 freq aertbark (4) - 2 freq feedback (4) - 20 freq acerbic (4) - 1 freq comeback (4) - 7 freq papery (4) - 1 freq imperfeck (4) - 1 freq ppera (4) - 24 freq paulbiack (4) - 1 freq silverback (4) - 2 freq |
paperback (0) - 25 freq paper-back (2) - 1 freq paperbacks (2) - 1 freq paperbacker (3) - 1 freq paperboay (5) - 1 freq peyback (5) - 1 freq payback (5) - 1 freq cheerback (5) - 1 freq paperwork (5) - 7 freq paperwirk (5) - 2 freq approach (6) - 105 freq patrick (6) - 32 freq imperfeck (6) - 1 freq 'perfeck (6) - 1 freq atarbuck (6) - 1 freq playback (6) - 1 freq paulbiack (6) - 1 freq parrock (6) - 2 freq sate-back (6) - 1 freq haversack (6) - 1 freq daberlack (6) - 2 freq partick (6) - 12 freq tarbuck (6) - 1 freq perfick (6) - 2 freq paitrick (6) - 1 freq |
SoundEx code - P161 pepper-boax - 1 freq paperbacks - 1 freq pepper-box - 3 freq paperboay - 1 freq pufferfish - 1 freq paperback - 25 freq paperbacker - 1 freq pepperbox - 1 freq paper-back - 1 freq |
MetaPhone code - PPRBK paperback - 25 freq paper-back - 1 freq |
PAPERBACK paper - 511 freq papers - 137 freq paperin - 2 freq papering - freq newspaper - 62 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 - 2 freq |
| Time to execute Levenshtein function - 0.235501 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.370403 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.028489 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.038819 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.004921 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. |