| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ainward (0) - 4 freq aipward (1) - 1 freq inward (1) - 7 freq inwards (2) - 7 freq inwart (2) - 1 freq onward (2) - 5 freq atward (2) - 1 freq award (2) - 59 freq airnhard (2) - 1 freq akward (2) - 3 freq minzard (2) - 1 freq aakward (2) - 7 freq aukward (2) - 1 freq oanward (2) - 1 freq ackward (2) - 3 freq awkward (2) - 36 freq launward (2) - 1 freq kinnaird (3) - 1 freq bizzard (3) - 1 freq landward (3) - 6 freq norward (3) - 1 freq hindwird (3) - 1 freq deilward (3) - 1 freq hameward (3) - 13 freq awald (3) - 3 freq |
ainward (0) - 4 freq inward (1) - 7 freq aipward (2) - 1 freq oanward (2) - 1 freq onward (2) - 5 freq aakward (3) - 7 freq launward (3) - 1 freq akward (3) - 3 freq aukward (3) - 1 freq inwart (3) - 1 freq inwards (3) - 7 freq atward (3) - 1 freq award (3) - 59 freq awaard (4) - 1 freq coward (4) - 12 freq ootward (4) - 6 freq iainheard (4) - 1 freq toward (4) - 24 freq naard (4) - 1 freq inwairds (4) - 1 freq weyward (4) - 1 freq yin-wird (4) - 1 freq akwird (4) - 2 freq taeward (4) - 20 freq byward (4) - 2 freq |
SoundEx code - A563 anyroads - 1 freq anyroad - 7 freq ainward - 4 freq a-hunnért - 1 freq an'ards - 1 freq amrut - 1 freq |
MetaPhone code - ANWRT ainward - 4 freq |
AINWARD |
| Time to execute Levenshtein function - 0.369501 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.618193 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.031975 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.069167 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.000879 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. |