| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| generalised (0) - 1 freq centralised (2) - 5 freq neutralised (3) - 1 freq centralized (3) - 1 freq generated (3) - 2 freq generatien (3) - 2 freq generals' (3) - 1 freq generals (3) - 2 freq penalised (3) - 3 freq energised (3) - 3 freq generatioun (4) - 1 freq eneaise (4) - 1 freq reealise (4) - 1 freq idealised (4) - 1 freq generations (4) - 112 freq generatit (4) - 2 freq energises (4) - 1 freq materialised (4) - 1 freq general (4) - 200 freq ceevilised (4) - 6 freq generate (4) - 4 freq exercised (4) - 5 freq normalised (4) - 1 freq generally (4) - 56 freq general-like (4) - 1 freq |
generalised (0) - 1 freq generals (4) - 2 freq generals' (4) - 1 freq centralised (4) - 5 freq energised (5) - 3 freq neutralised (5) - 1 freq penalised (5) - 3 freq generated (5) - 2 freq vandalised (6) - 2 freq materialised (6) - 1 freq general (6) - 200 freq generally (6) - 56 freq generall (6) - 1 freq globalised (6) - 3 freq realised (6) - 167 freq generatien (6) - 2 freq centralized (6) - 1 freq normalised (6) - 1 freq finalised (6) - 2 freq gnarled (6) - 4 freq unnerlined (6) - 2 freq greased (7) - 3 freq enclosed (7) - 5 freq minerals (7) - 4 freq generously (7) - 1 freq |
SoundEx code - G564 general - 200 freq gomeril - 15 freq generally - 56 freq gomerils - 5 freq generall - 1 freq gomerels - 2 freq gnarled - 4 freq gomrell - 1 freq generals - 2 freq generals' - 1 freq gnurlit - 3 freq gomerals - 1 freq gomoral - 1 freq géneral - 1 freq gineral - 3 freq genral - 4 freq €˜general - 2 freq general-education - 1 freq general-like - 1 freq 'general' - 1 freq genèral - 2 freq €”generally - 1 freq generalelection - 1 freq gomeral - 1 freq generalisations - 1 freq generalised - 1 freq |
MetaPhone code - JNRLST generalised - 1 freq |
GENERALISED |
| Time to execute Levenshtein function - 0.376421 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.708220 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.088161 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.098971 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.001189 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. |