| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vupper (0) - 1 freq 'upper (1) - 1 freq supper (1) - 171 freq upper (1) - 54 freq upped (2) - 5 freq €œupper (2) - 1 freq supped (2) - 4 freq kipper (2) - 5 freq napper (2) - 36 freq bopper (2) - 3 freq wupped (2) - 7 freq bumper (2) - 3 freq popper (2) - 3 freq dipper (2) - 3 freq capper (2) - 2 freq pepper (2) - 83 freq super (2) - 36 freq nipper (2) - 1 freq suppen (2) - 1 freq tapper (2) - 1 freq pipper (2) - 2 freq lipper (2) - 14 freq papper (2) - 1 freq kuiper (2) - 11 freq sipper (2) - 6 freq |
vupper (0) - 1 freq 'upper (2) - 1 freq upper (2) - 54 freq supper (2) - 171 freq tipper (3) - 14 freq copper (3) - 22 freq sipper (3) - 6 freq pipper (3) - 2 freq wapper (3) - 2 freq lipper (3) - 14 freq papper (3) - 1 freq rapper (3) - 4 freq topper (3) - 12 freq viper (3) - 1 freq lapper (3) - 1 freq ripper (3) - 10 freq tapper (3) - 1 freq dapper (3) - 4 freq veeper (3) - 2 freq popper (3) - 3 freq bopper (3) - 3 freq kipper (3) - 5 freq dipper (3) - 3 freq capper (3) - 2 freq nipper (3) - 1 freq |
SoundEx code - V160 veeper - 2 freq vapour - 3 freq vibrio - 1 freq viper - 1 freq vovr - 1 freq vhbr - 1 freq vupper - 1 freq |
MetaPhone code - FPR veeper - 2 freq vapour - 3 freq viper - 1 freq fapor - 2 freq vupper - 1 freq |
VUPPER |
| Time to execute Levenshtein function - 0.205562 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.357588 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.027561 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.037386 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.000856 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. |