| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| puzzled (0) - 35 freq guzzled (1) - 2 freq puzzle (1) - 21 freq puzzles (1) - 3 freq nuzzled (1) - 1 freq puzzlet (1) - 3 freq puzzler (1) - 1 freq puzzl't (2) - 1 freq nuzzle (2) - 2 freq muzzed (2) - 1 freq pulled (2) - 167 freq muzzle (2) - 7 freq puzzlin (2) - 6 freq buzzle (2) - 1 freq guzzle (2) - 4 freq fizzled (2) - 3 freq mizzled (2) - 1 freq puggled (2) - 21 freq puddled (2) - 2 freq puzzlt (2) - 6 freq puled (2) - 6 freq dazzled (2) - 2 freq purfled (2) - 1 freq sozzled (2) - 2 freq buzzed (2) - 1 freq |
puzzled (0) - 35 freq puzzler (2) - 1 freq guzzled (2) - 2 freq nuzzled (2) - 1 freq puzzlet (2) - 3 freq puzzle (2) - 21 freq puzzles (2) - 3 freq sozzled (3) - 2 freq puzzlin (3) - 6 freq fizzled (3) - 3 freq puzzlan (3) - 3 freq puzzlit (3) - 1 freq puzzlt (3) - 6 freq dazzled (3) - 2 freq mizzled (3) - 1 freq purfled (4) - 1 freq nuzzied (4) - 1 freq puled (4) - 6 freq purled (4) - 1 freq buzzed (4) - 1 freq puzzelt (4) - 11 freq muzzed (4) - 1 freq nuzzle (4) - 2 freq puzzl't (4) - 1 freq pulled (4) - 167 freq |
SoundEx code - P243 pousle't - 1 freq pauchled - 12 freq pochled - 3 freq puzzlt - 6 freq puggl't - 1 freq puzzlit - 1 freq puggelt - 2 freq pauchelt - 2 freq puzzled - 35 freq pickled - 10 freq puggled - 21 freq packload - 1 freq piggledy - 1 freq pochlit - 1 freq puzzelt - 11 freq peculators - 1 freq pickult - 4 freq peuchled - 1 freq pochelt - 1 freq pickelt - 3 freq pickl't - 1 freq pauchilt - 1 freq pikkilt - 1 freq pugglit - 1 freq pixelation - 1 freq pixellation - 2 freq puzzl't - 1 freq puzzlet - 3 freq p-celtic - 3 freq piggilty - 1 freq psalter - 1 freq pglet - 5 freq pksltspvqo - 1 freq |
MetaPhone code - PSLT pousle't - 1 freq puzzlt - 6 freq puzzlit - 1 freq puzzled - 35 freq puzzelt - 11 freq puzzl't - 1 freq puzzlet - 3 freq |
PUZZLED |
| Time to execute Levenshtein function - 0.187572 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.364584 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.027264 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.040535 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.000839 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. |