| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| poofter (0) - 1 freq pooter (1) - 1 freq poofters (1) - 1 freq pooster (1) - 5 freq toolter (2) - 1 freq poster (2) - 24 freq poocher (2) - 2 freq poostir (2) - 1 freq pooper (2) - 1 freq porter (2) - 14 freq plowter (2) - 6 freq poodher (2) - 1 freq crofter (2) - 4 freq tooter (2) - 4 freq pooer (2) - 161 freq potter (2) - 29 freq plooter (2) - 1 freq coonter (2) - 72 freq poorer (2) - 5 freq dooter (2) - 3 freq sooster (2) - 1 freq poother (2) - 5 freq plotter (2) - 1 freq propter (2) - 1 freq booster (2) - 3 freq |
poofter (0) - 1 freq poofters (2) - 1 freq pooster (2) - 5 freq pooter (2) - 1 freq potter (3) - 29 freq plooter (3) - 1 freq porter (3) - 14 freq softer (3) - 4 freq poster (3) - 24 freq footer (3) - 14 freq poostir (3) - 1 freq pelter (4) - 1 freq ifter (4) - 1 freq safter (4) - 10 freq footery (4) - 6 freq 'efter (4) - 5 freq lafter (4) - 1 freq ploitery (4) - 1 freq pitter (4) - 2 freq picter (4) - 89 freq eifter (4) - 3 freq patter (4) - 56 freq pester (4) - 2 freq dafter (4) - 6 freq aifter (4) - 343 freq |
SoundEx code - P136 poofter - 1 freq puppetry - 2 freq puppeteer - 1 freq poofters - 1 freq pipterino - 1 freq |
MetaPhone code - PFTR poofter - 1 freq |
POOFTER |
| Time to execute Levenshtein function - 0.206213 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.357854 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.028488 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.039023 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.000890 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. |