| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| playable (0) - 4 freq payable (1) - 1 freq parable (2) - 54 freq liable (3) - 4 freq paecable (3) - 1 freq bearable (3) - 5 freq plausible (3) - 2 freq playboy (3) - 1 freq probable (3) - 4 freq arable (3) - 8 freq portable (3) - 9 freq relatable (3) - 3 freq playful (3) - 5 freq capable (3) - 25 freq caapable (3) - 1 freq placate (3) - 5 freq playan (3) - 15 freq parables (3) - 9 freq playtime (3) - 24 freq peacably (3) - 1 freq tradable (3) - 1 freq poasible (3) - 1 freq yable (3) - 7 freq playmate (3) - 1 freq palpable (3) - 3 freq |
playable (0) - 4 freq payable (2) - 1 freq parable (3) - 54 freq playful (4) - 5 freq paesable (4) - 1 freq palpable (4) - 3 freq poasible (4) - 1 freq playboy (4) - 1 freq paecable (4) - 1 freq liable (4) - 4 freq peacably (4) - 1 freq plausible (4) - 2 freq peaceable (4) - 2 freq peeble (5) - 1 freq avaelable (5) - 2 freq plural (5) - 56 freq peetiable (5) - 2 freq reliable (5) - 5 freq valuable (5) - 18 freq pebble (5) - 9 freq laybil (5) - 2 freq parabola (5) - 2 freq palatal (5) - 3 freq veluable (5) - 3 freq paeceable (5) - 4 freq |
SoundEx code - P414 playbills - 1 freq plip-plop - 1 freq playful - 5 freq pale-pale - 1 freq playfully - 4 freq plaefil - 1 freq philflanagan - 2 freq philippullman - 1 freq paulpaul - 2 freq playable - 4 freq philipwhale - 1 freq |
MetaPhone code - PLYBL playable - 4 freq |
PLAYABLE |
| Time to execute Levenshtein function - 0.212804 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.373668 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.033183 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.039991 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.000965 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. |