- Typos in the "short answer" question type are currently hard to catch, you'd need to find all different misspelled (mispelled?!) versions
- STACK also offers string answers and can do "math" on it. One such "math" way is the Levenshtein string distance, which can measure word similarity. It is used in many state of the art spell checkers.
- This works well and is useful outside of maths (or STEM in general), e.g. you could ask "Name the river in Mark Twain's Huckleberry Finn" and accept all misspellings of "Mis(s)is(s)ip(p)i" at once.
Some sources:
- Original paper as presented at the STACK international meeting 2022: https://doi.org/10.3991/ijet.v17i23.35893
- STACK docs for the new implemented functionality: https://docs.stack-assessment.org/en/Topics/Levenshtein_distance/