| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| onwards (0) - 19 freq inwards (1) - 7 freq onwarts (1) - 1 freq onward (1) - 5 freq rewards (2) - 6 freq edwards (2) - 5 freq cowards (2) - 5 freq tawards (2) - 7 freq nonwurds (2) - 1 freq doonwards (2) - 8 freq inward (2) - 7 freq forwards (2) - 5 freq awards (2) - 35 freq tiwards (2) - 3 freq towards (2) - 170 freq wards (2) - 30 freq 'onward' (2) - 1 freq innards (2) - 4 freq inwairds (2) - 1 freq upwards (2) - 12 freq an'ards (2) - 1 freq ootwards (2) - 12 freq outwards (2) - 1 freq atwards (2) - 3 freq oanward (2) - 1 freq |
onwards (0) - 19 freq inwards (1) - 7 freq inwairds (2) - 1 freq onward (2) - 5 freq onwarts (2) - 1 freq an'ards (3) - 1 freq upwards (3) - 12 freq ootwards (3) - 12 freq innards (3) - 4 freq oanward (3) - 1 freq coowards (3) - 1 freq dounwards (3) - 1 freq wards (3) - 30 freq atwards (3) - 3 freq outwards (3) - 1 freq norwards (3) - 1 freq nonwurds (3) - 1 freq tawards (3) - 7 freq cowards (3) - 5 freq rewards (3) - 6 freq doonwards (3) - 8 freq edwards (3) - 5 freq inward (3) - 7 freq tiwards (3) - 3 freq towards (3) - 170 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 - ONWRTS onwards - 19 freq onwarts - 1 freq |
ONWARDS |
| Time to execute Levenshtein function - 0.202058 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.369135 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.027163 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.039121 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.000872 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. |