TY - GEN
T1 - Advancing Math Formula Search Using Diverse Structural and Symbolic Representations
AU - Vemuganti, Sumedh
AU - Seiya, Ayu
AU - Kani, Nickvash
N1 - Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.
PY - 2025
Y1 - 2025
N2 - We present a comprehensive analysis of search engines from past MathIR competitions (ARQMath, NTCIR) and investigate the semantic representations required for effective formula retrieval. After evaluating these search engines’ methodologies and performance, we uncover a diverse range of equation-parsing and feature-extraction strategies. Inspired by these approaches, we present an ensemble-based retrieval system, integrating symbolic, tree-based, and textual representations of formulas. A key innovation of our work is the Leaf-to-Leaf (L2L) feature extraction method, which captures structural dependencies in formula trees by identifying the shortest paths of operators between pairs of leaf nodes. Our system combines L2L features with symbol-based and LaTeX-based rankings, surpassing the top performing ARQMath-3 search engines in nDCG′ and mAP′ metrics, while matching or exceeding the top NTCIR-12 performers in PR′@{15, 20} and P′@{5, 10, 15, 20} measures. These results demonstrate the effectiveness of leveraging multiple feature spaces to enhance mathematical formula retrieval.
AB - We present a comprehensive analysis of search engines from past MathIR competitions (ARQMath, NTCIR) and investigate the semantic representations required for effective formula retrieval. After evaluating these search engines’ methodologies and performance, we uncover a diverse range of equation-parsing and feature-extraction strategies. Inspired by these approaches, we present an ensemble-based retrieval system, integrating symbolic, tree-based, and textual representations of formulas. A key innovation of our work is the Leaf-to-Leaf (L2L) feature extraction method, which captures structural dependencies in formula trees by identifying the shortest paths of operators between pairs of leaf nodes. Our system combines L2L features with symbol-based and LaTeX-based rankings, surpassing the top performing ARQMath-3 search engines in nDCG′ and mAP′ metrics, while matching or exceeding the top NTCIR-12 performers in PR′@{15, 20} and P′@{5, 10, 15, 20} measures. These results demonstrate the effectiveness of leveraging multiple feature spaces to enhance mathematical formula retrieval.
KW - mathematical information retrieval
KW - query-by-expression
KW - set-based retrieval
UR - https://www.scopus.com/pages/publications/105003103379
UR - https://www.scopus.com/pages/publications/105003103379#tab=citedBy
U2 - 10.1007/978-3-031-88708-6_8
DO - 10.1007/978-3-031-88708-6_8
M3 - Conference contribution
AN - SCOPUS:105003103379
SN - 9783031887079
T3 - Lecture Notes in Computer Science
SP - 116
EP - 131
BT - Advances in Information Retrieval - 47th European Conference on Information Retrieval, ECIR 2025, Proceedings
A2 - Hauff, Claudia
A2 - Macdonald, Craig
A2 - Jannach, Dietmar
A2 - Kazai, Gabriella
A2 - Nardini, Franco Maria
A2 - Pinelli, Fabio
A2 - Silvestri, Fabrizio
A2 - Tonellotto, Nicola
PB - Springer
T2 - 47th European Conference on Information Retrieval, ECIR 2025
Y2 - 6 April 2025 through 10 April 2025
ER -