| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| onyroad (0) - 8 freq onyroads (1) - 5 freq anyroad (1) - 7 freq onyboady (2) - 1 freq anyroads (2) - 1 freq oanyboady (3) - 1 freq oakroyd (3) - 1 freq noad (3) - 11 freq froad (3) - 4 freq onyhow (3) - 9 freq android (3) - 6 freq myriad (3) - 11 freq onyone (3) - 23 freq onyman (3) - 1 freq untrod (3) - 1 freq niroads (3) - 2 freq someroad (3) - 1 freq onboard (3) - 2 freq anyboady (3) - 13 freq conrod (3) - 1 freq unload (3) - 3 freq holyrood (3) - 45 freq onyway (3) - 22 freq unread (3) - 3 freq c--road (3) - 1 freq |
onyroad (0) - 8 freq anyroad (1) - 7 freq onyroads (2) - 5 freq unread (3) - 3 freq anyroads (3) - 1 freq onyboady (3) - 1 freq abroad (4) - 34 freq norrad (4) - 1 freq onieroads (4) - 6 freq onerous (4) - 1 freq road (4) - 1127 freq onybody (4) - 416 freq onybud (4) - 1 freq nord (4) - 1 freq unrade (4) - 1 freq nerd (4) - 2 freq nard (4) - 3 freq inroads (4) - 4 freq onyday (4) - 1 freq conrad (4) - 47 freq broad (4) - 54 freq untrod (4) - 1 freq niroads (4) - 2 freq oanyboady (4) - 1 freq noad (4) - 11 freq |
SoundEx code - O563 onward - 5 freq onyroad - 8 freq onyroads - 5 freq oanward - 1 freq onwards - 19 freq onieroads - 6 freq onward-rairin - 1 freq oonertakkin - 1 freq 'onward' - 1 freq onwart - 2 freq onwarts - 1 freq onrtkqwab - 1 freq |
MetaPhone code - ONRT onyroad - 8 freq |
ONYROAD |
| Time to execute Levenshtein function - 0.178970 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.329600 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.028001 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.037743 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.000846 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. |