| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| decline (0) - 20 freq declinet (1) - 1 freq declines (1) - 1 freq declin (1) - 1 freq declined (1) - 5 freq declint (1) - 1 freq recline (1) - 2 freq declang (2) - 1 freq devlin (2) - 1 freq deceive (2) - 7 freq feline (2) - 16 freq beeline (2) - 3 freq dealing (2) - 8 freq cline (2) - 4 freq declird (2) - 1 freq delite (2) - 4 freq declir (2) - 1 freq derlin (2) - 1 freq derlins (2) - 1 freq dealins (2) - 5 freq erline (2) - 1 freq dellin (2) - 5 freq desine (2) - 1 freq neckline (2) - 1 freq deelin (2) - 1 freq |
decline (0) - 20 freq declin (1) - 1 freq declan (2) - 35 freq declint (2) - 1 freq recline (2) - 2 freq declinet (2) - 1 freq declined (2) - 5 freq declines (2) - 1 freq adeline (3) - 2 freq dealin (3) - 30 freq decin (3) - 2 freq declare (3) - 24 freq declaire (3) - 1 freq deelin (3) - 1 freq deidline (3) - 1 freq deadline (3) - 4 freq dellin (3) - 5 freq incline (3) - 6 freq declanq (3) - 5 freq declinin (3) - 1 freq deckin (3) - 1 freq declir (3) - 1 freq devlin (3) - 1 freq derlin (3) - 1 freq declang (3) - 1 freq |
SoundEx code - D245 decline - 20 freq declined - 5 freq declaimed - 1 freq disclaimers - 1 freq dazzling - 2 freq declan - 35 freq declaim - 1 freq dakklin - 1 freq daizzlement - 1 freq daghlian's - 1 freq declines - 1 freq daizzlin - 1 freq duachlin - 1 freq deuklins - 2 freq declinet - 1 freq declint - 1 freq declinin - 1 freq declin - 1 freq deklain - 1 freq declining - 2 freq declang - 1 freq dougalmcshoogle - 3 freq ducklings - 1 freq declanokane - 9 freq declanq - 5 freq |
MetaPhone code - TKLN decline - 20 freq taiglin - 3 freq ticklin - 6 freq tacklin - 4 freq declan - 35 freq dakklin - 1 freq tecklin - 1 freq declin - 1 freq tagline - 2 freq deklain - 1 freq |
DECLINE |
| Time to execute Levenshtein function - 0.184616 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.327458 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.028107 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.036900 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.001221 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. |