| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lclat (0) - 1 freq clat (1) - 6 freq caat (2) - 9 freq clap (2) - 56 freq clot (2) - 1 freq cla (2) - 1 freq €˜lat (2) - 3 freq clam (2) - 10 freq lilac (2) - 3 freq 'clart (2) - 1 freq blat (2) - 37 freq inlat (2) - 32 freq clan (2) - 56 freq clag (2) - 4 freq sclam (2) - 1 freq sclate (2) - 7 freq lila (2) - 1 freq €œlat (2) - 13 freq clatt (2) - 5 freq scrat (2) - 31 freq cat (2) - 569 freq clak (2) - 2 freq clats (2) - 1 freq claw (2) - 27 freq cleat (2) - 1 freq |
lclat (0) - 1 freq clat (2) - 6 freq sclate (3) - 7 freq lilt (3) - 22 freq lclq (3) - 1 freq cleat (3) - 1 freq lullt (3) - 1 freq clot (3) - 1 freq ooclet (4) - 1 freq yallt (4) - 1 freq luct (4) - 1 freq locyal (4) - 3 freq lackit (4) - 1 freq colt (4) - 1 freq luckt (4) - 2 freq lockt (4) - 5 freq luckit (4) - 1 freq licet (4) - 1 freq lecht (4) - 3 freq lockit (4) - 33 freq scilt (4) - 2 freq ecaalt (4) - 1 freq luc't (4) - 6 freq local (4) - 413 freq yellt (4) - 4 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 |
LCLAT |
| Time to execute Levenshtein function - 0.285828 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.614270 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.043368 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.072843 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.000893 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. |