Skip to main content

Dependency-Based Algorithms for Answer Validation Task in Russian Question Answering

  • Conference paper
Language Processing and Knowledge in the Web

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8105))

Abstract

This paper discusses the Answer Validation Task in Question Answering applied for Russian language. Due to poor language resources we are limited in selection of techniques for Question Answering. Dependency parse-based methods applied to factoid questions are in the primary focus. We notice that existing works use either pure syntactic dependency parsers or parsers which perform some extra shallow semantic analysis for English. The selection of either of the parsers is not justified in any of these works. We report experiments for Russian language in absence of WordNet on various combinations of rule-based parsers and graph matching algorithms, including our Parallel Graphs Traversal algorithm first published in ROMIP 2010 [23]. Performance is evaluated using a subset of ROMIP questions collection with ten-fold cross-validation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akhmatova, E., Molla, D.: Recognizing textual entailment via atomic propositions. In: Proceedings of the Machine Learning Challenges Workshop, Southampton, UK, pp. 385–403 (2006)

    Google Scholar 

  2. Bentivogli, L., Clark, P., Dagan, I., Dang, H., Giampiccolo, D.: The Seventh PASCAL Recognizing Textual Entailment Challenge. In: TAC 2011 Notebook Proceedings (2011)

    Google Scholar 

  3. Burger, J., et al.: Issues. Tasks and Program Structures to Roadmap Research in Question Answering. Technical Report. SRI International (2003)

    Google Scholar 

  4. Chen, P., Ding, W., Simmons, T., Lacayo, C.: Parsing Tree Matching Based Question Answering. In: Proc. of the Text Analysis Conference Workshop, Gaithersburg. USA (2008)

    Google Scholar 

  5. Li, F., et al.: THU QUANTA at TAC 2008 QA and RTE track. In: Text Analysis Conference (TAC 2008), Gaithersburg, Maryland USA (2008)

    Google Scholar 

  6. Ittycheriah, A.: A Statistical Approach For Open Domain Question Answering. In: Advances in Open Domain Question Answering, vol. 32, pp. 35–69. Springer, Netherlands (2006)

    Chapter  Google Scholar 

  7. Katrenko, S., Adriaans, P.: Using Maximal Embedded Syntactic Subtrees for Textual Entailment Recognition. In: Proceedings of RTE-2 Workshop, Venice, Italy (2006)

    Google Scholar 

  8. Katrenko, S., Toledo, A.: A Comparison Study of Lexical and Syntactic Overlap for Textual Entailment Recognition. In: Proceedings of BNAIC 2011 (2011)

    Google Scholar 

  9. Ligozat, A.-L., Grau, B., Vilnat, A., Robba, I.: Arnaud Grappy: Lexical validation of answers in Question Answering. Web Intelligence 2007, 330–333 (2007)

    Google Scholar 

  10. Magnini, B., Negri, M., Prevete, R., Tanev, H.: Is it the right answer?: exploiting web redundancy for Answer Validation. In: Proceedings of the 40th Annual Meeting on Association for Computational Linguistics, Philadelphia, Pennsylvania (2002)

    Google Scholar 

  11. Marsi, E.C., Krahmer, E.J., Bosma, W.E., Theune, M.: Normalized Alignment of Dependency Trees for Detecting Textual Entailment. In: Second PASCAL Recognising Textual Entailment Challenge, Venice, Italy, April 10-12, pp. 56–61 (2006)

    Google Scholar 

  12. Micol, D., Ferrández, O., Munoz, R., Palomar, M.: DLSITE-2: Semantic similarity based on syntactic dependency trees applied to textual entailment. In: Proceedings of the TextGraphs-2 Workshop, Rochester, NY, USA, pp. 73–80 (2007)

    Google Scholar 

  13. Moldovan, D., Pasca, M., Surdeanu, M.: Some Advanced Features of LCC’s PowerAnswer. In: Advances in Open Domain Question Answering, Text, Speech and Language Technology, Part 1, vol. 32, pp. 3–34 (2006)

    Google Scholar 

  14. Moldovan, D., et al.: LASSO: a tool for surfing the answer net. In: Proceedings of the 8th TExt Retrieval Conference (TREC-8), Gaithersburg, Maryland (1999)

    Google Scholar 

  15. Pakray, P., et al.: A Hybrid Question Answering System based on Information Retrieval and Answer Validation. CLEF (Notebook Papers/Labs/Workshop) (2011)

    Google Scholar 

  16. Prager, J.: Open-Domain Question–Answering. In: Foundations and Trends® in Information Retrieval, vol. 1(2), pp. 91–231 (2006), http:/dx.doi.org/10.1561/1500000001

    Google Scholar 

  17. Pradhan, S., Ward, W., Hacioglu, K., Martin, J., Jurafsky, D.: Shallow Semantic Parsing using Support Vector Machines. In: Proceedings of the Human Language Technology Conference/North American Chapter of the Association for Computational Linguistics Annual Meeting (HLT/NAACL-2004), Boston, MA, May 2-7 (2004)

    Google Scholar 

  18. Punyakanok, V., Roth, D., Yih, W.: Mapping Dependencies Trees: An Application to Question Answering. In: Proceedings of AI&Math 2004 (2004)

    Google Scholar 

  19. Rodrigo, Á., Peñas, A., Verdejo, F.: Overview of the answer validation exercise 2008. In: Peters, C., Deselaers, T., Ferro, N., Gonzalo, J., Jones, G.J.F., Kurimo, M., Mandl, T., Peñas, A., Petras, V. (eds.) CLEF 2008. LNCS, vol. 5706, pp. 296–313. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  20. Peñas, A., Rodrigo, A.: A Simple Measure to Assess Non-response. In: Proceedings of 49th Annual Meeting of the Association for Computational Linguistics - Human Language Technologies, ACL-HLT 2011 (2011)

    Google Scholar 

  21. Schilder, F., McInnes, B.T.: Word and tree-based similarities for textual entailment. In: Magnini, B., Dagan, I. (eds.) Proceedings of the Second PASCAL Workshop on Textual Entailment, Venice, Italy, pp. 140–145 (2006)

    Google Scholar 

  22. Schlaefer, N.: A Semantic Approach to Question Answering (2007)

    Google Scholar 

  23. Solovyev, A.: Who is to blame and Where the dog is buried? Method of answers validations based on fuzzy matching of semantic graphs in Question answering system. In: Proceedings of ROMIP 2011, Kazan, pp. 125–141 (2011)

    Google Scholar 

  24. Solovyev, A.: Algorithms for Answers Validation task in Question Answering. Proceedings of Voronezh State University, Systems Analysis and Information Technologies 2, 181–188 (2011)

    Google Scholar 

  25. Toldova, S.J., et al.: NLP evaluation 2011–2012: Russian syntactic parsers. In: Computational Linguistics and Intellectual Technologies. Papers from the Annual International Conference “Dialogue”, vol. 2(11), pp. 77–92 (2012)

    Google Scholar 

  26. Wang, R., Neumann, G.: Using Recognizing Textual Entailment as a Core Engine for Answer Validation. In: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary (2007)

    Google Scholar 

  27. Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between tree and related problems. SIAM J. Comput. 18(6), 1245–1262 (1989)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Solovyev, A. (2013). Dependency-Based Algorithms for Answer Validation Task in Russian Question Answering. In: Gurevych, I., Biemann, C., Zesch, T. (eds) Language Processing and Knowledge in the Web. Lecture Notes in Computer Science(), vol 8105. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40722-2_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40722-2_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40721-5

  • Online ISBN: 978-3-642-40722-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics