Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
peelers (0) - 7 freq peepers (1) - 6 freq peeler (1) - 3 freq meelers (1) - 1 freq peevers (1) - 1 freq feelers (1) - 1 freq feeders (2) - 1 freq pedlars (2) - 1 freq spellers (2) - 1 freq pelters (2) - 9 freq peers (2) - 26 freq wheelers (2) - 1 freq paepers (2) - 2 freq reevlers (2) - 4 freq peebles (2) - 8 freq pellets (2) - 5 freq deeners (2) - 1 freq peters (2) - 4 freq eilers (2) - 1 freq pillers (2) - 2 freq reeler's (2) - 1 freq peeled (2) - 17 freq peeces (2) - 1 freq penters (2) - 2 freq keepers (2) - 16 freq |
peelers (0) - 7 freq feelers (2) - 1 freq peevers (2) - 1 freq pleyers (2) - 7 freq meelers (2) - 1 freq peepers (2) - 6 freq peeler (2) - 3 freq peters (3) - 4 freq peelins (3) - 4 freq eilers (3) - 1 freq pliers (3) - 2 freq players (3) - 152 freq peiters (3) - 1 freq pillers (3) - 2 freq paepers (3) - 2 freq peels (3) - 30 freq feelurs (3) - 1 freq pedlars (3) - 1 freq peers (3) - 26 freq pelters (3) - 9 freq peypers (3) - 5 freq dealers (3) - 10 freq teylers (3) - 1 freq piers (4) - 7 freq pouers (4) - 34 freq |
SoundEx code - P462 players - 152 freq pleywrights - 6 freq pleywright - 2 freq playwricht - 4 freq pillars - 12 freq playwright - 3 freq playwrights - 3 freq pillers - 2 freq peelers - 7 freq pleyers - 7 freq pliers - 2 freq polaris - 3 freq playwrichts - 6 freq player's - 1 freq polarisin - 1 freq pluricentric - 1 freq paullawriegolf - 4 freq polarised - 1 freq paulharris - 3 freq philharrison - 1 freq |
MetaPhone code - PLRS pillars - 12 freq pillers - 2 freq peelers - 7 freq pliers - 2 freq polaris - 3 freq |
PEELERS |
Time to execute Levenshtein function - 0.181752 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.334216 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.027466 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.037247 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.000874 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. |