| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tapper (0) - 1 freq capper (1) - 2 freq lapper (1) - 1 freq napper (1) - 36 freq tazper (1) - 1 freq dapper (1) - 4 freq rapper (1) - 4 freq wapper (1) - 2 freq topper (1) - 12 freq papper (1) - 1 freq tapner (1) - 2 freq tapped (1) - 14 freq taper (1) - 4 freq tamper (1) - 1 freq tipper (1) - 14 freq topped (2) - 1 freq nappers (2) - 6 freq toppet (2) - 2 freq happier (2) - 18 freq tadjer (2) - 1 freq rapier (2) - 2 freq japer (2) - 1 freq camper (2) - 1 freq tapes (2) - 11 freq tapp't (2) - 1 freq |
tapper (0) - 1 freq topper (1) - 12 freq tipper (1) - 14 freq papper (2) - 1 freq tapner (2) - 2 freq tamper (2) - 1 freq tapped (2) - 14 freq taper (2) - 4 freq lapper (2) - 1 freq wapper (2) - 2 freq napper (2) - 36 freq capper (2) - 2 freq rapper (2) - 4 freq dapper (2) - 4 freq tazper (2) - 1 freq kipper (3) - 5 freq dipper (3) - 3 freq bopper (3) - 3 freq tappan (3) - 3 freq tapperon (3) - 1 freq pipper (3) - 2 freq copper (3) - 22 freq appar (3) - 2 freq paeper (3) - 3 freq tappin (3) - 20 freq |
SoundEx code - T160 thievery - 1 freq tverie - 2 freq tver - 3 freq tipper - 14 freq tvery - 2 freq topiary - 2 freq tapper - 1 freq tvver - 1 freq tibur - 2 freq tiber - 1 freq topper - 12 freq tea-barra - 1 freq taiver - 2 freq tuber - 1 freq taper - 4 freq tobar - 2 freq tfar - 1 freq the-fore - 1 freq twa-fower - 1 freq topher - 1 freq twofur - 1 freq tabor - 1 freq tfvoeor - 1 freq tvroy - 1 freq |
MetaPhone code - TPR deeper - 51 freq dapper - 4 freq tipper - 14 freq topiary - 2 freq tapper - 1 freq dowper - 4 freq topper - 12 freq taper - 4 freq dipper - 3 freq deepur - 1 freq |
TAPPER |
| Time to execute Levenshtein function - 0.193263 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.515496 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.027579 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.076158 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.000791 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. |