| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pler (0) - 1 freq cler (1) - 1 freq puer (1) - 1 freq plet (1) - 4 freq plee (1) - 1 freq plea (1) - 20 freq pleg (1) - 2 freq plew (1) - 1 freq pled (1) - 3 freq ler (1) - 1 freq pleb (1) - 4 freq paer (1) - 3 freq pley (1) - 45 freq plec (1) - 1 freq plen (1) - 109 freq wler (1) - 1 freq poer (1) - 1 freq pier (1) - 38 freq ple (1) - 1 freq per (1) - 70 freq peer (1) - 199 freq pye (2) - 52 freq pex (2) - 1 freq maer (2) - 3 freq le (2) - 53 freq |
pler (0) - 1 freq ple (2) - 1 freq peer (2) - 199 freq pier (2) - 38 freq poer (2) - 1 freq wler (2) - 1 freq polar (2) - 24 freq plen (2) - 109 freq pleyar (2) - 1 freq pleyer (2) - 2 freq peeler (2) - 3 freq pleure (2) - 1 freq player (2) - 131 freq per (2) - 70 freq plec (2) - 1 freq pleg (2) - 2 freq plee (2) - 1 freq plet (2) - 4 freq cler (2) - 1 freq puer (2) - 1 freq plew (2) - 1 freq plea (2) - 20 freq ler (2) - 1 freq pleb (2) - 4 freq pled (2) - 3 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 - PLR pillar - 15 freq pallor - 4 freq polar - 24 freq puller - 1 freq powlar - 1 freq pullar - 5 freq peeler - 3 freq poller - 1 freq pleure - 1 freq pler - 1 freq |
PLER |
| Time to execute Levenshtein function - 0.238782 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.384429 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.029558 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.039948 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.001046 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. |