| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| localisation (0) - 4 freq globalisation (2) - 8 freq pluralisation (3) - 1 freq realisation (3) - 21 freq normalisation (3) - 2 freq obligation (4) - 6 freq ogranisation (4) - 1 freq complication (4) - 2 freq civilisation (4) - 9 freq validation (4) - 2 freq specialisation (4) - 1 freq colonisation (4) - 1 freq cohabitation (4) - 1 freq location (4) - 35 freq inclination (4) - 6 freq decimalisation (4) - 1 freq localitie (4) - 1 freq lamination (4) - 1 freq retaliation (4) - 2 freq facilitation (4) - 3 freq organisation (4) - 28 freq urbanisation (4) - 1 freq pollination (4) - 1 freq coalition (4) - 8 freq realisations (4) - 2 freq |
localisation (0) - 4 freq globalisation (4) - 8 freq realisation (5) - 21 freq pluralisation (5) - 1 freq inclination (6) - 6 freq location (6) - 35 freq coalition (6) - 8 freq colonisation (6) - 1 freq facilitation (6) - 3 freq localitie (6) - 1 freq decimalisation (6) - 1 freq civilisation (6) - 9 freq specialisation (6) - 1 freq normalisation (6) - 2 freq ceivilisation (7) - 2 freq houliston (7) - 2 freq socialisan (7) - 1 freq localloon (7) - 1 freq declaration (7) - 69 freq accusation (7) - 8 freq alsatian (7) - 2 freq caistin (7) - 1 freq calcultion (7) - 1 freq reclamation (7) - 5 freq acceleration (7) - 1 freq |
SoundEx code - L242 locals - 39 freq locals' - 1 freq lookalike - 2 freq localised - 8 freq localism - 1 freq lookalikie - 1 freq look-alikes - 1 freq lugholes - 1 freq legless - 3 freq locails - 2 freq luckless - 2 freq lauch-lauchin - 1 freq less-weil-kent - 1 freq lassie-like - 1 freq lowe-clok - 1 freq localspace - 1 freq localisation - 4 freq luik-alike - 1 freq lokals - 1 freq lzals - 1 freq lclq - 1 freq lqlg - 1 freq leakylike - 1 freq ljeeulgf - 1 freq |
MetaPhone code - LKLSXN localisation - 4 freq |
LOCALISATION |
| Time to execute Levenshtein function - 0.261115 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.617236 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.037054 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.042405 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.003229 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. |