Evaluation of Manual Query Expansion Rules on a Domain Specific FAQ Collection

  • Mladen Karan
  • Jan Šnajder
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9283)


Frequently asked question (FAQ) knowledge bases are a convenient way to organize domain specific information. However, FAQ retrieval is challenging because the documents are short and the vocabulary is domain specific, giving rise to the lexical gap problem. To address this problem, in this paper we consider rule-based query expansion (QE) for domain specific FAQ retrieval. We build a small test collection and evaluate the potential of QE rules. While we observe some improvement for difficult queries, our results suggest that the potential of manual rule compilation is limited.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Burke, R.D., Hammond, K.J., Kulyukin, V., Lytinen, S.L., Tomuro, N., Schoenberg, S.: Question answering from frequently asked question files: Experiences with the FAQ Finder system. AI magazine 18(2), 57 (1997)Google Scholar
  2. 2.
    Carpineto, C., Romano, G.: A survey of automatic query expansion in information retrieval. ACM Computing Surveys (CSUR) 44(1), 1 (2012)CrossRefzbMATHGoogle Scholar
  3. 3.
    Latiri, C.C., Yahia, S.B., Chevallet, J., Jaoua, A.: Query expansion using fuzzy association rules between terms. Proceedings of JIM (2003)Google Scholar
  4. 4.
    Manning, C.D., Raghavan, P., Schütze, H.: Introduction to Information Retrieval, vol. 1. Cambridge university press, Cambridge (2008)CrossRefzbMATHGoogle Scholar
  5. 5.
    Mikolov, T., Chen, K., Corrado, G., Dean, J.: Efficient estimation of word representations in vector space. In: Workshop at ICLR (2013)Google Scholar
  6. 6.
    Mikolov, T., Sutskever, I., Chen, K., Corrado, G.S., Dean, J.: Distributed representations of words and phrases and their compositionality. In: Advances in Neural Information Processing Systems, pp. 3111–3119 (2013)Google Scholar
  7. 7.
    Porter, M.F.: Snowball: A language for stemming algorithms (2001)Google Scholar
  8. 8.
    Robertson, S.E., Walker, S., Jones, S., Hancock-Beaulieu, M.M., Gatford, M., et al.: Okapi at TREC-3. NIST Special Publication SP, pp. 109–109 (1995)Google Scholar
  9. 9.
    Sneiders, E.: Automated FAQ answering with question-specific knowledge representation for web self-service. In: HSI, pp. 298–305. IEEE (2009)Google Scholar
  10. 10.
    Surdeanu, M., Ciaramita, M., Zaragoza, H.: Learning to rank answers on large online QA collections. In: ACL, pp. 719–727 (2008)Google Scholar
  11. 11.
    Wei, J., Bressan, S., Ooi, B.C.: Mining term association rules for automatic global query expansion: methodology and preliminary results. In: Proceedings of WISE, vol. 1, pp. 366–373. IEEE (2000)Google Scholar
  12. 12.
    Xu, J., Croft, W.B.: Query expansion using local and global document analysis. In: Proceedings of ACM SIGIR, pp. 4–11. ACM (1996)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Text Analysis and Knowledge Engineering Lab, Faculty of Electrical Engineering and ComputingUniversity of ZagrebZagrebCroatia

Personalised recommendations