| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| peeler (0) - 3 freq peelers (1) - 7 freq peever (1) - 1 freq peeled (1) - 17 freq meeler (1) - 1 freq pler (2) - 1 freq heller (2) - 3 freq peelit (2) - 1 freq seeker (2) - 2 freq peyper (2) - 1 freq spieler (2) - 1 freq wheeler (2) - 4 freq pelter (2) - 1 freq peely (2) - 18 freq speeder (2) - 16 freq beemer (2) - 2 freq healer (2) - 1 freq weeer (2) - 2 freq geller (2) - 1 freq deener (2) - 3 freq keeled (2) - 5 freq feller (2) - 1 freq jeeled (2) - 4 freq heeled (2) - 1 freq seller (2) - 11 freq |
peeler (0) - 3 freq pleyer (2) - 2 freq meeler (2) - 1 freq pler (2) - 1 freq peeled (2) - 17 freq peelers (2) - 7 freq peever (2) - 1 freq peter (3) - 148 freq polar (3) - 24 freq beyler (3) - 1 freq efler (3) - 1 freq peeree (3) - 2 freq pele (3) - 17 freq dueler (3) - 1 freq peleg (3) - 3 freq peel (3) - 41 freq raeler (3) - 1 freq pleyar (3) - 1 freq pielet (3) - 2 freq pedlar (3) - 3 freq peer (3) - 196 freq peeoor (3) - 1 freq peelin (3) - 5 freq dealer (3) - 15 freq peiper (3) - 1 freq |
SoundEx code - P460 pillar - 15 freq player - 116 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 |
PEELER |
| Time to execute Levenshtein function - 0.253381 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.585322 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.027842 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.072066 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.001005 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. |