| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| papt (0) - 6 freq prapt (1) - 1 freq pant (1) - 3 freq lapt (1) - 3 freq paet (1) - 46 freq rapt (1) - 1 freq paut (1) - 1 freq part (1) - 196 freq pact (1) - 10 freq palt (1) - 1 freq apt (1) - 45 freq pape (1) - 1 freq past (1) - 836 freq pat (1) - 261 freq pap (1) - 21 freq paps (1) - 9 freq papa (1) - 16 freq hapt (1) - 5 freq pas (2) - 18 freq paix (2) - 2 freq last (2) - 1873 freq rap (2) - 20 freq caat (2) - 9 freq aaht (2) - 1 freq gapit (2) - 1 freq |
papt (0) - 6 freq hapt (2) - 5 freq papa (2) - 16 freq pap (2) - 21 freq pupit (2) - 1 freq paps (2) - 9 freq popet (2) - 2 freq pypet (2) - 2 freq poapit (2) - 1 freq appt (2) - 1 freq pat (2) - 261 freq pipit (2) - 6 freq uppt (2) - 1 freq rapt (2) - 1 freq lapt (2) - 3 freq pant (2) - 3 freq prapt (2) - 1 freq paut (2) - 1 freq paet (2) - 46 freq past (2) - 836 freq palt (2) - 1 freq pact (2) - 10 freq apt (2) - 45 freq part (2) - 196 freq pape (2) - 1 freq |
SoundEx code - P130 papped - 22 freq poopit - 4 freq peeped - 10 freq peeved - 4 freq puffed - 18 freq pipit - 6 freq peivot - 1 freq 'phhft - 3 freq phffft - 1 freq poppt - 3 freq popped - 36 freq poapit - 1 freq paved - 4 freq pufft - 3 freq piped - 12 freq poppet - 8 freq popet - 2 freq pypet - 2 freq puffe'd - 1 freq puppet - 14 freq peep-o-day - 1 freq puffit - 3 freq poupit - 6 freq papt - 6 freq pauvit - 1 freq poppit - 1 freq pappit - 1 freq peevot - 1 freq poo-poohed - 1 freq pupit - 1 freq pouppet - 1 freq poaped - 1 freq pivot - 2 freq |
MetaPhone code - PPT papped - 22 freq poopit - 4 freq peeped - 10 freq pipit - 6 freq poppt - 3 freq popped - 36 freq poapit - 1 freq piped - 12 freq poppet - 8 freq popet - 2 freq pypet - 2 freq puppet - 14 freq peep-o-day - 1 freq poupit - 6 freq papt - 6 freq poppit - 1 freq pappit - 1 freq pupit - 1 freq pouppet - 1 freq poaped - 1 freq |
PAPT |
| Time to execute Levenshtein function - 0.234930 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.378724 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.041342 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.052131 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.001234 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. |