Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
delf-lik (0) - 1 freq leaf-lik (2) - 1 freq dellin (3) - 5 freq self-id (3) - 1 freq snell-lik (3) - 1 freq ill-lik (3) - 1 freq cellik (3) - 1 freq deivilik (3) - 1 freq daft-lik (3) - 2 freq dowf-like (3) - 2 freq deelin (4) - 1 freq nate-lik (4) - 1 freq deilie (4) - 2 freq deciplin (4) - 1 freq mellie (4) - 2 freq douce-lik (4) - 2 freq bellin (4) - 3 freq detdlie (4) - 1 freq bellie (4) - 6 freq slaw-lik (4) - 1 freq hellie (4) - 1 freq deefnin (4) - 1 freq defait (4) - 7 freq direk-lik (4) - 1 freq joco-lik (4) - 3 freq |
delf-lik (0) - 1 freq leaf-lik (3) - 1 freq dowf-like (4) - 2 freq daft-lik (5) - 2 freq deil-lake (5) - 1 freq ill-lik (5) - 1 freq ideal-like (5) - 1 freq bauld-lik (6) - 1 freq cult-like (6) - 1 freq dentie-lik (6) - 1 freq direk-lik (6) - 1 freq dour-like (6) - 1 freq ill-luk (6) - 1 freq daft-like (6) - 9 freq hulk-like (6) - 1 freq ertfu-lik (6) - 1 freq slaw-lik (6) - 1 freq lyfie-lik (6) - 1 freq daftlike (6) - 1 freq dillie-like (6) - 2 freq cellik (6) - 1 freq self-id (6) - 1 freq douce-lik (6) - 2 freq deivilik (6) - 1 freq dellin (6) - 5 freq |
SoundEx code - D414 doleful - 1 freq delf-lik - 1 freq dellbell - 1 freq |
MetaPhone code - TLFLK delf-lik - 1 freq |
DELF-LIK |
Time to execute Levenshtein function - 0.252077 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.609868 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.028335 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.072301 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.000881 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. |