| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| puzzle (0) - 21 freq puzzled (1) - 35 freq muzzle (1) - 7 freq puzzlet (1) - 3 freq puzzler (1) - 1 freq guzzle (1) - 4 freq nuzzle (1) - 2 freq puzzles (1) - 3 freq puzzlt (1) - 6 freq buzzle (1) - 1 freq puzzl't (2) - 1 freq puzzlin (2) - 6 freq puekle (2) - 1 freq puckle (2) - 314 freq hizzle (2) - 3 freq puddle (2) - 24 freq i'puzzle (2) - 1 freq pule (2) - 4 freq puzzlan (2) - 3 freq puzzlit (2) - 1 freq sizzle (2) - 1 freq purple (2) - 98 freq fizzle (2) - 1 freq puzzelt (2) - 11 freq mizzle (2) - 8 freq |
puzzle (0) - 21 freq nuzzle (2) - 2 freq puzzlt (2) - 6 freq buzzle (2) - 1 freq guzzle (2) - 4 freq puzzles (2) - 3 freq puzzled (2) - 35 freq puzzler (2) - 1 freq muzzle (2) - 7 freq puzzlet (2) - 3 freq puzzlit (3) - 1 freq sizzle (3) - 1 freq fizzle (3) - 1 freq mizzle (3) - 8 freq puzzlan (3) - 3 freq puzzelt (3) - 11 freq hizzle (3) - 3 freq i'puzzle (3) - 1 freq puzzlin (3) - 6 freq puzziin (4) - 1 freq pizza (4) - 35 freq pizzas (4) - 6 freq mizzly (4) - 1 freq pizzen (4) - 2 freq zzl (4) - 1 freq |
SoundEx code - P240 puckle - 314 freq pauchle - 20 freq puzzle - 21 freq pockle - 1 freq puggle - 1 freq paisley - 61 freq pucklie - 35 freq pecl - 1 freq pickle - 30 freq pukkul - 5 freq pasquale - 3 freq poochle - 2 freq pascal - 1 freq peecial - 1 freq pig'll - 1 freq pukkil - 5 freq pickloo - 1 freq pawkle - 1 freq pawkily - 2 freq piously - 3 freq paisly - 1 freq pixcel - 2 freq pikkil - 2 freq 'paisley - 1 freq pukklie - 1 freq pochil - 1 freq paisely - 2 freq puekle - 1 freq pawkiely - 1 freq puckly - 12 freq pwzcl - 1 freq pgl - 1 freq pskl - 1 freq packle - 1 freq pbzl - 1 freq pcly - 1 freq phacelia - 1 freq |
MetaPhone code - PSL puzzle - 21 freq paisley - 61 freq piously - 3 freq paisly - 1 freq 'paisley - 1 freq paisely - 2 freq ypzle - 1 freq |
PUZZLE |
| Time to execute Levenshtein function - 0.333583 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.684511 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.027246 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.093465 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.000852 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. |