| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| poignantly (0) - 1 freq poignant (2) - 5 freq indignantly (3) - 10 freq eminently (4) - 2 freq pregnancy (4) - 3 freq contantly (4) - 1 freq pockmanty (4) - 2 freq pleisantly (4) - 1 freq distantly (4) - 2 freq pleasantly (4) - 1 freq signally (4) - 2 freq constantly (4) - 24 freq pairently (4) - 1 freq insantly (4) - 1 freq pointy (4) - 6 freq pregnant (4) - 19 freq intantly (4) - 1 freq pageantry (4) - 1 freq petulantly (4) - 1 freq vibrantly (4) - 1 freq hogmanay (5) - 68 freq gigantic (5) - 20 freq pointin (5) - 81 freq gantry (5) - 6 freq panty (5) - 1 freq |
poignantly (0) - 1 freq poignant (3) - 5 freq indignantly (5) - 10 freq pregnant (6) - 19 freq pageantry (6) - 1 freq pleasantly (6) - 1 freq petulantly (6) - 1 freq pairently (6) - 1 freq eminently (6) - 2 freq pleisantly (6) - 1 freq pyntitly (7) - 3 freq pennant (7) - 1 freq pennants (7) - 1 freq pigtail (7) - 3 freq appearantly (7) - 2 freq urgently (7) - 7 freq pinnacle (7) - 1 freq pintle (7) - 2 freq appairantly (7) - 1 freq patiently (7) - 28 freq imminently (7) - 1 freq permanently (7) - 6 freq patently (7) - 6 freq gantle (7) - 1 freq praisently (7) - 2 freq |
SoundEx code - P255 pikemen - 1 freq packmen - 2 freq pish-minnies - 1 freq pysonin - 3 freq pizenin - 1 freq poisoning - 3 freq poisonin - 3 freq pokemon - 1 freq pack-mannie - 1 freq poignant - 5 freq pigmen - 1 freq pokmantie - 1 freq pokémon - 1 freq pigments - 1 freq packman - 3 freq pockmanty - 2 freq pachamama - 1 freq poignantly - 1 freq pac-man - 1 freq |
MetaPhone code - PKNNTL poignantly - 1 freq |
POIGNANTLY |
| Time to execute Levenshtein function - 0.197675 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.366907 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.028056 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.038102 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.000878 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. |