| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pleyferes (0) - 1 freq pleyers (2) - 7 freq pley-fere (2) - 1 freq pleesures (3) - 3 freq pleutered (3) - 1 freq peffers (3) - 2 freq peypers (3) - 5 freq pleyer (3) - 2 freq pleisures (3) - 4 freq plytered (3) - 2 freq player's (3) - 1 freq fleytered (3) - 1 freq pletforms (3) - 1 freq pleasures (3) - 11 freq players (3) - 152 freq pleeeees (3) - 1 freq pleitered (3) - 1 freq prefers (3) - 3 freq lyfienes (4) - 1 freq pleepses (4) - 1 freq peiters (4) - 1 freq slevers (4) - 2 freq puffers (4) - 1 freq ledders (4) - 2 freq referees (4) - 2 freq |
pleyferes (0) - 1 freq pleyers (3) - 7 freq pleasures (4) - 11 freq prefers (4) - 3 freq pleisures (4) - 4 freq players (4) - 152 freq pley-fere (4) - 1 freq peffers (4) - 2 freq pleesures (4) - 3 freq playfair's (5) - 2 freq pleyer (5) - 2 freq plytered (5) - 2 freq pelters (5) - 9 freq puffers (5) - 1 freq pleisurs (5) - 1 freq plooters (5) - 2 freq pliers (5) - 2 freq peypers (5) - 5 freq peelers (5) - 7 freq player's (5) - 1 freq pletforms (5) - 1 freq pleutered (5) - 1 freq pleeeees (5) - 1 freq plouters (5) - 1 freq pleitered (5) - 1 freq |
SoundEx code - P416 palaver - 10 freq pulverisin - 1 freq pilaaver - 1 freq palfrey - 6 freq playpark - 1 freq plover - 9 freq palaiver - 2 freq pley-fere - 1 freq pulverise - 1 freq pluffert - 2 freq playfair - 20 freq playfair's - 2 freq pullover - 1 freq pleyferes - 1 freq plavver - 2 freq €˜pulverised - 1 freq pluffer - 7 freq pulverised - 1 freq polvara - 2 freq paulbernaluk - 2 freq pluperfect- - 1 freq philipbrannan - 1 freq |
MetaPhone code - PLFRS pulverise - 1 freq playfair's - 2 freq pleyferes - 1 freq |
PLEYFERES |
| Time to execute Levenshtein function - 0.331868 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.599507 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.064185 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.040405 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.005229 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. |