Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ootward (0) - 6 freq ootwart (1) - 2 freq ootwards (1) - 12 freq outward (1) - 1 freq ootwale (2) - 3 freq oanward (2) - 1 freq ootland (2) - 5 freq soothward (2) - 1 freq ootboard (2) - 4 freq norward (2) - 1 freq atward (2) - 1 freq outwards (2) - 1 freq onward (2) - 5 freq forward (2) - 158 freq ootwaled (2) - 1 freq toward (2) - 22 freq coward (2) - 12 freq ootwardly (2) - 3 freq doonward (2) - 5 freq howard (2) - 4 freq ootdae (3) - 5 freq ootraged (3) - 2 freq onboard (3) - 2 freq notwork (3) - 4 freq forwart (3) - 4 freq |
ootward (0) - 6 freq outward (1) - 1 freq toward (2) - 22 freq ootwards (2) - 12 freq atward (2) - 1 freq ootwart (2) - 2 freq ootwaled (3) - 1 freq ootwardly (3) - 3 freq howard (3) - 4 freq onward (3) - 5 freq coward (3) - 12 freq twaard (3) - 5 freq taeward (3) - 20 freq oanward (3) - 1 freq outwards (3) - 1 freq ootboard (3) - 4 freq ootboord (4) - 2 freq ward (4) - 89 freq weyward (4) - 1 freq ainward (4) - 4 freq twar (4) - 2 freq atwart (4) - 6 freq twad (4) - 1 freq towards (4) - 161 freq eastward (4) - 2 freq |
SoundEx code - O363 ootwart - 2 freq ootriders - 1 freq odoratif - 1 freq ootward - 6 freq ootwards - 12 freq ootwardly - 3 freq oatridge - 2 freq outward - 1 freq owthorities - 2 freq outwards - 1 freq odrdoke - 1 freq o'treating - 1 freq |
MetaPhone code - OTWRT ootwart - 2 freq ootward - 6 freq outward - 1 freq |
OOTWARD |
Time to execute Levenshtein function - 0.264034 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.495273 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.028024 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.039547 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.000889 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. |