Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
puzzelt (0) - 11 freq puzzlt (1) - 6 freq pummelt (2) - 1 freq puzzl't (2) - 1 freq puzzlet (2) - 3 freq wuzzent (2) - 3 freq puzzle (2) - 21 freq puggelt (2) - 2 freq mizzelt (2) - 1 freq puzzlit (2) - 1 freq touzelt (3) - 1 freq russelt (3) - 1 freq mizzert (3) - 1 freq purely (3) - 16 freq pult (3) - 25 freq jumbelt (3) - 1 freq hizzel (3) - 1 freq puzzles (3) - 3 freq wurzels (3) - 1 freq rumpelt (3) - 1 freq pullt (3) - 34 freq fuddelt (3) - 1 freq puzzian (3) - 1 freq guzzle (3) - 4 freq huckelt (3) - 1 freq |
puzzelt (0) - 11 freq puzzlt (1) - 6 freq puzzlet (2) - 3 freq puzzlit (2) - 1 freq puzzle (3) - 21 freq puzzl't (3) - 1 freq mizzelt (3) - 1 freq puzzles (4) - 3 freq puzzlan (4) - 3 freq puzzler (4) - 1 freq puzzled (4) - 35 freq puzzlin (4) - 6 freq pummelt (4) - 1 freq puggelt (4) - 2 freq wuzzent (4) - 3 freq pizzens (5) - 1 freq pelt (5) - 11 freq gizzent (5) - 8 freq puult (5) - 4 freq rizzert (5) - 1 freq pochelt (5) - 1 freq wizzent (5) - 5 freq peelt (5) - 1 freq pickelt (5) - 3 freq buzzle (5) - 1 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 |
PUZZELT |
Time to execute Levenshtein function - 0.213107 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.334565 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.027066 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.037845 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.000844 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. |