| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ypzle (0) - 1 freq ypke (2) - 1 freq yable (2) - 7 freq pele (2) - 17 freq pule (2) - 4 freq yuile (2) - 1 freq spzl (2) - 1 freq pole (2) - 45 freq apple (2) - 30 freq ple (2) - 1 freq yaze (2) - 1 freq yule (2) - 79 freq yle (2) - 2 freq epple (2) - 13 freq pile (2) - 113 freq aple (2) - 2 freq pyle (2) - 2 freq yole (2) - 16 freq hazle (2) - 1 freq yale (2) - 7 freq spyle (2) - 17 freq aizle (2) - 1 freq pale (2) - 88 freq spile (2) - 11 freq yoze (2) - 1 freq |
ypzle (0) - 1 freq pile (3) - 113 freq epple (3) - 13 freq aple (3) - 2 freq hazle (3) - 1 freq pale (3) - 88 freq ple (3) - 1 freq pyle (3) - 2 freq aizle (3) - 1 freq spzl (3) - 1 freq pule (3) - 4 freq apple (3) - 30 freq pole (3) - 45 freq pele (3) - 17 freq pll (4) - 5 freq aipple (4) - 102 freq touzle (4) - 1 freq palo (4) - 1 freq epl (4) - 9 freq pbl (4) - 1 freq parle (4) - 1 freq pil (4) - 5 freq azl (4) - 1 freq aply (4) - 2 freq azly (4) - 1 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.246558 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.414456 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.029101 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.042138 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.001213 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. |