| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| japers (0) - 15 freq papers (1) - 137 freq japer (1) - 1 freq japes (1) - 1 freq jakers (1) - 1 freq capers (1) - 7 freq sayers (2) - 17 freq apes (2) - 4 freq jokers (2) - 2 freq jater (2) - 1 freq rypers (2) - 1 freq jars (2) - 21 freq bakers (2) - 23 freq savers (2) - 1 freq caper's (2) - 1 freq paper's (2) - 2 freq lappers (2) - 1 freq layers (2) - 20 freq aamers (2) - 1 freq vipers (2) - 5 freq lagers (2) - 2 freq lawers (2) - 8 freq havers (2) - 35 freq waders (2) - 4 freq papery (2) - 1 freq |
japers (0) - 15 freq papers (2) - 137 freq capers (2) - 7 freq jakers (2) - 1 freq japes (2) - 1 freq japer (2) - 1 freq topers (3) - 1 freq reapers (3) - 2 freq paupers (3) - 3 freq jylers (3) - 3 freq rapurs (3) - 2 freq jaurs (3) - 15 freq jyners (3) - 26 freq paepers (3) - 2 freq jumpers (3) - 15 freq jeers (3) - 1 freq japs (3) - 12 freq pers (3) - 1 freq lepers (3) - 4 freq paipers (3) - 5 freq payers (3) - 4 freq jailers (3) - 1 freq pipers (3) - 10 freq jars (3) - 21 freq jiners (3) - 6 freq |
SoundEx code - J162 japers - 15 freq jbrokenshire - 1 freq jeffbrazier - 181 freq joforjoanne - 1 freq jparkersbulbs - 1 freq |
MetaPhone code - JPRS japers - 15 freq |
JAPERS |
| Time to execute Levenshtein function - 0.285706 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.491418 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.033161 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.040035 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.002461 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. |