Paper
23 January 2012 Layout-based substitution tree indexing and retrieval for mathematical expressions
Thomas Schellenberg, Bo Yuan, Richard Zanibbi
Author Affiliations +
Proceedings Volume 8297, Document Recognition and Retrieval XIX; 82970I (2012) https://doi.org/10.1117/12.912502
Event: IS&T/SPIE Electronic Imaging, 2012, Burlingame, California, United States
Abstract
We introduce a new system for layout-based (LATEX) indexing and retrieval of mathematical expressions using substitution trees. Substitution trees can efficiently store and find expressions based on the similarity of their symbols, symbol layout, sub-expressions and size. We describe our novel implementation and some of our modifications to the substitution tree indexing and retrieval algorithms. We provide an experiment testing our system against the TF-IDF keyword-based system of Zanibbi and Yuan and demonstrate that, in many cases, the quality of search results returned by both systems is comparable (overall means, substitution tree vs. keywordbased: 100% vs. 89% for top 1; 48% vs. 51% for top 5; 22% vs. 28% for top 20). Overall, we present a promising first attempt at layout-based substitution tree indexing and retrieval for mathematical expressions and believe that this method will prove beneficial to the field of mathematical information retrieval.
© (2012) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Thomas Schellenberg, Bo Yuan, and Richard Zanibbi "Layout-based substitution tree indexing and retrieval for mathematical expressions", Proc. SPIE 8297, Document Recognition and Retrieval XIX, 82970I (23 January 2012); https://doi.org/10.1117/12.912502
Lens.org Logo
CITATIONS
Cited by 23 scholarly publications and 2 patents.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Latex

Silicon

Computer programming

Computer science

Computing systems

Databases

Mathematics

Back to Top