| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| paper-back (0) - 1 freq paperback (1) - 25 freq paperbacks (2) - 1 freq paperbacker (3) - 1 freq sate-back (3) - 1 freq paet-bank (3) - 1 freq tacky-back (4) - 1 freq payback (4) - 1 freq paper-chin (4) - 1 freq daberlack (4) - 2 freq a-back (4) - 1 freq paetstack (4) - 1 freq cheerback (4) - 1 freq papercraft (4) - 1 freq river-bank (4) - 1 freq paper- (4) - 2 freq aertbark (4) - 2 freq parenthack (4) - 1 freq peyback (4) - 1 freq paperwork (4) - 7 freq grew-back (4) - 1 freq paperboay (4) - 1 freq faw-back (4) - 2 freq hardback (4) - 2 freq paper-news (4) - 1 freq |
paper-back (0) - 1 freq paperback (2) - 25 freq paperbacks (4) - 1 freq paperbacker (5) - 1 freq paet-bank (6) - 1 freq sate-back (6) - 1 freq faw-back (7) - 2 freq grew-back (7) - 1 freq paperwork (7) - 7 freq hardback (7) - 2 freq pr-ick (7) - 1 freq peyback (7) - 1 freq paper-thin (7) - 1 freq paperwirk (7) - 2 freq paper-news (7) - 1 freq paperboay (7) - 1 freq a-back (7) - 1 freq paper-chin (7) - 1 freq payback (7) - 1 freq cheerback (7) - 1 freq tacky-back (7) - 1 freq river-bank (7) - 1 freq paper- (7) - 2 freq hyper-birl (8) - 2 freq parrock (8) - 2 freq |
SoundEx code - P161 pepper-boax - 1 freq paperbacks - 1 freq pepper-box - 3 freq pufferfish - 2 freq paperboay - 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 |
PAPER-BACK |
| Time to execute Levenshtein function - 0.248995 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.400144 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.028365 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.037751 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.000903 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. |