| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| upwart (0) - 8 freq upwarts (1) - 2 freq upward (1) - 5 freq peart (2) - 1 freq thwart (2) - 1 freq apeart (2) - 1 freq atwart (2) - 6 freq onwart (2) - 2 freq inwart (2) - 1 freq swart (2) - 2 freq apart (2) - 113 freq wart (2) - 4 freq spoart (2) - 7 freq upairt (2) - 1 freq upwae (2) - 1 freq part (2) - 188 freq towart (2) - 54 freq upstart (2) - 1 freq upact (2) - 1 freq edwart (2) - 5 freq upwards (2) - 11 freq depart (3) - 7 freq plat (3) - 4 freq plaet (3) - 5 freq fumart (3) - 1 freq |
upwart (0) - 8 freq upward (2) - 5 freq upwarts (2) - 2 freq upairt (3) - 1 freq wart (3) - 4 freq towart (3) - 54 freq powert (3) - 2 freq apart (3) - 113 freq edwart (3) - 5 freq part (3) - 188 freq swart (3) - 2 freq peart (3) - 1 freq apeart (3) - 1 freq atwart (3) - 6 freq inwart (3) - 1 freq onwart (3) - 2 freq prayt (4) - 2 freq seawart (4) - 4 freq poort (4) - 5 freq fowert (4) - 10 freq appert (4) - 1 freq akwirt (4) - 1 freq puirt (4) - 2 freq warty (4) - 1 freq lawert (4) - 1 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 - UPWRT upward - 5 freq upwart - 8 freq |
UPWART |
| Time to execute Levenshtein function - 0.202254 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.335709 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.027019 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.037650 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.000841 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. |