| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| awardit (0) - 4 freq awairdit (1) - 2 freq awarded (2) - 6 freq wirdit (2) - 1 freq waldit (2) - 1 freq warpit (2) - 1 freq lardit (2) - 1 freq awaitit (2) - 3 freq beardit (2) - 2 freq wardin (2) - 1 freq warmit (2) - 2 freq wareit (2) - 1 freq guardit (2) - 1 freq waddit (2) - 3 freq await (2) - 7 freq awards (2) - 35 freq award (2) - 59 freq warkit (2) - 23 freq awarding (2) - 1 freq warit (2) - 1 freq wadit (2) - 1 freq owerdid (3) - 1 freq adaptit (3) - 6 freq warie (3) - 1 freq worrit (3) - 22 freq |
awardit (0) - 4 freq awairdit (1) - 2 freq wirdit (2) - 1 freq weirdit (3) - 5 freq waddit (3) - 3 freq guardit (3) - 1 freq award (3) - 59 freq warit (3) - 1 freq wadit (3) - 1 freq wareit (3) - 1 freq warkit (3) - 23 freq awards (3) - 35 freq lardit (3) - 1 freq warpit (3) - 1 freq waldit (3) - 1 freq warmit (3) - 2 freq awarded (3) - 6 freq beardit (3) - 2 freq wardin (3) - 1 freq gairdit (4) - 6 freq awrite (4) - 36 freq fairdit (4) - 1 freq warmt (4) - 2 freq wuidit (4) - 1 freq wardly (4) - 1 freq |
SoundEx code - A633 airted - 31 freq airtit - 42 freq airth-turned - 1 freq airy-heidit - 1 freq awarded - 6 freq awardit - 4 freq airt-oot - 2 freq awairdit - 2 freq |
MetaPhone code - AWRTT awarded - 6 freq awardit - 4 freq awairdit - 2 freq |
AWARDIT |
| Time to execute Levenshtein function - 0.230062 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.368589 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.027683 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.037378 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.000963 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. |