| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pocketed (0) - 2 freq picketed (1) - 1 freq rocketed (1) - 1 freq pocket (2) - 94 freq pokered (2) - 1 freq pocked (2) - 2 freq puckered (2) - 3 freq pockets (2) - 22 freq yocked (3) - 1 freq mocket (3) - 2 freq bickered (3) - 1 freq rockeen (3) - 1 freq pooered (3) - 3 freq hochered (3) - 1 freq rocked (3) - 6 freq cockerel (3) - 5 freq pyochered (3) - 3 freq pickled (3) - 10 freq rocketin (3) - 1 freq locked (3) - 48 freq pointed (3) - 42 freq located (3) - 5 freq pucked (3) - 1 freq poakets (3) - 1 freq poackets (3) - 8 freq |
pocketed (0) - 2 freq picketed (1) - 1 freq rocketed (2) - 1 freq puckered (3) - 3 freq pockets (3) - 22 freq pocked (3) - 2 freq pocket (3) - 94 freq pickets (4) - 3 freq pickied (4) - 1 freq picket (4) - 24 freq pucked (4) - 1 freq picked (4) - 189 freq packed (4) - 59 freq packets (4) - 20 freq packet (4) - 62 freq poacket (4) - 37 freq pecked (4) - 3 freq poackets (4) - 8 freq pockit (4) - 1 freq pokered (4) - 1 freq packaged (4) - 2 freq pickled (4) - 10 freq socket (5) - 4 freq pouked (5) - 1 freq sockets (5) - 8 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 - PKTT pocketed - 2 freq pactit - 3 freq picketed - 1 freq |
POCKETED |
| Time to execute Levenshtein function - 0.225077 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.386996 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.028922 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.037801 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.000960 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. |