| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| penal (0) - 5 freq peal (1) - 3 freq petal (1) - 10 freq pedal (1) - 4 freq penel (1) - 106 freq penalty (2) - 28 freq peak (2) - 24 freq seal (2) - 31 freq spinal (2) - 3 freq vernal (2) - 3 freq deval (2) - 4 freq penman (2) - 1 freq veal (2) - 2 freq panel (2) - 29 freq pents (2) - 5 freq beal (2) - 3 freq regal (2) - 2 freq teal (2) - 2 freq heal (2) - 27 freq bengal (2) - 2 freq penim (2) - 1 freq legal (2) - 84 freq mental (2) - 118 freq €™nal (2) - 1 freq peat (2) - 59 freq |
penal (0) - 5 freq penel (1) - 106 freq panel (2) - 29 freq panoal (2) - 1 freq epinal (2) - 1 freq peal (2) - 3 freq petal (2) - 10 freq pedal (2) - 4 freq pen' (3) - 1 freq penud (3) - 1 freq peyan (3) - 1 freq pewl (3) - 3 freq pecl (3) - 1 freq final (3) - 162 freq nal (3) - 1 freq poal (3) - 1 freq penels (3) - 7 freq wenl (3) - 1 freq penga (3) - 4 freq pent (3) - 39 freq pencil (3) - 41 freq canal (3) - 27 freq paal (3) - 2 freq neal (3) - 1 freq peril (3) - 7 freq |
SoundEx code - P540 pummel - 4 freq panel - 29 freq penal - 5 freq pamela - 1 freq phanuel - 2 freq pomleywee - 1 freq penel - 106 freq panoal - 1 freq pommel - 1 freq poneil - 3 freq pennywell - 1 freq |
MetaPhone code - PNL panel - 29 freq penal - 5 freq penel - 106 freq panoal - 1 freq poneil - 3 freq |
PENAL |
| Time to execute Levenshtein function - 0.250539 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.372586 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.027599 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.037153 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.000952 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. |