| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| localised (0) - 8 freq vocalized (2) - 1 freq localism (2) - 1 freq socialised (2) - 1 freq globalised (2) - 3 freq finalised (3) - 2 freq moralise (3) - 1 freq normalised (3) - 1 freq poalished (3) - 1 freq realised (3) - 167 freq socialise (3) - 9 freq locale (3) - 1 freq polarised (3) - 1 freq loyalists (3) - 2 freq loyalism (3) - 2 freq penalised (3) - 3 freq locals' (3) - 1 freq mobilised (3) - 1 freq accaised (3) - 1 freq locals (3) - 39 freq localitie (3) - 1 freq loyalist (3) - 9 freq idealised (3) - 1 freq located (3) - 5 freq locality (3) - 3 freq |
localised (0) - 8 freq socialised (3) - 1 freq localism (3) - 1 freq locals' (4) - 1 freq vocalized (4) - 1 freq locals (4) - 39 freq globalised (4) - 3 freq located (5) - 5 freq locality (5) - 3 freq idealised (5) - 1 freq loyalist (5) - 9 freq vocalism (5) - 1 freq cloased (5) - 1 freq locails (5) - 2 freq clased (5) - 2 freq closed (5) - 126 freq localitie (5) - 1 freq enclosed (5) - 5 freq lochside (5) - 10 freq claised (5) - 1 freq licensed (5) - 4 freq socialise (5) - 9 freq locale (5) - 1 freq accaised (5) - 1 freq finalised (5) - 2 freq |
SoundEx code - L242 locals - 39 freq locals' - 1 freq lochalsh - 1 freq laich-liggin - 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 - LKLST localised - 8 freq |
LOCALISED |
| Time to execute Levenshtein function - 0.203095 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.377036 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.027593 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.037176 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.000982 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. |