| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| puppeteer (0) - 1 freq puppets (3) - 2 freq upsteer (3) - 3 freq puppetry (3) - 2 freq puppet (3) - 14 freq oppeneen (4) - 1 freq pullitzer (4) - 1 freq upstier (4) - 1 freq wuppet (4) - 2 freq punter (4) - 15 freq muppets (4) - 5 freq supporter (4) - 21 freq quaeter (4) - 1 freq poppets (4) - 1 freq peppered (4) - 1 freq popper (4) - 3 freq pouppet (4) - 1 freq poppet (4) - 8 freq quhether (4) - 1 freq privateer (4) - 1 freq competeen (4) - 1 freq 'peter (4) - 3 freq dupleader (4) - 2 freq pepperie (4) - 1 freq muppet (4) - 11 freq |
puppeteer (0) - 1 freq puppetry (3) - 2 freq puppets (4) - 2 freq puppet (4) - 14 freq popper (5) - 3 freq pouppet (5) - 1 freq poppets (5) - 1 freq pipper (5) - 2 freq propter (5) - 1 freq pepperie (5) - 1 freq poppet (5) - 8 freq pepper (5) - 83 freq papper (5) - 1 freq upsteer (5) - 3 freq 'upper (6) - 1 freq poppit (6) - 1 freq supper (6) - 173 freq poppt (6) - 3 freq peter (6) - 148 freq jupiter (6) - 9 freq putter (6) - 1 freq pippered (6) - 1 freq supplier (6) - 3 freq upper (6) - 55 freq vupper (6) - 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 |
PUPPETEER |
| Time to execute Levenshtein function - 0.295528 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.532111 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.038335 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.046959 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.001020 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. |