| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| awaited (0) - 4 freq waited (1) - 109 freq awaites (1) - 1 freq waiter (2) - 34 freq awarded (2) - 6 freq traited (2) - 1 freq awaits (2) - 8 freq abated (2) - 1 freq waired (2) - 1 freq await (2) - 7 freq waisted (2) - 1 freq waitet (2) - 20 freq adapted (2) - 2 freq awrite (2) - 36 freq 'wanted (2) - 1 freq swaeted (2) - 1 freq wafted (2) - 7 freq flaited (2) - 1 freq wailed (2) - 4 freq whited (2) - 2 freq wated (2) - 1 freq walted (2) - 1 freq wanted (2) - 265 freq wasted (2) - 24 freq baited (2) - 1 freq |
awaited (0) - 4 freq waited (1) - 109 freq wated (2) - 1 freq awaites (2) - 1 freq walted (3) - 1 freq wanted (3) - 265 freq wasted (3) - 24 freq wailed (3) - 4 freq whited (3) - 2 freq awaitin (3) - 6 freq awaitit (3) - 3 freq wyted (3) - 13 freq awaird (3) - 2 freq witd (3) - 1 freq waiten (3) - 1 freq weeted (3) - 1 freq baited (3) - 1 freq waired (3) - 1 freq await (3) - 7 freq awaits (3) - 8 freq waiter (3) - 34 freq wafted (3) - 7 freq waisted (3) - 1 freq abated (3) - 1 freq swaeted (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 - AWTT awaited - 4 freq awaitit - 3 freq |
AWAITED |
| Time to execute Levenshtein function - 0.192943 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.376148 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.027943 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.037568 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.000935 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. |