| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| awytit (0) - 1 freq wytit (1) - 20 freq skytit (2) - 9 freq evytit (2) - 1 freq awtie (2) - 1 freq airtit (2) - 42 freq wytin (2) - 66 freq avysit (2) - 1 freq awaitit (2) - 3 freq swytin (2) - 1 freq fiytit (2) - 1 freq wydit (2) - 1 freq twynit (2) - 2 freq antit (2) - 1 freq await (2) - 7 freq anyntit (2) - 1 freq stytit (2) - 1 freq awnit (2) - 2 freq dytit (2) - 2 freq 'wytin (2) - 1 freq awbeit (2) - 9 freq wycit (2) - 1 freq swypit (2) - 2 freq wypit (2) - 1 freq wyvit (2) - 3 freq |
awytit (0) - 1 freq wytit (1) - 20 freq awaitit (2) - 3 freq wypit (3) - 1 freq awbeit (3) - 9 freq dytit (3) - 2 freq watt (3) - 27 freq awnit (3) - 2 freq wyvit (3) - 3 freq actit (3) - 9 freq waitit (3) - 81 freq wutt (3) - 1 freq wautit (3) - 1 freq yowtit (3) - 1 freq wtt (3) - 1 freq wycit (3) - 1 freq awtie (3) - 1 freq airtit (3) - 42 freq wytin (3) - 66 freq await (3) - 7 freq evytit (3) - 1 freq fiytit (3) - 1 freq antit (3) - 1 freq witt (3) - 2 freq wydit (3) - 1 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 |
AWYTIT |
| Time to execute Levenshtein function - 0.277964 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.380496 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.027837 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.039424 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.001184 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. |