| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| postit (0) - 13 freq powtit (1) - 2 freq postie (1) - 24 freq post-it (1) - 1 freq costit (1) - 3 freq positit (1) - 1 freq pottit (1) - 3 freq rostit (1) - 1 freq poutit (1) - 1 freq hostit (1) - 7 freq pastit (1) - 1 freq postin (1) - 21 freq posts (2) - 45 freq pottie (2) - 10 freq vottit (2) - 1 freq rottit (2) - 9 freq jottit (2) - 1 freq poetic (2) - 34 freq foustit (2) - 1 freq poustie (2) - 2 freq boastit (2) - 1 freq hottit (2) - 1 freq partit (2) - 4 freq bootit (2) - 2 freq pintit (2) - 14 freq |
postit (0) - 13 freq positit (1) - 1 freq pastit (1) - 1 freq rostit (2) - 1 freq poutit (2) - 1 freq hostit (2) - 7 freq postin (2) - 21 freq pottit (2) - 3 freq postie (2) - 24 freq powtit (2) - 2 freq costit (2) - 3 freq post-it (2) - 1 freq pastie (3) - 1 freq vestit (3) - 1 freq histit (3) - 1 freq putit (3) - 2 freq postamt (3) - 1 freq foostit (3) - 1 freq pitit (3) - 5 freq poshity (3) - 1 freq rustit (3) - 3 freq pistil (3) - 3 freq passit (3) - 19 freq posty (3) - 1 freq pissit (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 post-identity - 1 freq pig-heiditness - 3 freq picketed - 1 freq post-it - 1 freq posted - 20 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 post-it - 1 freq posted - 20 freq positit - 1 freq pzdto - 1 freq |
POSTIT |
| Time to execute Levenshtein function - 0.394925 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.679928 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.029459 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.091759 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.000811 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. |