| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pzzpum (0) - 1 freq paum (3) - 2 freq wnzum (3) - 1 freq dzpm (3) - 1 freq €˜pum (3) - 1 freq €¦pum (3) - 2 freq precum (3) - 1 freq rzmpm (3) - 1 freq ploum (3) - 2 freq podium (3) - 6 freq urzum (3) - 1 freq bizzum (3) - 6 freq poyum (3) - 9 freq pizuw (3) - 1 freq prum (3) - 1 freq paipur (3) - 3 freq pidpu (3) - 1 freq pum (3) - 3 freq possum (3) - 1 freq plum (3) - 15 freq pzz (3) - 1 freq uzziah (4) - 2 freq pup (4) - 37 freq ppgs (4) - 1 freq vellum (4) - 2 freq |
pzzpum (0) - 1 freq pzz (5) - 1 freq rzmpm (5) - 1 freq bizzum (5) - 6 freq dzpm (5) - 1 freq puzziin (6) - 1 freq bizzom (6) - 2 freq puzzles (6) - 3 freq pizz (6) - 1 freq pizzen (6) - 2 freq pizza (6) - 37 freq puzzelt (6) - 11 freq pzaz (6) - 1 freq puzzler (6) - 1 freq mzzipyk (6) - 1 freq bizzim (6) - 1 freq pizzens (6) - 1 freq puzzlet (6) - 3 freq puzzled (6) - 36 freq pizzas (6) - 6 freq puzzle (6) - 21 freq puzzlin (6) - 6 freq puzzlit (6) - 1 freq puzzian (6) - 1 freq poyum (6) - 9 freq |
SoundEx code - P215 pickie-fingirt - 1 freq pigpen - 1 freq pack-pownies - 1 freq peace-of-mind - 1 freq pwjbn - 1 freq pgsvvmqv - 1 freq pcybmehwm - 1 freq pzxpnjguke - 1 freq picsofnewcastle - 1 freq pzzpum - 1 freq |
MetaPhone code - PSPM pzzpum - 1 freq |
PZZPUM |
| Time to execute Levenshtein function - 0.245018 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.375366 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.027943 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.037489 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.000846 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. |