| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| penalised (0) - 3 freq finalised (2) - 2 freq realised (2) - 167 freq localised (3) - 8 freq realise (3) - 119 freq pennied (3) - 1 freq prentised (3) - 1 freq personalised (3) - 1 freq praised (3) - 23 freq paralysed (3) - 13 freq paised (3) - 4 freq enlisted (3) - 1 freq poalished (3) - 1 freq penalties (3) - 11 freq centralised (3) - 5 freq realized (3) - 15 freq realiset (3) - 1 freq idealised (3) - 1 freq reealise (3) - 1 freq specialised (3) - 3 freq analysed (3) - 8 freq enclosed (3) - 5 freq vandalised (3) - 2 freq petalled (3) - 1 freq plaised (3) - 37 freq |
penalised (0) - 3 freq finalised (3) - 2 freq pensed (4) - 3 freq analysed (4) - 8 freq paralysed (4) - 13 freq plaised (4) - 37 freq reanalysed (4) - 1 freq realised (4) - 167 freq polarised (5) - 1 freq penels (5) - 7 freq panelled (5) - 2 freq plased (5) - 1 freq petalled (5) - 1 freq generalised (5) - 1 freq paraleesed (5) - 4 freq playsed (5) - 1 freq pleased (5) - 206 freq vandalised (5) - 2 freq penality (5) - 1 freq finalise (5) - 2 freq pleised (5) - 4 freq pedalled (5) - 1 freq praised (5) - 23 freq paised (5) - 4 freq poalished (5) - 1 freq |
SoundEx code - P542 penielheugh - 2 freq pummel's - 1 freq penalised - 3 freq 'painless - 1 freq penniless - 1 freq panels - 15 freq penel's - 5 freq penels - 7 freq phonology - 8 freq phonologie - 1 freq phonological - 4 freq pannells - 1 freq pmills - 1 freq panellists - 1 freq pmmllcryng - 1 freq |
MetaPhone code - PNLST penalised - 3 freq |
PENALISED |
| Time to execute Levenshtein function - 0.238533 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.397608 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.031667 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.038871 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.000909 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. |