A string matching based algorithm for performance evaluation of mathematical expression recognition

DOI10.1007/S12046-013-0221-6zbMath1322.68167OpenAlexW1990946556MaRDI QIDQ746565

Arun Agarwal, P. Pavan Kumar, Chakravarthy Bhagvati

Publication date: 16 October 2015

Published in: Sādhanā (Search for Journal in Brave)

Full work available at URL: https://www.ias.ac.in/describe/article/sadh/039/01/0063-0079

zbMATH Keywords

performance evaluationlinear representationLevenshtein edit distancemathematical expression recognition

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Algorithms on strings (68W32)

Uses Software

• LaTeX
• INFTY

Cites Work

• Unnamed Item
• Unnamed Item
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• The Tree-to-Tree Correction Problem
• 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

This page was built for publication: A string matching based algorithm for performance evaluation of mathematical expression recognition