| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| puzzler (0) - 1 freq puzzle (1) - 21 freq puzzlet (1) - 3 freq puzzles (1) - 3 freq puzzled (1) - 35 freq puzzlin (2) - 6 freq guzzlers (2) - 1 freq guzzle (2) - 4 freq muzzle (2) - 7 freq buzzle (2) - 1 freq buzzer (2) - 8 freq puller (2) - 1 freq nuzzled (2) - 1 freq nuzzle (2) - 2 freq puzzlt (2) - 6 freq puzzl't (2) - 1 freq dazzler (2) - 2 freq puzzlan (2) - 3 freq guzzled (2) - 2 freq puzzlit (2) - 1 freq dazler (3) - 2 freq muckler (3) - 10 freq mizzle (3) - 8 freq puer (3) - 1 freq tumbler (3) - 4 freq |
puzzler (0) - 1 freq puzzled (2) - 35 freq puzzles (2) - 3 freq puzzlet (2) - 3 freq puzzle (2) - 21 freq puzzlan (3) - 3 freq puzzlit (3) - 1 freq dazzler (3) - 2 freq puzzlt (3) - 6 freq puzzlin (3) - 6 freq guzzle (4) - 4 freq guzzled (4) - 2 freq puzzelt (4) - 11 freq muzzle (4) - 7 freq buzzle (4) - 1 freq guzzlers (4) - 1 freq puzzl't (4) - 1 freq buzzer (4) - 8 freq nuzzled (4) - 1 freq puller (4) - 1 freq nuzzle (4) - 2 freq mizzer (5) - 4 freq pullar (5) - 5 freq guzzlin (5) - 2 freq poller (5) - 1 freq |
SoundEx code - P246 pauchler - 1 freq peculiarities' - 1 freq peculiarities - 1 freq puzzler - 1 freq peculiar - 7 freq pauchlers - 1 freq peculiarly - 1 freq pauchleris - 1 freq |
MetaPhone code - PSLR puzzler - 1 freq |
PUZZLER |
| Time to execute Levenshtein function - 0.199732 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.350376 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.026825 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.036719 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.000822 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. |