| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| penalties (0) - 11 freq penality (3) - 1 freq petties (3) - 1 freq panties (3) - 2 freq loyalties (3) - 3 freq beatties (3) - 1 freq peattie (3) - 5 freq entities (3) - 15 freq patties (3) - 2 freq peattie's (3) - 1 freq perties (3) - 7 freq penalty (3) - 28 freq denties (3) - 2 freq penalised (3) - 3 freq parties (3) - 20 freq realities (3) - 9 freq mealtimes (3) - 2 freq pennies (3) - 23 freq banalities (3) - 1 freq pentins (3) - 13 freq densities (3) - 1 freq legalities (3) - 1 freq nasties (3) - 1 freq royalties (3) - 2 freq praties (3) - 2 freq |
penalties (0) - 11 freq penalty (4) - 28 freq polaties (4) - 1 freq banalities (4) - 1 freq panties (4) - 2 freq penality (4) - 1 freq prelates (5) - 2 freq royalties (5) - 2 freq menties (5) - 1 freq palates (5) - 1 freq praties (5) - 2 freq leilties (5) - 1 freq pelts (5) - 3 freq poltis (5) - 1 freq prelatis (5) - 1 freq pontius (5) - 2 freq penel's (5) - 5 freq penels (5) - 7 freq nasties (5) - 1 freq plates (5) - 58 freq pents (5) - 5 freq felties (5) - 1 freq patties (5) - 2 freq perties (5) - 7 freq legalities (5) - 1 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 - PNLTS penalties - 11 freq |
PENALTIES |
| Time to execute Levenshtein function - 0.184470 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.345077 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.027501 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.037077 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.000819 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. |