| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pselbs (0) - 10 freq psalms (2) - 17 freq plebs (2) - 5 freq skelbs (2) - 1 freq selfs (2) - 3 freq sells (2) - 15 freq peels (2) - 30 freq serbs (2) - 2 freq pelts (2) - 3 freq phelps (2) - 23 freq sels (2) - 7 freq penel's (3) - 5 freq delfs (3) - 1 freq stells (3) - 4 freq pleeps (3) - 2 freq seals (3) - 22 freq elba (3) - 15 freq peats (3) - 49 freq sals (3) - 1 freq reels (3) - 20 freq prelims (3) - 2 freq spells (3) - 21 freq heles (3) - 1 freq pleens (3) - 3 freq taels (3) - 2 freq |
pselbs (0) - 10 freq plebs (3) - 5 freq psalms (3) - 17 freq plebes (4) - 1 freq slobs (4) - 1 freq slebs (4) - 1 freq phelps (4) - 23 freq slabs (4) - 18 freq sels (4) - 7 freq pelts (4) - 3 freq skelbs (4) - 1 freq sells (4) - 15 freq selfs (4) - 3 freq peels (4) - 30 freq serbs (4) - 2 freq plexus (5) - 2 freq penels (5) - 7 freq sills (5) - 1 freq peelers (5) - 7 freq plus (5) - 69 freq puuls (5) - 1 freq peelins (5) - 4 freq pails (5) - 14 freq pleb (5) - 4 freq upsets (5) - 2 freq |
SoundEx code - P241 peace-lovin - 1 freq peace-lovan - 1 freq pixel-fog - 1 freq packwolf - 1 freq pselbs - 10 freq pklfqfkzs - 1 freq |
MetaPhone code - PSLBS pselbs - 10 freq |
PSELBS |
| Time to execute Levenshtein function - 0.226059 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.394543 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.038681 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.038225 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.000793 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. |