| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pleyer (0) - 2 freq pleyed (1) - 16 freq player (1) - 131 freq pleyar (1) - 1 freq pleyers (1) - 7 freq pleyit (2) - 2 freq cleyey (2) - 1 freq plene (2) - 1 freq layer (2) - 15 freq pleuter (2) - 1 freq leper (2) - 2 freq peyper (2) - 1 freq peyed (2) - 168 freq paerer (2) - 1 freq elyer (2) - 1 freq pleyt (2) - 1 freq pleyin (2) - 12 freq pleiter (2) - 1 freq peever (2) - 1 freq greyer (2) - 1 freq gleer (2) - 1 freq plewed (2) - 2 freq cleer (2) - 6 freq prefer (2) - 41 freq plater (2) - 1 freq |
pleyer (0) - 2 freq player (1) - 131 freq pleyar (1) - 1 freq peeler (2) - 3 freq iplayer (2) - 5 freq pleyed (2) - 16 freq pler (2) - 1 freq pleyers (2) - 7 freq pleys (3) - 30 freq pley (3) - 45 freq pityer (3) - 1 freq leer (3) - 4 freq plee (3) - 1 freq fleer (3) - 124 freq plover (3) - 9 freq pleep (3) - 3 freq plyter (3) - 3 freq prayer (3) - 96 freq plece (3) - 13 freq peter (3) - 148 freq plees (3) - 6 freq pleurer (3) - 1 freq peer (3) - 199 freq players (3) - 152 freq payer (3) - 1 freq |
SoundEx code - P460 pillar - 15 freq player - 131 freq pallor - 4 freq polar - 24 freq puller - 1 freq pleyer - 2 freq powlar - 1 freq pleyar - 1 freq pullar - 5 freq peeler - 3 freq poller - 1 freq pleure - 1 freq pler - 1 freq |
MetaPhone code - PLYR player - 131 freq pleyer - 2 freq pleyar - 1 freq |
PLEYER |
| Time to execute Levenshtein function - 0.197187 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.367325 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.027862 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.037651 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.000877 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. |