| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| paperjust (0) - 1 freq papers' (3) - 1 freq paper's (3) - 2 freq papers (3) - 137 freq paupers (4) - 3 freq paperwirk (4) - 2 freq lapert (4) - 1 freq caper's (4) - 1 freq peeriest (4) - 14 freq paper (4) - 526 freq adjust (4) - 10 freq caseyjost (4) - 2 freq papershop (4) - 3 freq paerls (4) - 1 freq paust (4) - 2 freq papejays (4) - 1 freq japers (4) - 15 freq paperback (4) - 25 freq paper- (4) - 2 freq payers (4) - 4 freq persist (4) - 9 freq paperwork (4) - 7 freq paper' (4) - 1 freq paerish (4) - 1 freq paerts (4) - 1 freq |
paperjust (0) - 1 freq papers (5) - 137 freq uppermost (5) - 6 freq papers' (5) - 1 freq paper's (5) - 2 freq paepers (6) - 2 freq persuit (6) - 1 freq papejays (6) - 1 freq persist (6) - 9 freq pipers (6) - 10 freq piper's (6) - 2 freq uppercut (6) - 1 freq paipers (6) - 5 freq peeriest (6) - 14 freq papist (6) - 3 freq uppermaist (6) - 2 freq opprest (6) - 1 freq paupers (6) - 3 freq apprisit (6) - 1 freq prest (7) - 1 freq poorest (7) - 9 freq apperit (7) - 3 freq ajust (7) - 2 freq papered (7) - 1 freq paperboay (7) - 1 freq |
SoundEx code - P162 papers - 137 freq paper's - 2 freq pepper's - 1 freq pibroch - 7 freq peppers - 7 freq pipers - 10 freq paupers - 3 freq peepers - 6 freq puffers - 1 freq piper's - 2 freq poppers - 2 freq paparrazi - 1 freq paparazzi - 1 freq pibroch's - 1 freq peppercorns - 1 freq paepir-kaesin - 1 freq paipers - 5 freq peypers - 5 freq paepers - 2 freq paper-chin - 1 freq papers' - 1 freq peppercoarns - 1 freq peffers - 2 freq papershop - 3 freq peevers - 1 freq pibrochs - 1 freq paperjust - 1 freq papershoap - 1 freq paprika - 3 freq papercraft - 1 freq paperweights - 1 freq paperweight - 1 freq |
MetaPhone code - PPRJST paperjust - 1 freq |
PAPERJUST |
| Time to execute Levenshtein function - 0.276261 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.430678 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.028708 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.038322 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.000954 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. |