A string matching based algorithm for performance evaluation of mathematical expression recognition
From MaRDI portal
(Redirected from Publication:746565)
Recommendations
- Matching based ground-truth annotation for online handwritten mathematical expressions
- Error detection, error correction and performance evaluation in on-line mathematical expression recognition
- An integrated grammar-based approach for mathematical expression recognition
- Evaluation of a predictive algorithm for converting linear strings to mathematical formulae for an input method
- Refinement of the results of recognition of mathematical formulas using the Levenshtein distance
Cites work
- Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes
- Error detection, error correction and performance evaluation in on-line mathematical expression recognition
- Introduction to algorithms.
- Pattern classification.
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- The Tree-to-Tree Correction Problem
Cited in
(6)- Algorithm for Predicting Mathematical Formulae from Linear Strings for Mathematical Inputs
- Refinement of the results of recognition of mathematical formulas using the Levenshtein distance
- Evaluation of a predictive algorithm for converting linear strings to mathematical formulae for an input method
- Error detection, error correction and performance evaluation in on-line mathematical expression recognition
- Handwritten mathematical expression recognition via paired adversarial learning
- Matching based ground-truth annotation for online handwritten mathematical expressions
This page was built for publication: A string matching based algorithm for performance evaluation of mathematical expression recognition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q746565)