| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| emptypocket (0) - 1 freq skyrocket (5) - 2 freq weskit-pocket (5) - 2 freq paypoke (5) - 1 freq 'pocket (5) - 1 freq pocket (5) - 94 freq peypokes (5) - 1 freq emptiet (5) - 1 freq mocket (5) - 2 freq sprocket (5) - 1 freq impoleet (6) - 1 freq spicket (6) - 1 freq pyockie (6) - 4 freq emsket (6) - 1 freq yocked (6) - 1 freq placket (6) - 1 freq po'ket (6) - 1 freq poket (6) - 4 freq temptet (6) - 1 freq empty-handed (6) - 1 freq empower (6) - 2 freq eattocks (6) - 1 freq expeckit (6) - 31 freq employee (6) - 3 freq guttypole (6) - 1 freq |
emptypocket (0) - 1 freq pocket (8) - 94 freq 'pocket (8) - 1 freq emptiet (8) - 1 freq sprocket (8) - 1 freq mocket (8) - 2 freq packet (9) - 62 freq thacket (9) - 1 freq poacket (9) - 37 freq picket (9) - 24 freq tacket (9) - 1 freq wage-packet (9) - 1 freq fag-packet (9) - 1 freq stockit (9) - 4 freq emptit (9) - 1 freq thicket (9) - 1 freq pockit (9) - 1 freq humpybackit (9) - 1 freq ppokit (9) - 1 freq expeckit (9) - 31 freq mockit (9) - 11 freq ticket (9) - 172 freq tricket (9) - 9 freq peypokes (9) - 1 freq placket (9) - 1 freq |
SoundEx code - E513 empty - 213 freq embdy - 15 freq empied - 3 freq emptyin - 6 freq empathy - 8 freq empties - 6 freq emptied - 20 freq embittert - 1 freq emptiness - 8 freq eenveytet - 1 freq embattled - 1 freq embedded - 4 freq embodies - 2 freq envied - 3 freq empathise - 4 freq embeddit - 4 freq emphatic - 4 freq emptyhaunded - 1 freq empty-handed - 1 freq embeddin' - 2 freq embed - 2 freq emptie - 1 freq empty' - 2 freq 'empty' - 1 freq embitter - 1 freq emptiet - 1 freq embodie - 1 freq embodiment - 2 freq empathetic - 2 freq enubdy - 1 freq embodyin - 1 freq €˜emptiness - 1 freq emphatically - 1 freq embodied - 2 freq embeddin - 1 freq emptit - 1 freq emptypocket - 1 freq |
MetaPhone code - EMPTPKT emptypocket - 1 freq |
EMPTYPOCKET |
| Time to execute Levenshtein function - 0.373671 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.570500 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.033382 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.057689 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.001007 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. |