| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| locals (0) - 39 freq local (1) - 413 freq lokals (1) - 1 freq locale (1) - 1 freq locals' (1) - 1 freq locails (1) - 2 freq lockis (2) - 1 freq lochs (2) - 32 freq lochalsh (2) - 1 freq locyal (2) - 3 freq coals (2) - 18 freq modals (2) - 4 freq morals (2) - 10 freq lols (2) - 2 freq loco's (2) - 1 freq loass (2) - 19 freq socials (2) - 3 freq decals (2) - 1 freq goals (2) - 51 freq locail (2) - 44 freq luca's (2) - 1 freq lolls (2) - 2 freq vocal (2) - 10 freq loas (2) - 2 freq soals (2) - 1 freq |
locals (0) - 39 freq locails (1) - 2 freq locale (2) - 1 freq locals' (2) - 1 freq local (2) - 413 freq lokals (2) - 1 freq luca's (3) - 1 freq lzals (3) - 1 freq lolls (3) - 2 freq locail (3) - 44 freq localism (3) - 1 freq locus (3) - 3 freq socials (3) - 3 freq locks (3) - 38 freq locally (3) - 16 freq lucas (3) - 2 freq decals (3) - 1 freq coals (3) - 18 freq locyal (3) - 3 freq lochs (3) - 32 freq lockis (3) - 1 freq lols (3) - 2 freq loco's (3) - 1 freq lucks (4) - 4 freq lacers (4) - 1 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 - LKLS locals - 39 freq locals' - 1 freq legless - 3 freq locails - 2 freq luckless - 2 freq lokals - 1 freq |
LOCALS local - 413 freq locals - 39 freq locales - freq locale - 1 freq |
| Time to execute Levenshtein function - 0.223882 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.379390 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.028190 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.037173 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.001248 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. |