| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| papar (0) - 2 freq papae (1) - 1 freq papay (1) - 8 freq papal (1) - 5 freq paper (1) - 526 freq papas (1) - 2 freq papa (1) - 16 freq pypar (1) - 1 freq para (2) - 12 freq payan (2) - 1 freq paal (2) - 2 freq pampas (2) - 1 freq paiper (2) - 7 freq paan (2) - 3 freq apae (2) - 4 freq apa (2) - 2 freq papacy (2) - 1 freq paad (2) - 1 freq papery (2) - 1 freq pager (2) - 1 freq pap (2) - 21 freq ladar (2) - 1 freq farar (2) - 1 freq papt (2) - 6 freq baar (2) - 6 freq |
papar (0) - 2 freq paper (1) - 526 freq pypar (1) - 1 freq paipur (2) - 3 freq papery (2) - 1 freq pyper (2) - 4 freq pauper (2) - 5 freq appar (2) - 2 freq piper (2) - 31 freq paiper (2) - 7 freq papier (2) - 1 freq paeper (2) - 3 freq papal (2) - 5 freq papay (2) - 8 freq papae (2) - 1 freq papas (2) - 2 freq papa (2) - 16 freq cupar (3) - 5 freq poplar (3) - 1 freq papers (3) - 137 freq spar (3) - 14 freq sapr (3) - 1 freq papin (3) - 2 freq paer (3) - 3 freq polar (3) - 24 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 |
PAPAR |
| Time to execute Levenshtein function - 0.230279 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.329917 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.030367 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.036889 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.004729 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. |