| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pasted (0) - 2 freq passed (1) - 314 freq patted (1) - 15 freq pastel (1) - 2 freq panted (1) - 5 freq lasted (1) - 16 freq tasted (1) - 20 freq casted (1) - 2 freq posted (1) - 21 freq paste (1) - 10 freq parted (1) - 1 freq pastes (1) - 1 freq pawted (1) - 1 freq wasted (1) - 24 freq hasted (1) - 2 freq plashed (2) - 1 freq mashed (2) - 5 freq nested (2) - 1 freq ganted (2) - 2 freq plaited (2) - 3 freq manted (2) - 1 freq phased (2) - 1 freq gated (2) - 1 freq wated (2) - 1 freq aster (2) - 1 freq |
pasted (0) - 2 freq posted (1) - 21 freq paste (2) - 10 freq pastes (2) - 1 freq wasted (2) - 24 freq hasted (2) - 2 freq pawted (2) - 1 freq parted (2) - 1 freq pastel (2) - 2 freq casted (2) - 2 freq passed (2) - 314 freq panted (2) - 5 freq patted (2) - 15 freq lasted (2) - 16 freq tasted (2) - 20 freq pushed (3) - 92 freq pester (3) - 2 freq pastie (3) - 1 freq disted (3) - 1 freq hoasted (3) - 7 freq toasted (3) - 3 freq pastor (3) - 1 freq pynted (3) - 22 freq hosted (3) - 3 freq feasted (3) - 2 freq |
SoundEx code - P233 postit - 13 freq pocketed - 2 freq pechd-oot - 1 freq pasted - 2 freq pastit - 1 freq pactit - 3 freq posted - 21 freq post-it - 2 freq post-identity - 1 freq pig-heiditness - 3 freq picketed - 1 freq pig-heidit - 1 freq positit - 1 freq peched-oot - 1 freq pawkie-wittit - 1 freq pyqxthtohn - 1 freq pxytotdgm - 1 freq pgtwweets - 7 freq |
MetaPhone code - PSTT postit - 13 freq pasted - 2 freq pastit - 1 freq posted - 21 freq post-it - 2 freq positit - 1 freq pzdto - 1 freq |
PASTED |
| Time to execute Levenshtein function - 0.232898 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.376760 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.034139 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.042376 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.000918 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. |