| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| adhd (0) - 5 freq ahd (1) - 19 freq add (1) - 133 freq aghw (2) - 1 freq ahj (2) - 1 freq awhe (2) - 2 freq acnd (2) - 1 freq aed (2) - 2 freq ah (2) - 16973 freq 'ahd (2) - 1 freq addy (2) - 6 freq ded (2) - 4 freq dhu (2) - 2 freq washd (2) - 2 freq id'd (2) - 1 freq dht (2) - 1 freq ahm (2) - 201 freq did (2) - 2817 freq a'h (2) - 2 freq ah- (2) - 4 freq akh (2) - 1 freq shd (2) - 8 freq dd (2) - 1 freq anh (2) - 1 freq ade (2) - 3 freq |
adhd (0) - 5 freq ahd (2) - 19 freq dohd (2) - 1 freq add (2) - 133 freq udhr (3) - 1 freq dud (3) - 2 freq eihd (3) - 2 freq adead (3) - 1 freq eahd (3) - 1 freq ached (3) - 4 freq addi (3) - 3 freq dadd (3) - 2 freq dhe (3) - 2 freq added (3) - 173 freq thd (3) - 1 freq dpd (3) - 1 freq adda (3) - 4 freq odd (3) - 134 freq dod (3) - 129 freq dzd (3) - 1 freq hd (3) - 4 freq 'hd (3) - 1 freq aided (3) - 2 freq dh (3) - 1 freq dnd (3) - 1 freq |
SoundEx code - A330 athoot - 319 freq 'audit - 1 freq addit - 97 freq added - 173 freq athout - 27 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 |
ADHD |
| Time to execute Levenshtein function - 0.216618 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.446713 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.068044 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.080293 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.001073 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. |