| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| locality (0) - 3 freq localism (2) - 1 freq morality (2) - 8 freq locatit (2) - 7 freq legality (2) - 2 freq locally (2) - 16 freq modality (2) - 2 freq loyalty (2) - 10 freq localitie (2) - 1 freq location (3) - 35 freq mobility (3) - 6 freq locale (3) - 1 freq loyalist (3) - 9 freq local (3) - 413 freq royalty (3) - 24 freq equality (3) - 34 freq cavity (3) - 2 freq polity (3) - 4 freq pochlit (3) - 1 freq quaality (3) - 5 freq lockit (3) - 33 freq nobility (3) - 12 freq banality (3) - 1 freq locailly (3) - 1 freq jollity (3) - 2 freq |
locality (0) - 3 freq localitie (2) - 1 freq loyalty (3) - 10 freq locally (3) - 16 freq legality (3) - 2 freq locatit (3) - 7 freq locate (4) - 2 freq lealty (4) - 5 freq lclat (4) - 1 freq locals (4) - 39 freq facility (4) - 9 freq locail (4) - 44 freq locailly (4) - 1 freq locails (4) - 2 freq lockit (4) - 33 freq locale (4) - 1 freq local (4) - 413 freq modality (4) - 2 freq morality (4) - 8 freq localism (4) - 1 freq locyal (5) - 3 freq scailit (5) - 2 freq lackit (5) - 1 freq plurality (5) - 3 freq localised (5) - 8 freq |
SoundEx code - L243 leswalt - 2 freq lochaldh - 1 freq legality - 2 freq likeliheid - 3 freq likelihood - 3 freq locality - 3 freq legalities - 1 freq localitie - 1 freq liklihood - 1 freq ljlittleson - 3 freq lushltd - 1 freq lclat - 1 freq lesliedeans - 1 freq lesleytotten - 1 freq |
MetaPhone code - LKLT legality - 2 freq locality - 3 freq localitie - 1 freq lclat - 1 freq |
LOCALITY |
| Time to execute Levenshtein function - 0.250936 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.397075 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.028211 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.038974 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.000869 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. |