| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| puppetry (0) - 2 freq puppets (2) - 2 freq puppet (2) - 14 freq pepper (3) - 83 freq pouppet (3) - 1 freq poietry (3) - 3 freq papery (3) - 1 freq papper (3) - 1 freq pipper (3) - 2 freq €˜poetry (3) - 1 freq 'upper (3) - 1 freq poyetry (3) - 5 freq huppity (3) - 1 freq poetry (3) - 260 freq popper (3) - 3 freq suppers (3) - 22 freq supper (3) - 173 freq popery (3) - 2 freq poppets (3) - 1 freq peppert (3) - 1 freq musketry (3) - 1 freq uppers (3) - 2 freq uppity (3) - 6 freq pouetry (3) - 1 freq poppet (3) - 8 freq |
puppetry (0) - 2 freq puppet (3) - 14 freq puppets (3) - 2 freq puppeteer (3) - 1 freq popper (4) - 3 freq pipper (4) - 2 freq poppets (4) - 1 freq papper (4) - 1 freq pepper (4) - 83 freq poppet (4) - 8 freq pouppet (4) - 1 freq muppets (5) - 5 freq poppt (5) - 3 freq upper (5) - 55 freq peppers (5) - 7 freq vupper (5) - 1 freq puppy (5) - 31 freq pepperie (5) - 1 freq pappit (5) - 1 freq 'poetry (5) - 1 freq pouetry (5) - 1 freq muppet (5) - 11 freq wuppet (5) - 2 freq poppers (5) - 2 freq 'upper (5) - 1 freq |
SoundEx code - P136 poofter - 1 freq puppetry - 2 freq puppeteer - 1 freq poofters - 1 freq pipterino - 1 freq |
MetaPhone code - PPTR puppetry - 2 freq puppeteer - 1 freq |
PUPPETRY |
| Time to execute Levenshtein function - 0.237380 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.374240 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.039662 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.050288 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.001147 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. |