| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| deadpan (0) - 3 freq deidpan (1) - 1 freq readan (2) - 10 freq drappan (2) - 1 freq leadan (2) - 5 freq headan (2) - 3 freq rampan (3) - 2 freq reapin (3) - 4 freq madman (3) - 7 freq meanan (3) - 12 freq lepan (3) - 1 freq defyan (3) - 1 freq denyan (3) - 2 freq tea-pat (3) - 1 freq happan (3) - 2 freq dartan (3) - 1 freq leadin (3) - 66 freq tendan (3) - 1 freq dwam-an (3) - 1 freq breadman (3) - 1 freq wearan (3) - 9 freq nearhan (3) - 28 freq leaden (3) - 1 freq dreedan (3) - 1 freq bendan (3) - 1 freq |
deadpan (0) - 3 freq deidpan (1) - 1 freq did-an (4) - 1 freq drapin (4) - 1 freq deepen (4) - 6 freq dodgan (4) - 1 freq addan (4) - 3 freq deadline (4) - 4 freq dampen (4) - 1 freq deddin (4) - 1 freq daddin (4) - 1 freq leadan (4) - 5 freq drappan (4) - 1 freq readan (4) - 10 freq headan (4) - 3 freq dadden (4) - 1 freq demean (5) - 1 freq deadbeat (5) - 2 freq draegan (5) - 1 freq deaein (5) - 1 freq deday (5) - 5 freq dean (5) - 18 freq deuan (5) - 16 freq readeen (5) - 1 freq hadean (5) - 3 freq |
SoundEx code - D315 deadpan - 3 freq deidpan - 1 freq data-bank - 1 freq data-banks - 2 freq databanks - 1 freq |
MetaPhone code - TTPN deadpan - 3 freq deidpan - 1 freq |
DEADPAN die - 122 freq died - 152 freq dee - 1204 freq dee'd - 93 freq deid - 946 freq deadly - 18 freq deidly - 19 freq hauf-deid - 8 freq deidlie - 7 freq deidkist - 2 freq lang-deid - 3 freq deid-centre - 1 freq half-deid - 1 freq deadline - 4 freq deadpan - 3 freq ston-dead - 1 freq braindead - 1 freq |
| Time to execute Levenshtein function - 0.263981 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.439104 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.039085 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.039780 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.000983 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. |