| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| deadlier (0) - 1 freq deadline (2) - 4 freq dealer (2) - 15 freq detdlie (2) - 1 freq deedlie (2) - 1 freq earlier (2) - 109 freq deidlie (2) - 7 freq easier (3) - 114 freq dallies (3) - 5 freq earrier (3) - 1 freq dallied (3) - 1 freq dailies (3) - 1 freq deidline (3) - 1 freq dazler (3) - 2 freq eader (3) - 1 freq sadlie (3) - 2 freq headie (3) - 1 freq daddies (3) - 4 freq deilie (3) - 2 freq deliver (3) - 47 freq lawlier (3) - 1 freq dallie (3) - 13 freq deafie (3) - 3 freq daadle (3) - 1 freq deeplie (3) - 1 freq |
deadlier (0) - 1 freq deidlie (3) - 7 freq deedlie (3) - 1 freq dealer (3) - 15 freq deadline (3) - 4 freq deidlike (4) - 2 freq dillier (4) - 1 freq declir (4) - 1 freq deedled (4) - 1 freq deleer (4) - 1 freq dailer (4) - 1 freq deedle (4) - 2 freq daadle (4) - 1 freq deadly (4) - 18 freq needler (4) - 2 freq sadler (4) - 1 freq deidline (4) - 1 freq earlier (4) - 109 freq detdlie (4) - 1 freq dazler (4) - 2 freq reader (5) - 89 freq deadlock (5) - 1 freq callier (5) - 1 freq deidly (5) - 19 freq paddler (5) - 2 freq |
SoundEx code - D346 deadlier - 1 freq |
MetaPhone code - TTLR toddler - 2 freq tiddler - 2 freq tytler - 1 freq dtaylor - 7 freq deadlier - 1 freq |
DEADLIER |
| Time to execute Levenshtein function - 0.220889 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.372760 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.027653 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.038088 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.000912 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. |