| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| inroads (0) - 4 freq inropads (1) - 1 freq inrowes (2) - 1 freq anyroads (2) - 1 freq onyroads (2) - 5 freq noads (2) - 1 freq niroads (2) - 2 freq roads (2) - 105 freq threads (3) - 8 freq onieroads (3) - 6 freq incomes (3) - 1 freq roars (3) - 23 freq acroas (3) - 4 freq coads (3) - 1 freq inas (3) - 1 freq road' (3) - 5 freq reads (3) - 59 freq road (3) - 1150 freq i'roadie (3) - 3 freq inhad (3) - 1 freq intaks (3) - 1 freq unload (3) - 3 freq invloaps (3) - 1 freq kinross (3) - 6 freq loads (3) - 87 freq |
inroads (0) - 4 freq onyroads (2) - 5 freq inropads (2) - 1 freq anyroads (2) - 1 freq niroads (2) - 2 freq onieroads (3) - 6 freq roads (3) - 105 freq inrowes (3) - 1 freq noads (3) - 1 freq nads (4) - 1 freq breads (4) - 1 freq treads (4) - 1 freq unrade (4) - 1 freq inwards (4) - 7 freq nomads (4) - 1 freq nods (4) - 61 freq inhauds (4) - 3 freq ingrids (4) - 1 freq unread (4) - 3 freq prods (4) - 4 freq anyroad (4) - 7 freq onyroad (4) - 8 freq rods (4) - 26 freq innards (4) - 4 freq croods (4) - 30 freq |
SoundEx code - I563 innerdaeks - 1 freq innarts - 1 freq immortal - 21 freq inherited - 9 freq immortals - 2 freq inheritit - 3 freq inheritance - 11 freq inheritin - 2 freq inheritaunce - 1 freq inherit - 7 freq innards - 4 freq immortality - 5 freq inward - 7 freq inwardly - 1 freq inheritors - 1 freq inherieted - 1 freq i'north - 1 freq inheritence - 2 freq inwards - 7 freq immortalitie - 1 freq inroads - 4 freq immortalised - 1 freq inarticulate - 1 freq inwairds - 1 freq inert - 3 freq inordinate - 1 freq inwartly - 1 freq inwart - 1 freq inertia - 1 freq iainheard - 1 freq iainrwhite - 1 freq |
MetaPhone code - INRTS innarts - 1 freq innards - 4 freq inroads - 4 freq |
INROADS |
| Time to execute Levenshtein function - 0.216155 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.355564 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.027882 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.038278 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.000922 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. |