| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lacquert (0) - 1 freq lacquer (1) - 2 freq racquet (2) - 2 freq acquirt (2) - 1 freq acquent (2) - 15 freq layert (3) - 2 freq lachter (3) - 16 freq docquet (3) - 2 freq jacques (3) - 2 freq larbert (3) - 2 freq lappert (3) - 1 freq laddert (3) - 1 freq slachtert (3) - 3 freq lambert (3) - 3 freq banquet (3) - 7 freq acquant (3) - 8 freq parquet (3) - 2 freq conquert (3) - 3 freq aquent (3) - 6 freq lacers (3) - 1 freq acquire (3) - 3 freq lawert (3) - 1 freq lapert (3) - 1 freq jacquel (3) - 3 freq fawkert (4) - 2 freq |
lacquert (0) - 1 freq lacquer (2) - 2 freq acquirt (3) - 1 freq acquent (4) - 15 freq racquet (4) - 2 freq conquert (5) - 3 freq acquant (5) - 8 freq lacers (5) - 1 freq lambert (5) - 3 freq lawert (5) - 1 freq acquire (5) - 3 freq lapert (5) - 1 freq layert (5) - 2 freq docquet (5) - 2 freq lappert (5) - 1 freq larbert (5) - 2 freq laddert (5) - 1 freq lumbert (6) - 7 freq cheert (6) - 1 freq luckiest (6) - 2 freq lockers (6) - 4 freq lawbourt (6) - 1 freq picturt (6) - 2 freq lippert (6) - 1 freq lackit (6) - 1 freq |
SoundEx code - L263 lizard - 32 freq lizard's - 7 freq lucrative - 2 freq lacquert - 1 freq laceratin - 1 freq lizards - 4 freq lazaretto - 1 freq lacerated - 1 freq leisured - 1 freq lug-rattlin - 1 freq lockhart - 4 freq lockhart's - 1 freq laceratit - 1 freq laggered - 2 freq logarithms - 1 freq lgarden - 1 freq luxuriatin - 1 freq lozart - 1 freq |
MetaPhone code - LKKRT lacquert - 1 freq |
LACQUERT |
| Time to execute Levenshtein function - 0.261668 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.427278 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.032976 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.037381 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.000959 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. |