| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| upwart (0) - 8 freq upward (1) - 5 freq upwarts (1) - 2 freq part (2) - 196 freq spoart (2) - 7 freq upact (2) - 1 freq swart (2) - 2 freq edwart (2) - 5 freq peart (2) - 1 freq apeart (2) - 1 freq upairt (2) - 1 freq onwart (2) - 2 freq wart (2) - 4 freq thwart (2) - 1 freq apart (2) - 115 freq upwards (2) - 12 freq towart (2) - 54 freq inwart (2) - 1 freq upstart (2) - 1 freq upwae (2) - 1 freq atwart (2) - 6 freq pearl (3) - 8 freq watt (3) - 27 freq wirt (3) - 27 freq spiert (3) - 28 freq |
upwart (0) - 8 freq upwarts (2) - 2 freq upward (2) - 5 freq apart (3) - 115 freq onwart (3) - 2 freq towart (3) - 54 freq atwart (3) - 6 freq powert (3) - 2 freq upairt (3) - 1 freq inwart (3) - 1 freq wart (3) - 4 freq part (3) - 196 freq swart (3) - 2 freq edwart (3) - 5 freq peart (3) - 1 freq apeart (3) - 1 freq lawert (4) - 1 freq pwr (4) - 1 freq poort (4) - 5 freq appert (4) - 1 freq cowert (4) - 2 freq purrt (4) - 1 freq port (4) - 70 freq party (4) - 157 freq seawart (4) - 4 freq |
SoundEx code - U163 upwards - 12 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.217444 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.466309 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.059214 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.043092 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.000862 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. |