| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ootwards (0) - 12 freq outwards (1) - 1 freq ootward (1) - 6 freq ootwart (2) - 2 freq norwards (2) - 1 freq atwards (2) - 3 freq fitwards (2) - 1 freq dotards (2) - 1 freq onwards (2) - 19 freq soothwards (2) - 1 freq cowards (2) - 5 freq doonwards (2) - 8 freq outward (2) - 1 freq towards (2) - 161 freq ootwales (2) - 1 freq ootwardly (2) - 3 freq coowards (2) - 1 freq forwards (2) - 5 freq stewards (3) - 4 freq loards (3) - 1 freq howard (3) - 4 freq bollards (3) - 2 freq tawards (3) - 7 freq forwirds (3) - 1 freq oanward (3) - 1 freq |
ootwards (0) - 12 freq outwards (1) - 1 freq towards (2) - 161 freq atwards (2) - 3 freq ootward (2) - 6 freq ootwardly (3) - 3 freq coowards (3) - 1 freq twaards (3) - 1 freq outward (3) - 1 freq tiwards (3) - 3 freq taewards (3) - 183 freq tawards (3) - 7 freq fitwards (3) - 1 freq cowards (3) - 5 freq onwards (3) - 19 freq seawards (4) - 1 freq toward (4) - 22 freq doonwards (4) - 8 freq ootwart (4) - 2 freq toward's (4) - 1 freq towarts (4) - 5 freq awards (4) - 35 freq taywords (4) - 1 freq norwards (4) - 1 freq dotards (4) - 1 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 - OTWRTS ootwards - 12 freq outwards - 1 freq |
OOTWARDS |
| Time to execute Levenshtein function - 0.208958 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.429224 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.031222 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.036984 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.000877 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. |