| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| upwards (0) - 11 freq upwords (1) - 1 freq upwarts (1) - 2 freq upward (1) - 5 freq tawards (2) - 7 freq atwards (2) - 3 freq towards (2) - 161 freq cowards (2) - 5 freq wards (2) - 30 freq uplands (2) - 2 freq rewards (2) - 6 freq uphauds (2) - 8 freq outwards (2) - 1 freq upwardly (2) - 1 freq awards (2) - 35 freq onwards (2) - 19 freq upwart (2) - 8 freq edwards (2) - 5 freq tiwards (2) - 3 freq inwards (2) - 7 freq uphaud (3) - 121 freq boards (3) - 23 freq onwarts (3) - 1 freq ipads (3) - 1 freq uploads (3) - 1 freq |
upwards (0) - 11 freq upwords (1) - 1 freq upward (2) - 5 freq upwarts (2) - 2 freq onwards (3) - 19 freq awards (3) - 35 freq edwards (3) - 5 freq inwards (3) - 7 freq upwardly (3) - 1 freq tiwards (3) - 3 freq outwards (3) - 1 freq towards (3) - 161 freq atwards (3) - 3 freq tawards (3) - 7 freq wards (3) - 30 freq cowards (3) - 5 freq rewards (3) - 6 freq ootwards (4) - 12 freq words (4) - 802 freq swurds (4) - 2 freq awairds (4) - 3 freq swords (4) - 36 freq seawards (4) - 1 freq rawyards (4) - 1 freq wurds (4) - 208 freq |
SoundEx code - U163 upwards - 11 freq upforret - 1 freq uppertoon - 5 freq upward - 5 freq upairt - 1 freq upreeted - 1 freq upwarts - 2 freq upwardly - 1 freq uprooting - 1 freq upwart - 8 freq upwords - 1 freq |
MetaPhone code - UPWRTS upwards - 11 freq upwarts - 2 freq upwords - 1 freq |
UPWARDS |
| Time to execute Levenshtein function - 0.304958 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.586582 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.078310 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.038594 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.000844 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. |