| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| papery (0) - 1 freq paper- (1) - 2 freq paper' (1) - 1 freq papers (1) - 137 freq paper (1) - 526 freq popery (1) - 2 freq watery (2) - 8 freq pastry (2) - 9 freq caper (2) - 14 freq paer (2) - 3 freq apern (2) - 1 freq pamper (2) - 2 freq papacy (2) - 1 freq papay (2) - 8 freq faery (2) - 2 freq pipers (2) - 10 freq capers (2) - 7 freq ppera (2) - 24 freq praper (2) - 1 freq papered (2) - 1 freq paupers (2) - 3 freq payer (2) - 1 freq parry (2) - 1 freq pauper (2) - 5 freq paey (2) - 2 freq |
papery (0) - 1 freq popery (1) - 2 freq paper (1) - 526 freq paiper (2) - 7 freq pauper (2) - 5 freq pyper (2) - 4 freq ppera (2) - 24 freq piper (2) - 31 freq papier (2) - 1 freq papar (2) - 2 freq paper- (2) - 2 freq paper' (2) - 1 freq papers (2) - 137 freq paeper (2) - 3 freq pape (3) - 1 freq paperin (3) - 2 freq japer (3) - 1 freq paipur (3) - 3 freq pager (3) - 1 freq pawper (3) - 6 freq peyper (3) - 1 freq pooper (3) - 1 freq pypar (3) - 1 freq upper (3) - 55 freq peiper (3) - 1 freq |
SoundEx code - P160 paper - 526 freq pepper - 83 freq piper - 31 freq puffer - 1 freq paper' - 1 freq papier - 1 freq popery - 2 freq pauper - 5 freq pyper - 4 freq papper - 1 freq pivver - 1 freq pipper - 2 freq paiper - 7 freq peyper - 1 freq papar - 2 freq paipur - 3 freq pepperie - 1 freq peiper - 1 freq popper - 3 freq pawper - 6 freq pypar - 1 freq peever - 1 freq €˜paper - 1 freq paeper - 3 freq papery - 1 freq pooper - 1 freq paybrhw - 1 freq paper- - 2 freq |
MetaPhone code - PPR paper - 526 freq pepper - 83 freq piper - 31 freq paper' - 1 freq papier - 1 freq popery - 2 freq pauper - 5 freq pyper - 4 freq papper - 1 freq pipper - 2 freq paiper - 7 freq peyper - 1 freq papar - 2 freq paipur - 3 freq pepperie - 1 freq peiper - 1 freq popper - 3 freq pawper - 6 freq pypar - 1 freq €˜paper - 1 freq paeper - 3 freq papery - 1 freq pooper - 1 freq paper- - 2 freq |
PAPERY |
| Time to execute Levenshtein function - 0.194985 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.375736 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.027611 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.037034 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.000872 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. |