Please use this identifier to cite or link to this item:
https://doi.org/10.1145/1076034.1076103
Title: | Question answering passage retrieval using dependency relations | Authors: | Cui, H. Sun, R. Li, K. Kan, M.-Y. Chua, T.-S. |
Keywords: | dependency parsing passage retrieval question answering |
Issue Date: | 2005 | Citation: | Cui, H.,Sun, R.,Li, K.,Kan, M.-Y.,Chua, T.-S. (2005). Question answering passage retrieval using dependency relations. SIGIR 2005 - Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval : 400-407. ScholarBank@NUS Repository. https://doi.org/10.1145/1076034.1076103 | Abstract: | State-of-the-art question answering (QA) systems employ term-density ranking to retrieve answer passages. Such methods often retrieve incorrect passages as relationships among question terms are not considered. Previous studies attempted to address this problem by matching dependency relations between questions and answers. They used strict matching, which fails when semantically equivalent relationships are phrased differently. We propose fuzzy relation matching based on statistical models. We present two methods for learning relation mapping scores from past QA pairs: one based on mutual information and the other on expectation maximization. Experimental results show that our method significantly outperforms state-of-the-art density-based passage retrieval methods by up to 78% in mean reciprocal rank. Relation matching also brings about a 50% improvement in a system enhanced by query expansion. © 2005 ACM. | Source Title: | SIGIR 2005 - Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval | URI: | http://scholarbank.nus.edu.sg/handle/10635/78313 | ISBN: | 1595930345 | DOI: | 10.1145/1076034.1076103 |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.