Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
tipper (0) - 14 freq tripper (1) - 1 freq topper (1) - 12 freq lipper (1) - 14 freq nipper (1) - 1 freq sipper (1) - 6 freq ripper (1) - 10 freq tipped (1) - 14 freq kipper (1) - 5 freq tapper (1) - 1 freq dipper (1) - 3 freq pipper (1) - 2 freq lapper (2) - 1 freq supper (2) - 171 freq ticker (2) - 3 freq rippen (2) - 5 freq timer (2) - 6 freq titter (2) - 1 freq dipped (2) - 23 freq rippek (2) - 2 freq tiger (2) - 27 freq zipped (2) - 5 freq upper (2) - 54 freq popper (2) - 3 freq tither (2) - 202 freq |
tipper (0) - 14 freq tapper (1) - 1 freq topper (1) - 12 freq kipper (2) - 5 freq tipped (2) - 14 freq pipper (2) - 2 freq dipper (2) - 3 freq tripper (2) - 1 freq ripper (2) - 10 freq lipper (2) - 14 freq nipper (2) - 1 freq sipper (2) - 6 freq tipp (3) - 1 freq rapper (3) - 4 freq stopper (3) - 2 freq copper (3) - 22 freq tipple (3) - 3 freq wapper (3) - 2 freq tippeen (3) - 1 freq papper (3) - 1 freq tazper (3) - 1 freq tipperin (3) - 2 freq topped (3) - 1 freq tapped (3) - 14 freq tippie (3) - 3 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 |
TIPPER |
Time to execute Levenshtein function - 0.281945 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.367310 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.028045 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.039346 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.000852 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. |