Faceted Search for Mathematics

  • Radu HambasanEmail author
  • Michael Kohlhase
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9582)


Faceted search is one of the most practical ways to browse a large corpus of information. Information is categorized automatically for a given query and the user is given the opportunity to further refine his/her query. Many search engines offer a powerful faceted search engine, but only on the textual level. Faceted Search in the context of Math Search is still unexplored territory.

In this paper, we describe one way of solving the faceted search problem in mathematics: by extracting recognizable formula schemata from a given set of formulae and using these schemata to divide the initial set into formula classes. Also, we provide a direct application by integrating this solution with existing services.


Search Engine Hash Table Formula Class Keyword Query Facet Search 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.



This work has been supported by the Leibniz Association under grant SAW-2012-FIZ_KA-2 (Project MathSearch). The authors gratefully acknowledge fruitful discussions with Fabian Müller, Wolfram Sperber, and Olaf Teschke in the MathSearch Project, which led to this research (the ZBMath information service uses faceted search on the non-formula dimensions very successfully) and clarified the requirements from an application point of view.


  1. 1.
    Aizawa, A., et al.: NTCIR-11 Math-2 task overview. In: Kando, N., Joho, H., Kishida, K. (eds.) NTCIR Workshop 11 Meeting, pp. 88–98. NII, Tokyo (2014). Google Scholar
  2. 2.
    Apache Lucene. Accessed 4 Oct 2015
  3. 3. e-Print archive. Accessed 12 June 2012
  4. 4.
    Dean, J., Ghemawat, S.: MapReduce: simplified dataprocessing on large clusters (2004)Google Scholar
  5. 5.
    Elastic Search. Accessed 7 Dec 2014
  6. 6.
    Ginev, D., Corneli, J.: NNexus reloaded. In: Watt, S.M., Davenport, J.H., Sexton, A.P., Sojka, P., Urban, J. (eds.) CICM 2014. LNCS, vol. 8543, pp. 423–426. Springer, Heidelberg (2014)Google Scholar
  7. 7.
    Graf, P.: Substitution tree indexing. In: Hsiang, J. (ed.) Rewriting Techniques and Applications. LNCS, pp. 117–131. Springer, Heidelberg (1994)Google Scholar
  8. 8.
    Hambasan, R., Kohlhase, M., Prodescu, C.: MathWeb-search at NTCIR-11. In: Kando, N., Joho, H., Kishida, K. (eds.) NTCIR Workshop 11 Meeting, pp. 114–119. NII, Tokyo (2014). Google Scholar
  9. 9.
    Kando, N., Joho, H., Kishida, K. (eds.) NTCIR Workshop 11 Meeting. NII, Tokyo, Japan (2014)Google Scholar
  10. 10.
    LaTeX - A document preparation system. Accessed 4 Oct 2015
  11. 11.
    LevelDB. Accessed 21 Dec 2014
  12. 12.
    Mathematical Markup Language.
  13. 13.
    Mathematics Subject Classification (MSC) SKOS (2012). Accessed 31 Aug 2012
  14. 14.
    Miller, B.: LaTeXML: A Open image in new window to XML Converter. Accessed 12 Mar 2013
  15. 15.
    XSLT for Presentation MathML in a Browser. 20 December 2000. Accessed 4 Apr 2015
  16. 16.
    Yee, K.-P., et al.: Faceted metadata for image search, browsing. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems. ACM Press, pp. 401–408 (2003).
  17. 17.
    Zentralblatt Math Website. Accessed 7 Dec 2014

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Computer ScienceJacobs University BremenBremenGermany

Personalised recommendations