| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| deathly (0) - 2 freq deithly (1) - 1 freq eithly (2) - 2 freq daithly (2) - 3 freq deaths (2) - 8 freq death's (2) - 4 freq death (2) - 170 freq neatly (2) - 26 freq earthly (2) - 10 freq deadly (2) - 18 freq dearly (2) - 13 freq dentily (2) - 1 freq dently (2) - 1 freq deftly (2) - 1 freq peaty (3) - 4 freq weather (3) - 179 freq breathy (3) - 2 freq deathlike (3) - 1 freq leatham (3) - 9 freq deith (3) - 103 freq deafult (3) - 2 freq healy (3) - 4 freq stately (3) - 8 freq dealt (3) - 33 freq cathay (3) - 1 freq |
deathly (0) - 2 freq deithly (1) - 1 freq daithly (2) - 3 freq death (3) - 170 freq earthly (3) - 10 freq eithly (3) - 2 freq deaths (3) - 8 freq dachle (4) - 1 freq deiths (4) - 7 freq daithlie (4) - 1 freq airthly (4) - 1 freq dath (4) - 1 freq daachle (4) - 1 freq deith (4) - 103 freq dettel (4) - 1 freq dahl (4) - 8 freq laithly (4) - 2 freq deeth (4) - 4 freq deadly (4) - 18 freq dettol (4) - 1 freq deftly (4) - 1 freq dently (4) - 1 freq dearly (4) - 13 freq dentily (4) - 1 freq neatly (4) - 26 freq |
SoundEx code - D340 daithlie - 1 freq doddle - 4 freq daidle - 2 freq detail - 43 freq daudle - 1 freq dau-dle - 1 freq deadly - 18 freq deidly - 19 freq doodle - 10 freq 'deadly - 1 freq daithly - 3 freq dottle - 1 freq deathly - 2 freq dwadle - 1 freq dawdle - 10 freq deedly - 2 freq dettol - 1 freq deidlie - 7 freq daadle - 1 freq dad'll - 2 freq deithly - 1 freq dat'll - 10 freq diddle - 14 freq deedlie - 1 freq deedle - 2 freq detdlie - 1 freq dudley - 11 freq d'italia - 1 freq diddly - 1 freq datll - 2 freq dettel - 1 freq |
MetaPhone code - T0L daithlie - 1 freq daithly - 3 freq deathly - 2 freq deithly - 1 freq |
DEATHLY |
| Time to execute Levenshtein function - 0.301091 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.688371 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.076576 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.087887 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.000903 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. |