A lattice-based approach for mathematical search using Formal Concept Analysis
Mathematical (or math) search is a challenging problem as math expressions are highly symbolic and structured. The vast majority of math search systems that adopt conventional text retrieval techniques are ineffective in searching math expressions. In this paper, we propose a lattice-based approach...
Saved in:
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
2013
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/97798 http://hdl.handle.net/10220/11240 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | Mathematical (or math) search is a challenging problem as math expressions are highly symbolic and structured. The vast majority of math search systems that adopt conventional text retrieval techniques are ineffective in searching math expressions. In this paper, we propose a lattice-based approach for math search. The proposed approach is based on Formal Concept Analysis (FCA), which is a powerful data analysis technique. In the proposed approach, math expressions are first converted into the corresponding MathML representation, from which math features are extracted. Next, the extracted features are used to construct a mathematical concept lattice. At the query time, the query expression is processed and inserted into the mathematical concept lattice, and the relevant expressions are retrieved and ranked. Finally, search results can be visualized and nevigated via a dynamic graph, thanks to the lattice structure. The proposed lattice-based math search approach is benchmarked against a conventional best match retrieval technique and results show it to be almost 10% better in terms of F1 for the top 30 retrieved results. |
|---|