| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| penalty (0) - 28 freq penality (1) - 1 freq penal (2) - 5 freq lealty (2) - 5 freq benarty (2) - 2 freq peaty (2) - 4 freq fealty (2) - 4 freq paltry (3) - 1 freq pedant (3) - 3 freq palt (3) - 1 freq ently (3) - 2 freq tenant (3) - 14 freq mentality (3) - 9 freq penrith (3) - 1 freq petal (3) - 10 freq penny (3) - 130 freq peaky (3) - 1 freq fently (3) - 1 freq peely (3) - 18 freq penann (3) - 1 freq pennants (3) - 1 freq pebbly (3) - 2 freq healt (3) - 11 freq party (3) - 153 freq peasy (3) - 3 freq |
penalty (0) - 28 freq penality (1) - 1 freq penal (3) - 5 freq renault (4) - 2 freq pent (4) - 39 freq pelt (4) - 11 freq pennit (4) - 1 freq openly (4) - 11 freq banality (4) - 1 freq pentit (4) - 44 freq penel (4) - 106 freq ronalt (4) - 32 freq pynty (4) - 1 freq penalties (4) - 11 freq fealty (4) - 4 freq penels (4) - 7 freq peaty (4) - 4 freq benarty (4) - 2 freq lealty (4) - 5 freq palt (4) - 1 freq panty (4) - 1 freq peelt (4) - 1 freq peal (5) - 3 freq pengelly (5) - 3 freq pantit (5) - 2 freq |
SoundEx code - P543 pummelt - 1 freq penality - 1 freq penalty - 28 freq pummelled - 1 freq penalties - 11 freq penalité - 1 freq penultimate - 5 freq pannelled - 1 freq panelled - 2 freq |
MetaPhone code - PNLT penality - 1 freq penalty - 28 freq penalité - 1 freq pannelled - 1 freq panelled - 2 freq |
PENALTY |
| Time to execute Levenshtein function - 0.192327 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.336413 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.027076 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.036947 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.000861 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. |