| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| upper (0) - 54 freq 'upper (1) - 1 freq supper (1) - 171 freq uppers (1) - 2 freq vupper (1) - 1 freq upped (1) - 5 freq wyper (2) - 1 freq wapper (2) - 2 freq uber (2) - 2 freq riper (2) - 4 freq dipper (2) - 3 freq piper (2) - 24 freq puppet (2) - 14 freq poer (2) - 1 freq muppet (2) - 11 freq oppor (2) - 1 freq appert (2) - 1 freq leper (2) - 2 freq hyper (2) - 4 freq ripper (2) - 10 freq caper (2) - 14 freq pipper (2) - 2 freq paer (2) - 3 freq capper (2) - 2 freq pier (2) - 38 freq |
upper (0) - 54 freq oppor (2) - 1 freq piper (2) - 24 freq appar (2) - 2 freq appeir (2) - 1 freq pyper (2) - 4 freq ppera (2) - 24 freq appear (2) - 98 freq paper (2) - 511 freq uppers (2) - 2 freq upped (2) - 5 freq supper (2) - 171 freq vupper (2) - 1 freq 'upper (2) - 1 freq nipper (3) - 1 freq napper (3) - 36 freq pypar (3) - 1 freq iper (3) - 7 freq copper (3) - 22 freq liper (3) - 1 freq kuiper (3) - 11 freq ppe (3) - 3 freq lapper (3) - 1 freq papper (3) - 1 freq oppen (3) - 31 freq |
SoundEx code - U160 upper - 54 freq up-or - 1 freq upr - 2 freq 'upper - 1 freq ufer - 1 freq ueber - 1 freq €œupper - 1 freq uber - 2 freq uapr - 1 freq uvver - 10 freq uvyr - 1 freq |
MetaPhone code - UPR upper - 54 freq up-or - 1 freq upr - 2 freq 'upper - 1 freq €œupper - 1 freq uapr - 1 freq |
UPPER |
| Time to execute Levenshtein function - 0.160292 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.322912 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.028887 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.036533 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.000844 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. |