| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| onward (0) - 5 freq inward (1) - 7 freq onwards (1) - 19 freq oanward (1) - 1 freq onwart (1) - 2 freq onwarts (2) - 1 freq oswald (2) - 3 freq ainward (2) - 4 freq naard (2) - 1 freq onand (2) - 1 freq mcward (2) - 3 freq toward (2) - 22 freq forward (2) - 158 freq award (2) - 59 freq 'onward' (2) - 1 freq atward (2) - 1 freq byward (2) - 2 freq onboard (2) - 2 freq dounward (2) - 1 freq doonward (2) - 5 freq akward (2) - 3 freq norward (2) - 1 freq edward (2) - 33 freq reward (2) - 46 freq nard (2) - 3 freq |
onward (0) - 5 freq oanward (1) - 1 freq inward (1) - 7 freq ainward (2) - 4 freq onwart (2) - 2 freq onwards (2) - 19 freq inwards (3) - 7 freq tounward (3) - 1 freq nard (3) - 3 freq norward (3) - 1 freq inwart (3) - 1 freq edward (3) - 33 freq reward (3) - 46 freq ootward (3) - 6 freq coward (3) - 12 freq howard (3) - 4 freq akward (3) - 3 freq ward (3) - 89 freq outward (3) - 1 freq upward (3) - 5 freq seward (3) - 2 freq toward (3) - 22 freq doonward (3) - 5 freq naard (3) - 1 freq atward (3) - 1 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 - ONWRT onward - 5 freq oanward - 1 freq 'onward' - 1 freq onwart - 2 freq |
ONWARD |
| Time to execute Levenshtein function - 0.175652 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.339390 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.028791 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.038269 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.000880 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. |