Grammatical verification for mathematical formula recognition based on context-free tree grammar

DOI10.1007/S11786-010-0023-8zbMath1205.68338OpenAlexW2010515667MaRDI QIDQ626924

Masakazu Suzuki, Seiichi Uchida, Akio Fujiyoshi

Publication date: 19 February 2011

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-010-0023-8

zbMATH Keywords

structural analysiscontext-free tree grammarformula recognitiongrammatical analysismathematical OCR

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10) Computing methodologies for text processing; mathematical typography (68U15)

Uses Software

• INFTY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tree adjunct grammars
• Spinal-formed context-free tree grammars
• Verification of Mathematical Formulae Based on a Combination of Context-Free Grammar and Tree Grammar
• Towards a Parser for Mathematical Formula Recognition
• Capturing Abstract Matrices from Paper

This page was built for publication: Grammatical verification for mathematical formula recognition based on context-free tree grammar