| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| awairdit (0) - 2 freq awardit (1) - 4 freq wirdit (2) - 1 freq gairdit (2) - 6 freq fairdit (2) - 1 freq guairdit (2) - 6 freq awaitit (2) - 3 freq brairdit (2) - 3 freq wairdin (2) - 1 freq rewairdit (2) - 2 freq weirdit (2) - 5 freq awairds (2) - 3 freq awaird (2) - 2 freq breirdit (3) - 2 freq airmit (3) - 4 freq plaidit (3) - 5 freq dairtit (3) - 1 freq gairdin (3) - 19 freq mairmit (3) - 1 freq swairmin (3) - 2 freq buirdit (3) - 1 freq wuidit (3) - 1 freq aidit (3) - 1 freq airdie (3) - 2 freq lairnit (3) - 5 freq |
awairdit (0) - 2 freq awardit (1) - 4 freq weirdit (2) - 5 freq wirdit (2) - 1 freq rewairdit (3) - 2 freq awairds (3) - 3 freq wairdin (3) - 1 freq awaird (3) - 2 freq gairdit (3) - 6 freq fairdit (3) - 1 freq guairdit (3) - 6 freq reweirdit (4) - 1 freq award (4) - 59 freq wirrit (4) - 3 freq weirdin (4) - 1 freq waurrit (4) - 1 freq waird (4) - 1 freq wirdie (4) - 17 freq warkit (4) - 23 freq wirmit (4) - 1 freq warit (4) - 1 freq windit (4) - 5 freq raidit (4) - 2 freq wadit (4) - 1 freq waddit (4) - 3 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 |
AWAIRDIT |
| Time to execute Levenshtein function - 0.267221 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.441614 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.028592 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.043188 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.001182 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. |