Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ypzle (0) - 1 freq pole (2) - 45 freq apple (2) - 32 freq yule (2) - 78 freq aizle (2) - 1 freq pyle (2) - 2 freq aple (2) - 2 freq ple (2) - 1 freq yoze (2) - 1 freq spyle (2) - 17 freq ypke (2) - 1 freq spile (2) - 11 freq pule (2) - 4 freq hazle (2) - 1 freq epple (2) - 13 freq spzl (2) - 1 freq yuile (2) - 1 freq pele (2) - 17 freq yaze (2) - 1 freq yle (2) - 2 freq pile (2) - 110 freq yole (2) - 16 freq yale (2) - 7 freq yable (2) - 7 freq pale (2) - 86 freq |
ypzle (0) - 1 freq spzl (3) - 1 freq epple (3) - 13 freq pele (3) - 17 freq hazle (3) - 1 freq pile (3) - 110 freq pale (3) - 86 freq pule (3) - 4 freq pyle (3) - 2 freq aizle (3) - 1 freq apple (3) - 32 freq aple (3) - 2 freq ple (3) - 1 freq pole (3) - 45 freq pul (4) - 6 freq zly (4) - 1 freq pzs (4) - 1 freq aply (4) - 2 freq toozle (4) - 1 freq ruzla (4) - 1 freq aipple (4) - 102 freq poly (4) - 12 freq ppl (4) - 3 freq pley (4) - 45 freq poll (4) - 42 freq |
SoundEx code - Y124 ypzle - 1 freq yfjial - 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 |
YPZLE |
Time to execute Levenshtein function - 0.204178 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.352886 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.029042 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.042468 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.000838 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. |