| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| penalty (0) - 28 freq penality (1) - 1 freq realty (2) - 1 freq lealty (2) - 5 freq benarty (2) - 2 freq penal (2) - 5 freq peaty (2) - 4 freq fealty (2) - 4 freq pedal (3) - 6 freq eraly (3) - 1 freq mealy (3) - 5 freq petals (3) - 22 freq peety (3) - 90 freq peals (3) - 2 freq pendant (3) - 1 freq renaults (3) - 1 freq sealt (3) - 2 freq feenally (3) - 1 freq loyalty (3) - 10 freq tenty (3) - 6 freq fynaly (3) - 3 freq pent (3) - 39 freq health (3) - 133 freq natty (3) - 2 freq legality (3) - 2 freq |
penalty (0) - 28 freq penality (1) - 1 freq penal (3) - 5 freq pennit (4) - 1 freq peelt (4) - 1 freq pentit (4) - 44 freq pent (4) - 39 freq penalties (4) - 11 freq palt (4) - 1 freq banality (4) - 1 freq renault (4) - 2 freq pelt (4) - 16 freq penels (4) - 7 freq penel (4) - 106 freq openly (4) - 11 freq pynty (4) - 1 freq panty (4) - 1 freq benarty (4) - 2 freq peaty (4) - 4 freq lealty (4) - 5 freq ronalt (4) - 32 freq realty (4) - 1 freq fealty (4) - 4 freq plenty (5) - 275 freq gealt (5) - 3 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.207892 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.342875 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.027476 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.037727 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.000939 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. |