| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pptmlmaamz (0) - 1 freq m-m-mammy (6) - 2 freq ootlaas (6) - 1 freq tfrsaaz (6) - 1 freq optimal (6) - 1 freq €œma-aam (6) - 2 freq patmcclay (6) - 1 freq tmseavz (6) - 1 freq mamam (6) - 1 freq pearljam (6) - 3 freq ppthomson (6) - 1 freq proclaim (6) - 5 freq pitman (6) - 1 freq polmaise (6) - 4 freq thomasm (6) - 5 freq smmaa (6) - 1 freq laams (6) - 1 freq plumman (6) - 1 freq €œmaam (6) - 1 freq elmadam (6) - 3 freq plaan (6) - 1 freq parliamo (6) - 4 freq plaags (6) - 1 freq palma (6) - 2 freq ltlzaz (6) - 1 freq |
pptmlmaamz (0) - 1 freq ptolemy (10) - 1 freq plumman (10) - 1 freq optimism (10) - 8 freq ppthomson (10) - 1 freq ptlz (10) - 1 freq optimal (10) - 1 freq applemak (11) - 2 freq stillgame (11) - 1 freq pitsliga's (11) - 1 freq pantomime (11) - 8 freq plasma (11) - 5 freq proclaims (11) - 4 freq talamh (11) - 1 freq tomasz (11) - 4 freq plummy (11) - 2 freq pitsliga (11) - 35 freq postmortem (11) - 1 freq patmason (11) - 1 freq pitsligas (11) - 2 freq plummet (11) - 2 freq palma (11) - 2 freq pachamama (11) - 1 freq ltlzaz (11) - 1 freq mamam (11) - 1 freq |
SoundEx code - P354 puddeenless - 1 freq peityin-like - 1 freq pptmlmaamz - 1 freq petemolyneux - 2 freq |
MetaPhone code - PTMLMMS pptmlmaamz - 1 freq |
PPTMLMAAMZ |
| Time to execute Levenshtein function - 0.313794 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.804000 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.065298 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.039231 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.000995 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. |