Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
playful (0) - 5 freq playfully (2) - 4 freq lawful (2) - 3 freq plaefil (2) - 1 freq playyy (3) - 1 freq layout (3) - 1 freq playeen (3) - 1 freq laafu' (3) - 1 freq pitiful (3) - 3 freq play'd (3) - 1 freq playgrun (3) - 17 freq caybul (3) - 1 freq plaque (3) - 19 freq playen (3) - 2 freq peaceful (3) - 22 freq playfair (3) - 20 freq plague (3) - 25 freq play (3) - 748 freq player (3) - 131 freq tearful (3) - 2 freq playin' (3) - 7 freq fearful (3) - 10 freq playable (3) - 4 freq playboy (3) - 1 freq playhous (3) - 4 freq |
playful (0) - 5 freq plaefil (2) - 1 freq playfully (3) - 4 freq plul (4) - 1 freq painful (4) - 18 freq playfair (4) - 20 freq gleeful (4) - 2 freq playable (4) - 4 freq peaceful (4) - 22 freq pitiful (4) - 3 freq lawful (4) - 3 freq painfil (5) - 1 freq planun (5) - 1 freq playsed (5) - 1 freq pfl (5) - 1 freq players (5) - 152 freq playins (5) - 1 freq playin (5) - 347 freq earful (5) - 2 freq joyful (5) - 2 freq payl (5) - 1 freq played (5) - 256 freq laafu (5) - 9 freq platefu (5) - 4 freq play's (5) - 2 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 - PLFL playful - 5 freq plughole - 2 freq playfully - 4 freq plaefil - 1 freq |
PLAYFUL |
Time to execute Levenshtein function - 0.232121 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.381785 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.027749 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.042818 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.000898 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. |