| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| adead (0) - 1 freq adeed (1) - 1 freq ahead (1) - 84 freq dead (1) - 273 freq area' (2) - 1 freq aaeam (2) - 2 freq deid (2) - 954 freq andean (2) - 1 freq added (2) - 173 freq gead (2) - 2 freq deat (2) - 1 freq aked (2) - 1 freq aeaw (2) - 1 freq ada (2) - 4 freq abean (2) - 1 freq waded (2) - 6 freq 'deed (2) - 19 freq annad (2) - 1 freq deud (2) - 1 freq areas (2) - 94 freq adela (2) - 4 freq pdea (2) - 1 freq tead (2) - 1 freq bread (2) - 40 freq aden (2) - 2 freq |
adead (0) - 1 freq dead (1) - 273 freq adeed (1) - 1 freq deyd (2) - 13 freq daad (2) - 5 freq add (2) - 138 freq deud (2) - 1 freq adda (2) - 4 freq ded (2) - 4 freq dad (2) - 266 freq ahead (2) - 84 freq doad (2) - 3 freq aided (2) - 2 freq deed (2) - 236 freq deid (2) - 954 freq laded (3) - 1 freq deaf (3) - 27 freq idea' (3) - 1 freq dood (3) - 1 freq jdea (3) - 1 freq aged (3) - 34 freq addie (3) - 6 freq adhd (3) - 5 freq rdad (3) - 1 freq dear (3) - 425 freq |
SoundEx code - A330 athoot - 319 freq 'audit - 1 freq addit - 97 freq added - 173 freq athout - 29 freq adead - 1 freq adhd - 5 freq atotie - 1 freq awaited - 4 freq addet - 25 freq a'daeth - 1 freq awaitit - 3 freq ati'da - 18 freq audit - 12 freq aathoot - 1 freq atidda - 7 freq €˜audit - 1 freq aided - 2 freq adeed - 1 freq awytit - 1 freq aidit - 1 freq a'thoot - 1 freq athott - 1 freq |
MetaPhone code - ATT 'audit - 1 freq addit - 97 freq added - 173 freq adead - 1 freq at'd - 4 freq adhd - 5 freq atotie - 1 freq addet - 25 freq aat'd - 5 freq 'at'd - 1 freq ati'da - 18 freq audit - 12 freq atidda - 7 freq €˜audit - 1 freq aided - 2 freq adeed - 1 freq awytit - 1 freq aidit - 1 freq |
ADEAD |
| Time to execute Levenshtein function - 0.246951 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.439412 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.028154 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.070005 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.000904 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. |