| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| anyroad (0) - 7 freq anyroads (1) - 1 freq onyroad (1) - 8 freq anyboady (2) - 13 freq affroad (2) - 1 freq onyroads (2) - 5 freq abroad (2) - 35 freq android (2) - 6 freq a-rod (3) - 1 freq ayepad (3) - 1 freq unread (3) - 3 freq afyoag (3) - 1 freq i'broad (3) - 1 freq anorak (3) - 11 freq anymore (3) - 14 freq c--road (3) - 1 freq andra (3) - 116 freq broad (3) - 54 freq andras (3) - 8 freq annoay (3) - 1 freq angrya (3) - 3 freq noad (3) - 11 freq anyhoos (3) - 13 freq andro (3) - 4 freq affload (3) - 1 freq |
anyroad (0) - 7 freq onyroad (1) - 8 freq anyroads (2) - 1 freq android (3) - 6 freq unread (3) - 3 freq abroad (3) - 35 freq onyroads (3) - 5 freq anyboady (3) - 13 freq onyboady (4) - 1 freq unload (4) - 3 freq anyd (4) - 2 freq myriad (4) - 11 freq nord (4) - 1 freq untrod (4) - 1 freq andoed (4) - 1 freq nard (4) - 3 freq andriod (4) - 3 freq anurra (4) - 3 freq norrad (4) - 1 freq anyday (4) - 3 freq niroads (4) - 2 freq acrood (4) - 1 freq annad (4) - 1 freq road (4) - 1150 freq inroads (4) - 4 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 - ANRT anyroad - 7 freq |
ANYROAD |
| Time to execute Levenshtein function - 0.273038 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.374628 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.027964 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.039001 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.000934 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. |