| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| normalised (0) - 1 freq normalise (1) - 4 freq normalisin (2) - 1 freq normal-sized (3) - 1 freq moralise (3) - 1 freq 'organised (3) - 1 freq localised (3) - 8 freq normality (3) - 9 freq normative (3) - 1 freq socialised (3) - 1 freq realised (3) - 167 freq organised (3) - 35 freq unorganised (3) - 1 freq polarised (4) - 1 freq normans-' (4) - 5 freq realise (4) - 119 freq idealised (4) - 1 freq serialise (4) - 1 freq raised (4) - 164 freq normandie (4) - 1 freq generalised (4) - 1 freq organiser (4) - 1 freq summarised (4) - 2 freq nomadism (4) - 1 freq comprised (4) - 8 freq |
normalised (0) - 1 freq normalise (2) - 4 freq normalisin (3) - 1 freq normality (5) - 9 freq caramelised (5) - 1 freq unorganised (5) - 1 freq realised (5) - 167 freq normal-sized (5) - 1 freq neutralised (6) - 1 freq paralysed (6) - 13 freq surmised (6) - 3 freq hermonised (6) - 1 freq brutalised (6) - 1 freq normalÂ’ (6) - 1 freq unfinalised (6) - 1 freq raelised (6) - 3 freq normal (6) - 133 freq generalised (6) - 1 freq normans (6) - 3 freq anomalies (6) - 2 freq normally (6) - 56 freq socialised (6) - 1 freq organised (6) - 35 freq localised (6) - 8 freq 'organised (6) - 1 freq |
SoundEx code - N654 normally - 56 freq normal - 133 freq noarmal - 1 freq normality - 9 freq normal-sized - 1 freq 'normal' - 2 freq 'normally' - 2 freq normalise - 4 freq normalisation - 2 freq €˜normalisation - 1 freq normalisin - 1 freq normalised - 1 freq normalÂ’ - 1 freq ‘normal - 1 freq |
MetaPhone code - NRMLST normalised - 1 freq |
NORMALISED |
| Time to execute Levenshtein function - 0.217849 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.383350 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.027525 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.049218 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.000911 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. |