| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dipper (0) - 3 freq nipper (1) - 1 freq pipper (1) - 2 freq lipper (1) - 14 freq tipper (1) - 14 freq dipped (1) - 23 freq dippers (1) - 4 freq dapper (1) - 4 freq sipper (1) - 6 freq ripper (1) - 10 freq kipper (1) - 5 freq flipper (2) - 2 freq napper (2) - 36 freq swipper (2) - 8 freq supper (2) - 173 freq draper (2) - 2 freq vupper (2) - 1 freq nipped (2) - 22 freq popper (2) - 3 freq drapper (2) - 1 freq chipper (2) - 24 freq nippers (2) - 2 freq dizer (2) - 1 freq cipher (2) - 1 freq dinger (2) - 17 freq |
dipper (0) - 3 freq dapper (1) - 4 freq ripper (2) - 10 freq kipper (2) - 5 freq dippers (2) - 4 freq sipper (2) - 6 freq dipped (2) - 23 freq nipper (2) - 1 freq pipper (2) - 2 freq lipper (2) - 14 freq tipper (2) - 14 freq dippin (3) - 10 freq nippier (3) - 1 freq capper (3) - 2 freq papper (3) - 1 freq tapper (3) - 1 freq piper (3) - 31 freq dnieper (3) - 1 freq bopper (3) - 3 freq pepper (3) - 83 freq copper (3) - 22 freq wapper (3) - 2 freq lapper (3) - 1 freq caipper (3) - 1 freq dippit (3) - 12 freq |
SoundEx code - D160 deeper - 51 freq dover - 16 freq duffer - 6 freq differ - 135 freq dapper - 4 freq diver - 5 freq dafferie - 4 freq dyvor - 1 freq dobro - 1 freq daffery - 2 freq dobber - 4 freq devour' - 1 freq dowper - 4 freq dover' - 1 freq dhofar - 1 freq 'dafferie - 1 freq deiffer - 2 freq daiver - 4 freq deefer - 1 freq dyvour - 2 freq dibber - 2 freq dabber - 3 freq devour - 7 freq dipper - 3 freq devoir - 1 freq deepur - 1 freq difer - 2 freq dfr - 2 freq dwfywri - 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 |
DIPPER |
| Time to execute Levenshtein function - 0.479500 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.812917 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.076818 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.037426 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.000861 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. |